Workshop Schedule is available in pdf format on this link.
| Monday, September 19 | |
| 9:00 | Registration |
| 9:15 - 9:30 | Opening remarks |
| Chair: Michel Habib | |
| 9:30 - 10:30 | Keynote talk - Marthe Bonamy One graph to rule them all: forbidden structures and universal graphs download slides |
| 10:30 - 11:00 | Coffee break |
| Chair: Stefan Szeider | |
| 11:00 - 11:25 | Sebastian Wiederrecht Killing a Vortex download slides |
| 11:25 - 11:50 | Robert Scheffler Semi-Proper Interval Graphs download slides |
| 11:50 - 12:15 | Stefan Lendl On Structural Parameterizations of Continuous Facility Location Problems on Graphs download slides |
| 12:15 - 14:15 | Lunch break |
| Chair: Matjaž Krnc | |
| 14:15 - 14:40 | Peter Rossmanith Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond download slides |
| 14:40 - 15:05 | Chinh T. Hoang Critical (P_3+ℓ P_1)-free and critical (gem, co-gem)-free graphs download slides |
| 15:05 - 15:30 | Vadim Lozin Graph parameters, implicit representations and factorial properties download slides |
| 15:30 - 16:00 | Coffee break |
| Chair: Jan Kratochvil | |
| 16:00 - 17:30 | Open problem session |
| Tuesday, September 20 | |
| 9:00 | Registration |
| 9:15 - 9:30 | Announcements |
| Chair: Sang-il Oum | |
| 9:30 - 10:30 | Keynote talk - Bart M. P. Jansen Search-Space Reduction Beyond Kernelization download slides |
| 10:30 - 11:00 | Coffee break |
| Chair: Robert Ganian | |
| 11:00 - 11:25 | Jesse Beisegel Characterizing Graph Classes with Convexity download slides |
| 11:25 - 11:50 | Meike Hatzel Generating Strongly 2-Connected Digraphs download slides |
| 11:50 - 12:15 | Philipp K. Krause Constant-time connectivity tests download slides |
| 12:15 - 14:15 | Lunch break |
| 14:15 - 19:30 | Hike |
| Wednesday, September 21 | |
| 9:00 | Registration |
| 9:15 - 9:30 | Announcements |
| Chair: Ekkehard Köhler | |
| 9:30 - 9:55 | Jan Bok Hardness constructions for graph covering problems with semi-edges |
| 9:55 - 10:20 | Jan Kratochvíl Computational complexity of the list version of graphs covers |
| 10:20 - 10:30 | Group photo at Tito square |
| 10:30 - 11:00 | Coffee break |
| Chair: Yushi Uno | |
| 11:00 - 11:25 | Gyula Y. Katona Polynomial algorithm to compute the toughness of graphs with bounded treewidth download slides |
| 11:25 - 11:50 | Giannos Stamoulis Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes download slides |
| 11:50 - 12:15 | Nikola Jedličková List homomorphism problem for signed graphs |
| 12:15 - 14:15 | Lunch break |
| Special session honoring Vadim Lozin on the occasion of his 60th birthday - Chair: Konrad Dabrowski | |
| 14:15 - 14:40 | Nicolas Trotignon From even-hole-free graphs to treewidth download slides |
| 14:40 - 15:05 | Andrea Munaro Structural and algorithmic results for mim-width and sim-width |
| 15:05 - 15:30 | Viktor Zamaraev Implicit Representations of Graphs and Randomized Communication download slides |
| 15:30 - 15:55 | Stefan Szeider From Twin-Width to Propositional Logic and Back download slides |
| 15:55 - 16:25 | Coffee break |
| 16:25 - 16:30 | Next GROW announcement |
| Chair: Vadim Lozin | |
| 16:00 - 17:30 | Open problem session |
| 19:00 | Conference dinner in restaurant Savor |
| Thursday, September 22 | |
| 9:00 | Registration |
| 9:15 - 9:30 | Announcements |
| Chair: Sergio Cabello | |
| 9:30 - 10:30 | Keynote talk - Bojan Mohar On the structure of crossing-critical graphs download slides |
| 10:30 - 11:00 | Coffee break |
| Chair: Nicolas Trotignon | |
| 11:00 - 11:25 | Evangelos Protopapas Tree-layout based graph classes: the case of proper chordal graphs download slides |
| 11:25 - 11:50 | Tuukka Korhonen Computing Tree Decompositions with Small Independence Number download slides |
| 11:50 - 12:15 | Michel Habib LexCycle on Modules |
| 12:15 - 14:15 | Lunch break |
| Chair: Andrzej Proskurowski | |
| 14:15 - 14:40 | Carolina Lucía Gonzalez Locally checkable problems parameterized by treewidth, clique-width and mim-width download slides |
| 14:40 - 15:05 | Christophe Paul The mixed search game against an agile and visible fugitive is monotone download slides |
| 15:05 - 15:30 | Nina Klobas The complexity of computing optimum labelings for temporal connectivity download slides |
| 15:30 - 16:00 | Coffee break |
| Chair: Gyula Y. Katona | |
| 16:00 - 16:25 | Manoj Belavadi Reconfiguration of Vertex Colouring and Forbidden Induced Subgraphs download slides |
| 16:25 - 16:50 | Jungho Ahn Bounds for the twin-width of graphs download slides |
| 16:50 | Closing remarks |
