Talks

Selected Conferences and Talks in 2026

Combinatorial Synergies Annual Meeting14. - 16.09.2026. Frankfurt, Germany.Plenary talk: Traversing regions of supersolvable hyperplane arrangements and their lattice quotientsTorsten Mütze
Symposium on Computational Geometry (SoCG)02. - 05.06.2026. Online.On minimum Venn diagramsFrancesco Verciani
Symposium on Computational Geometry (SoCG)02. - 05.06.2026. Online.Disproving two conjectures on the Hamiltonicity of Venn diagramsFrancesco Verciani
Algebraic and Geometric Aspects of the Theory of Hyperplane Arrangements31.05. - 06.06.2026. Kraków, Poland.On the interplay of combinatorics and algebra in graphic arrangement theoryLeonie Mühlherr
Young Researchers Conference on Combinatorial Synergies04.05. - 08.05.2026. Berlin, Germany.Listing spanning trees of graphsPia Herkenrath
Young Researchers Conference on Combinatorial Synergies04.05. - 08.05.2026. Berlin, Germany.The Braid arrangement and friendsLeonie Mühlherr
European Workshop on Computational Geometry (EuroCG)25. - 27.03.2026. Hagen, Germany.On minimum Venn diagramsFrancesco Verciani
European Workshop on Computational Geometry (EuroCG)25. - 27.03.2026. Hagen, Germany.Disproving two conjectures on the Hamiltonicity of Venn diagramsChristian Rieck
ACM-SIAM Symposium on Discrete Algorithms (SODA)11. - 14.01.2026. Vancouver, Canada.Listing faces of polytopesSofia Brenner
ACM-SIAM Symposium on Discrete Algorithms (SODA)11. - 14.01.2026. Vancouver, Canada.Traversing regions of supersolvable hyperplane arrangements and their lattice quotientsSofia Brenner
Research School Beyond Permutahedra and Associahedra01. - 05.12.2025. Marseille, France.Plenary talk: Traversing regions of supersolvable hyperplane arrangements and their lattice quotientsTorsten Mütze
KOLKOM 202514. - 15.11.2025. Bielefeld, Germany.Building set arrangementsLeonie Mühlherr
KOLKOM 202514. - 15.11.2025. Bielefeld, Germany.Listing faces of polytopesFrancesco Verciani
KOLKOM 202514. - 15.11.2025. Bielefeld, Germany.Flipping odd matchings in geometric and combinatorial settingsChristian Rieck
KOLKOM 202514. - 15.11.2025. Bielefeld, Germany.Counterexamples to two conjectures on Venn diagramsTorsten Mütze
ITU Seminar on Algorithms and Complexity29.09.2025. Copenhagen, Denmark.On the art gallery problem and its variantsChristian Rieck
Workshop Cycles and Colorings02.09.2025. Poprad, Slovakia.Plenary talk: Counterexamples to two conjectures on Venn diagramsTorsten Mütze
Eurocomb conference25.08.2025. Budapest, Hungary.EPPA witnesses with two blocks of imprimitivity on edgesSofia Brenner
Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM)23.05.2025. Online.Listing spanning trees of outerplanar graphs by pivot-exchangesTorsten Mütze
Symposium on Theoretical Aspects of Computer Science (STACS)04. - 07.03.2025. Jena, Germany.Listing spanning trees of outerplanar graphs by pivot-exchangesTorsten Mütze
KOLKOM 202411. - 12.10.2024. Heidelberg, Germany.Plenary talk: On Hamilton cycles in highly symmetric graphsTorsten Mütze
CG Seminar Carlton University27.09.2024. Online.Flips in colorful triangulationsFrancesco Verciani
Graph Drawing (GD)18. - 20.09.2024. Vienna, Austria.Flips in colorful triangulationsTorsten Mütze
JCDCGGG 202410. - 12.09.2024. Tokyo, Japan.Graphs that admit a Hamilton path are cup-stackableFrancesco Verciani