[DMANET] Phd Position in Efficient Algorithms

The Chair for Efficient Algorithms, led by Prof. Stephen Kobourov, invites applications for a fully funded PhD student position at the Technical University of Munich (TUM), Campus Heilbronn. We seek strong candidates excited about algorithms for graph drawing and graph embedding, as well as related computational geometry and computational complexity problems and specifically invite applications by members of underrepresented groups in Computer Science (which include but are not limited to women and applicants with disabilities). Among others, possible research topics include: - Design and analysis of efficient algorithms for graph drawing problems - Design and analysis of efficient algorithms for hypergraph visualization - Computational complexity of graph and hypergraph embedding problems - Combinatorial properties and bounds for geometric graphs, drawings of graphs and other discrete structures - Graph embedding in Euclidean and non-Euclidean spaces - Algorithms and computational problems in cartograms and maps - Modelling and design of efficient solutions for problems with relevance in real-world Geographic Information Systems (GIS) - Parameterized algorithms or interactive approaches for computationally hard problems in geometric graphs, graph drawing and GIS Environment The Chair of Efficient algorithms offers a collaborative environment with strong engagement in theoretical, applied, and interdisciplinary projects. Incoming PhD students will join an active and established research group, which includes Dr. Jacob Miller, Dr. Soeren Terziadis, Dr. Markus Wallinger and Dr. Johannes Zink. The outcome of our research is published and presented at top-level international conferences every year. PhD students work closely with members of our research group, as well as with partners at other universities and institutes in Germany and abroad. TUM Campus Heilbronn is a rapidly growing center for research and education with a strong emphasis on computer science, data science, and artificial intelligence. The position involves teaching (5 hours per week) in tutorials, lectures, seminars, and practical courses on topics related to algorithms and theory. The working and teaching language is English; no German is required. Position & benefits This is a full-time employment position aimed at completing a PhD thesis. The position comes with a competitive salary according to the German TV-L E13 scale (approx. €57,000–€71,000 gross/year, depending on experience), 30 days of paid vacation, and full access to health insurance and social benefits. How to apply Please send: - A cover letter describing your research interests in algorithms and theory of graph drawing - Your CV - Your Master’s thesis - Academic transcripts with grades - If available links to publications or web applications that resulted from the work as a Bachelor or Master student showcasing your experience in the field. - If applicable links to repositories containing scientifically relevant implementations and coding work Email your application to positions [at] algo.cit.tum.de. Further information can also be found on the webpage https://www.cs.cit.tum.de/algo/open-positions/ ********************************************************** * * 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/ * **********************************************************