Page 239 - 8th European Congress of Mathematics ∙ 20-26 June 2021 ∙ Portorož, Slovenia ∙ Book of Abstracts

Minisymposium

ALGORITHMIC GRAPH THEORY (MS-54)

Organized by Nicolas Trotignon, CNRS, France
Coorganized by

Martin Milanicˇ, Univerza na Primorskem, Slovenija
Daniel Paulusma, Durham University, United Kingdom
Sandi Klavžar, University of Ljubljana, Slovenija

• On Efficient Domination for H-free bipartite graphs, Andreas Brandstaedt
• Domination number of graphs with fixed minimum degree, Csilla Bujtás
• Extending Thomason’s Algorithm, Kathie Cameron
• Clique-Width: Harnessing the Power of Atoms, Konrad K. Dabrowski
• Colourful components in k-caterpillars and planar graphs, Clément Dallard
• Firebreaking and Firefighting, Jess Enright
• Graphs with two moplexes are more than perfect, Meike Hatzel
• Computing Weighted Subset Transversals in H-free Graph, Matthew Johnson
• Interference-free Walks in Time: Temporally Disjoint Paths, Nina Klobas
• Shifting any path to an avoidable one, Matjaž Krnc
• Model-checking in multilayer graphs, Kitty Meeks
• Beyond treewidth: the tree-independence number, Martin Milanicˇ
• Width parameters and graph classes: the case of mim-width, Andrea Munaro
• Coloring (4K1, C4, C6)-free graphs, Irena Penev
• Circularly compatible ones, D-circularity, and proper circular-arc bigraphs, Martín Safe
• On the treewidth of even-hole-free graphs, Ni Luh Dewi Sintiari
• On 12-regular nut graphs, Riste Škrekovski
• Treewidth versus clique number: a complete dichotomy for one forbidden structure,

Kenny Štorgel
• The Slow-Coloring Game on a Graph, Douglas West
• Approximate and Randomized algorithms for Computing a Second Hamiltonian Cycle,

Viktor Zamaraev