PhD Positions in Efficient Algorithms and Network Visualization (m/w/d)
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.
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.
Research focus
- 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
- Algorithms and computational problems in cartograms and maps M odelling 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 Position 2 in Network Visualization
- Design and evaluation of network layout algorithms
- Design and evaluation of network visualization systems
- Graph embedding in Euclidean and non-Euclidean spaces
- Design and analysis of visualization quality metrics
- Algorithmic aspects of graph drawing, dimensionality reduction, and set visualization
- Human-centered evaluation of visual interfaces
- Visualization for explainable AI
- Semantic graph modeling and visualization for text and document data Environment
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
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.
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:
2 PhD Positions in Efficient Algorithms and Network Visualization 19.06.2026, Academic staff
Über den Arbeitgeber