The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens one PostDoc position in approximation algorithms.
This position is supported by the
Swiss National Foundation Grant “Approximation Algorithms for Network Problems”.

The appointment is for one year, with tentative starting date on 1st
November 2017.
The gross salary is roughly 80.000 CHF per year (low taxes, around 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.

Team members will have the opportunity to cooperate with the
Algorithms and Complexity group at IDSIA, which currently counts 7
researchers. The current research interests of the group include:
– network design;
– resource allocation and scheduling problems;
– geometric packing problems;
– “fast” approximation algorithms.

IDSIA offers an international working environment. 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. Local restaurants serve very good (Italian style!) food.

Further details about the project can be found at:
http://people.idsia.ch/~grandoni/SNF2015.html

The interested candidates should email
– a detailed CV, including a list of publications and 2-3 references, and
– a short summary of past and current research interests
to:
fabrizio@idsia.ch

Applications should be sent as soon as possible, and possibly no
later than May 15th, 2017.
For any question, do not hesitate to contact:

Prof. Fabrizio Grandoni
fabrizio@idsia.ch
http://people.idsia.ch/~grandoni/