dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. Faculty position at Wesleyan University, Middletown, CT USA
(Daniel Krizanc)
2. Workshop "Combinatorial Optimization meets Parameterized
Complexity" in Bonn (Dec 13-14) - Program and Registration
(Stefan Kratsch)
----------------------------------------------------------------------
Message: 1
Date: Wed, 16 Nov 2016 11:42:19 -0500
From: Daniel Krizanc <dkrizanc@wesleyan.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Faculty position at Wesleyan University, Middletown,
CT USA
Message-ID:
<05998e980b781d4fdd2f66625ae024c9.squirrel@webmail.wesleyan.edu>
Content-Type: text/plain;charset=utf-8
The Department of Mathematics and Computer Science at Wesleyan University
invites applications for a tenure track assistant professorship in
Computer Science to begin in Fall 2017. Candidates must have a Ph.D. in
Computer Science or similar discipline in hand by the time of appointment,
and must have a strong research record and experience in teaching. Theory,
programming languages, algorithms, and networking are well-represented in
the department. We encourage candidates in all areas of Computer Science
to apply, including those who deepen our existing research strengths, and
especially encourage candidates who can contribute to the diversity
(broadly conceived) of the department.
Duties include conducting an independent program of research, teaching,
advising and mentoring students, and participating in faculty governance
at the departmental and university level. Tenure track faculty in Computer
Science at Wesleyan have a 2/1 teaching load (three courses per year).
Wesleyan values both research and teaching highly and has a strong and
diverse student body.
We will begin reviewing applications on Dec. 1, 2016. Applications must
include a cover letter, curriculum vitae, research statement, teaching
statement and at least four letters of recommendation, one of which
discusses teaching. As part of your teaching statement or cover letter we
invite you to describe your cultural competencies and experiences engaging
a diverse student body.
Applications must be submitted online at
https://academicjobsonline.org/ajo/jobs/7547. Other correspondence
regarding this position may be sent to cssearch@wesleyan.edu.
------------------------------
Message: 2
Date: Thu, 17 Nov 2016 13:10:38 +0100
From: Stefan Kratsch <kratsch@cs.uni-bonn.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Workshop "Combinatorial Optimization meets
Parameterized Complexity" in Bonn (Dec 13-14) - Program and
Registration
Message-ID: <8ed4a34c-5dcb-85d6-4a79-8c0df4ea856a@cs.uni-bonn.de>
Content-Type: text/plain; charset=utf-8; format=flowed
You are cordially invited to participate in the workshop "Combinatorial
Optimization meets Parameterized Complexity" in Bonn on the 13th and
14th of December 2016.
The program for the two workshop days is now available (see below).
There are eight survey talks by invited speakers and four contributed
talks by local participants.
Participation is free of charge. If you are interested, please register
by sending an email with the subject "Workshop Registration" to
secret5@cs.uni-bonn.de containing your name, address, and affiliation.
Please also indicate whether you will be attending both or just one day
of the workshop.
The workshop will take place at Universitätsclub Bonn. The venue is
located at Konviktstraße 9, 53113 Bonn.
Further information can be found at
http://tcs.cs.uni-bonn.de/doku.php?id=research:workshop2016
We are looking forward to meeting you in Bonn!
Britta Peis, Heiko Röglin, and Stefan Kratsch
------------------------------------------------------------------------
Program:
Tuesday December 13:
09:00 - 09:15 Opening
09:15 - 10:15 Bart M.P. Jansen "The Power of Preprocessing: Gems in
Kernelization"
10:15 - 10:45 Coffee Break
10:45 - 11:45 Peter Rossmanith "Treewidth"
11:45 - 12:15 Contributed Talk
12:15 - 13:15 Lunch Break
13:15 - 14:15 Erik Jan van Leeuwen "Parameterized Algorithms for Network
Design"
14:15 - 14:45 Contributed Talk
14:45 - 15:15 Coffee Break
15:15 - 16:15 Lukasz Kowalik "Finding long paths by evaluating a polynomial"
16:15 - 16:45 Contributed Talk
Wednesday December 14:
09:00 - 10:00 Fabrizio Grandoni "Approximation Algorithms for
Unsplittable Flow on a Path"
10:00 - 10:30 Coffee Break
10:30 - 11:30 Tobias Harks "Sensitivity Analysis for Convex Separable
Optimization over Integral Polymatroids"
11:30 - 12:00 Contributed Talk
12:00 - 13:00 Lunch Break
13:00 - 14:00 Volker Kaibel "Describing Integer Points in Polyhedra"
14:00 - 14:30 Coffee Break
14:30 - 15:30 Gerhard Wöginger "Lower bounds for easy problems"
15:30 - 16:00 Closing
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 105, Issue 18
***************************************
No comments:
Post a Comment