One or more PhD positions are available at the Theory of Combinatorial
Algorithms group (www.ti.inf.ethz.ch/ew/) within the Department of
Computer Science at ETH Zurich, Switzerland. The thesis projects are
supervised by Bernd Gärtner, Michael Hoffmann and Emo Welzl.
Our research interests lie on the boundary between Theoretical
Computer Science and Discrete Mathematics, with a focus on
combinatorics and algorithms for geometric structures.
Candidates should have a degree in Mathematics or Computer Science,
with an emphasis on and interest in some of the following areas
(listed in alphabetical order): algorithms & data structures,
algorithm engineering, combinatorial optimization, combinatorics,
complexity, combinatorial geometry, computational geometry, graph
drawing, graph theory, probability theory. The starting date is
flexible.
Applications should be sent via the online application system
https://app.hobsons.co.uk/AYApplicantLogin/fl_ApplicantLogin.asp?id=ethzcs
until Mar 31, 2018 (earlier submission is encouraged). Please mark
"Theory" and "Algorithms and combinatorics" among your research
interests.
For general information about the Computer Science PhD program at
ETHZ, see www.inf.ethz.ch/doctorate.
For further questions and information contact <tca@lists.inf.ethz.ch>.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
