Dagstuhl Seminar 26442
Parameterized Complexity in Graph Drawing: Challenges and Perspectives
( Oct 25 – Oct 30, 2026 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/26442
Organizers
- Akanksha Agrawal (Indian Institute of Techology Madras, IN)
- Philipp Kindermann (Universität Trier, DE)
- Martin Nöllenburg (TU Wien, AT)
- Meirav Zehavi (Ben Gurion University - Be'er Sheva, IL)
Contact
- Michael Gerke (for scientific matters)
- Simone Schilke (for administrative matters)
Related Seminars
Classification
- Computational Geometry
- Data Structures and Algorithms
Keywords
- Graph Drawing
- Parameterized Complexity
- Computational Geometry
- Graph Algorithms
