Dagstuhl-Seminar 25041
Solving Problems on Graphs: From Structure to Algorithms
( 19. Jan – 24. Jan, 2025 )
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/25041
Organisatoren
- Akanksha Agrawal (Indian Institute of Techology Madras, IN)
- Maria Chudnovsky (Princeton University, US)
- Daniel Paulusma (Durham University, GB)
- Oliver Schaudt (Bayer AG - Leverkusen, DE)
Kontakt
- Michael Gerke (für wissenschaftliche Fragen)
- Christina Schwarz (für administrative Fragen)
Dagstuhl Seminar Wiki
- Dagstuhl Seminar Wiki (Use personal credentials as created in DOOR to log in)
Gemeinsame Dokumente
- Dagstuhl Materials Page (Use personal credentials as created in DOOR to log in)
Programm
- Upload (Use personal credentials as created in DOOR to log in)
Many discrete optimization problems can be modelled as graph problems, leading to a long list of well-studied problems, which include graph partitioning, covering and packing problems, network design problems, width parameter problems, and so on. Most of these graph problems are computationally hard. However, this situation may change if we require the input to belong to some special graph class. This leads to two fundamental questions, which lie at the heart of our Dagstuhl Seminar: for which classes of graphs can a computationally hard graph problem be solved in polynomial time, and for which classes of graphs does the problem remain hard?
In our seminar, we aim to discover new insights that lead to results for a whole range of problems rather than just for a single problem alone. That is, our goal is to determine general properties, such that large classes of graphs problems sharing certain common features can be solved efficiently on a graph class if and only if the graph class has these properties. For this purpose, we aim to bring together researchers from Discrete Mathematics and Theoretical Computer Science.
Topics of the seminar will include:
- Graph Algorithms
- Graph Classes
- Graph Containment Relations
- Parameterized Complexity
- Width Parameters.
We plan an appropriate number of survey talks, presentations of recent results, open problem sessions, and ample time for problem solving. As outcomes we expect to develop new, general methodology for solving a large variety of graph problems. This will also increase our understanding of how the complexities of different graph problems are related to each other.
Creative Commons BY 4.0
Akanksha Agrawal, Maria Chudnovsky, Daniel Paulusma, and Oliver Schaudt
Please log in to DOOR to see more details.
- Akanksha Agrawal
- Bogdan Alecu
- Édouard Bonnet
- Maria Chudnovsky
- Julien Codsi
- Konrad Dabrowski
- Esther Galby
- Jan Goedgebeur
- Petr A. Golovach
- Meike Hatzel
- Shenwei Huang
- Lars Jaffke
- Bart Jansen
- Tuukka Korhonen
- Stefan Kratsch
- Michael Lampis
- Paloma Lima
- Daniel Lokshtanov
- Barnaby Martin
- Martin Milanic
- Pranabendu Misra
- Andrea Munaro
- Daniel Neuen
- Jelle Oostveen
- Sukanya Pandey
- Fahad Panolan
- Daniel Paulusma
- Marcin Pilipczuk
- Michal Pilipczuk
- Pawel Rzazewski
- Saket Saurabh
- Oliver Schaudt
- Roohani Sharma
- Mark Siggers
- Siani Smith
- Ramanujan Sridharan
- Csaba Tóth
- Nicolas Trotignon
- Kristina Vuskovic
- Michal Wlodarczyk
- Viktor Zamaraev
- Shira Zerbib
Verwandte Seminare
Klassifikation
- Computational Complexity
- Data Structures and Algorithms
- Discrete Mathematics
Schlagworte
- computational complexity
- graph classes
- graph containment relations
- graph width parameters
- graph algorithms
