[DMANET] Ph.D. and PostDoc positions in Approximation Algorithms at IDSIA, University of Lugano, Switzerland

The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens two Ph.D. positions and one PostDoc position in
approximation algorithms, with a special focus on network design and
resource allocation problems. These positions are supported by the
Swiss National Foundation Grant "Approximation Algorithms for Network
Problems". The duration of this project is 3 years (with possible
extensions subject to approval by SNF) and the project should
tentatively start in Fall 2015.

Team members will have the opportunity to cooperate with the
Algorithms and Complexity group at IDSIA, which currently includes 7
researchers. IDSIA offers an international working environment, with
researchers of over 10 different nationalities.

Lugano is a tidy and lively town, with a wonderful view on Ceresio
lake and mountains around. Ticino Canton offers many opportunities for
hiking, biking, skiing, etc. Restaurants serve very good (Italian
style!) food.

- Ph.D. positions. The appointment is for 3 years, with the
possibility of an extension by 1 year (subject to approval by SNF).
The gross salary is roughly 50.000 CHF per year (low taxes, around
10-15%). There is generous travel support. The ideal candidate should
be bright and creative, and hold (or be close to obtaining) a Master
Degree in Computer Science, Mathematics, Physics, or related areas. A
solid background in Algorithms, Computational Complexity, Discrete
Mathematics, Probability Theory, and/or Graph Theory is helpful. A
good knowledge of written and spoken English is also required (while
knowledge of Italian is not needed).

- PostDoc position. The appointment will range from 1 to 3 years,
depending on the candidate. The salary is roughly 80.000 CHF per year
(low taxes, around 10-15%). There are no teaching duties and there is
generous travel support. The ideal candidate should hold (or be close
to obtaining) a Ph.D. in Computer Science, and should have a solid
publication record in the area of algorithms and complexity (possibly
in approximation algorithms). Top conferences in this area include
STOC, FOCS, SODA, ICALP, and ESA.

Further details about the project, the positions, and how to apply can
be found at:
http://people.idsia.ch/~grandoni/SNF2015.html

The deadline for the application (with moderate flexibility) is May 31st, 2015.
For any question, do not hesitate to contact:

Prof. Fabrizio Grandoni
fabrizio@idsia.ch
http://people.idsia.ch/~grandoni/
**********************************************************
*
* 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/
*
**********************************************************