PhD Positions in Theoretical Computer Science at ETH Zürich

One or more PhD positions are available at the Theory of Combinatorial Algorithms group. The thesis projects are supervised by Bernd Gärtner, Michael Hoffmann and/or 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.

Please send your application, including a letter of motivation, transcript of studies, copy of/link to Master thesis (if available), and three references to tca@lists.inf.ethz.ch.

See here for general information about the Computer Science PhD program at ETHZ.
For further questions and information contact tca@lists.inf.ethz.ch.