at the Algorithms and Complexity Department at the Max Planck Institute
for Informatics (MPI-INF) in Saarbrücken, Germany. The starting date is
negotiable and could be as early as June, 2022.
You will be part of a research project on "Approximation Algorithms for
Combinatorial Optimization Problems with Packing Constraints", which is
funded by the DFG (German Research Foundation). You will design and
analyze algorithms for problems arising in clustering, submodular
optimization, network design, and geometric optimization. Moreover, you
will identify the limits of the algorithmic solvability of these
problems, in particular, the hardness of approximation. For more details
on the topics and project-relevant algorithmic / mathematical tools, I
refer to the project description and a list of related papers.
https://gepris.dfg.de/gepris/projekt/399223600?language=en
https://people.mpi-inf.mpg.de/~jspoerha/project.html
You will be co-supervised by Prof. Danupon Nanongkai and myself. I am
the principal investigator of the project.
You hold a master's degree (ideally) or a bachelor's degree in computer
science, mathematics (or a related field) and have an excellent academic
record. You are enthusiastic about theoretical and mathematical
foundations of computer science and have a solid background in this
regard. You are highly self-motivated, excited to work independently on
hard problems, to learn new techniques, but also to discuss ideas with
your supervisors or in a team with other researchers.
We, the Algorithms and Complexity Department headed by Prof. Danupon
Nanongkai, are a strong, vibrant, broadly interested, and
internationally highly renowned group of researchers. We are part of one
of the strongest research clusters for algorithms and complexity in
Europe. We closely collaborate with researchers in other institutes on
the campus, including the Department of Computer Science of Saarland
University, CISPA Helmholtz Center for Information Security, and Max
Planck Institute for Software Systems.
https://www.mpi-inf.mpg.de/departments/algorithms-complexity
Our institute, MPI-INF, is among the more than 80 institutes run by the
Max Planck Society. The MPIs are Germany's premier basic research
institutes performing world-class, basic research in the fields of
medicine, biology, chemistry, physics, technology, and the humanities.
Since 1948, MPI researchers have been awarded 21 Nobel prizes certifying
the excellence of the research at MPIs.
The Max Planck Society seeks to increase the number of women in
those areas where they are underrepresented and therefore explicitly
encourages women to apply. The Max Planck Society is further
committed to employing more individuals with handicaps and particularly
encourages these to apply.
Please send your application by April, 15 to my email address below.
Include a short letter of motivation (about one page), a CV, names of
two references, as well as electronic copies of your degree
certificates, all as a single PDF. Do not hesitate to contact me in case
of questions.
Dr. Joachim Spoerhase
jspoerha "at" mpi-inf.mpg.de
https://people.mpi-inf.mpg.de/~jspoerha/
https://people.mpi-inf.mpg.de/~jspoerha/project.html
**********************************************************
*
* 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
