Activities
Selected Conferences and Talks
| Symposium on Theoretical Aspects of Computer Science (STACS) | 04.03. - 07.03.2025. Jena, Germany. | Listing spanning trees of outerplanar graphs by pivot-exchanges | Torsten Mütze |
| CG Seminar Carlton University | 27.09.2024. Online. | Flips in Colorful Triangulations | Francesco Verciani |
| Graph Drawing (GD) | 18.09. - 20.09.2024. Vienna, Austria. | Flips in Colorful Triangulations | Torsten Mütze |
| JCDCGGG 2024 | 10.09. - 12.09.2024. Tokyo, Japan. | Graphs that admit a Hamilton Path are Cup-Stackable | Francesco Verciani |
Guests and Research Visitors
| Felix Joos | Heidelberg University, Germany | 10.02. - 11.02.2025 |
| Hung Hoang | University of Vienna, Austria | 13.01. - 17.01.2025 |
| Pascal Schweitzer | Technical University of Darmstadt, Germany | 02.12.2024 |
| Torsten Ueckerdt | Karlsruhe Institute of Technology, Germany | 12.11.2024 |
| Petr Gregor | Charles University Prague, Czech Republic | 10.06. - 14.06.2024 |
| Arturo Merino | Universidad de O'Higgins, Chile | 27.05. - 07.06.2024 |
| Nastaran Behrooznia | University of Warwick, United Kingdom | 27.05. - 31.05.2024 |
Third Party Funding
Heisenberg project "Principles of combinatorial algorithms" (DFG project 522790373) 2023-2028
In this project, we tackle several long-standing and fundamental problems at the interface of mathematics and computer science. Specifically, the project centers around the following topics:
- Efficient algorithms for generating combinatorial objects
- Reconfiguration problems, Gray codes
- Lovász’ conjecture on Hamilton paths in vertex-transitive graphs
- Partially ordered sets (symmetric chain decompositions)
- Discrete and combinatorial geometry (rectangulations, non-crossing matchings, Venn diagrams)
- Algebraic combinatorics (lattice congruences, polytopes, quotientopes)
- Connections to combinatorial optimization on 0/1-polytopes