Program
The conference takes place on 2-4 June 2026, with a welcome reception on the evening of June 1st. On Wednesday 3 June in the afternoon there will be a guided visit to the Omer brewery as social activity followed by the conference diner in the evening, which will take place in the restaurant of Hotel Damier (Grote Markt 41, 8500 Kortrijk).
All talks will take place in lecture room C611, the coffee breaks in the hall of building B, and the lunches in the university restaurant "Alma" (except for lunch on the last day, which will take place in the hall of building A). For a map of the campus, see the Practical Info tab.
Monday 1 June
| 17h00 - 18h30 | Welcome reception and registration (in hall of building B) |
Tuesday 2 June
| 08h20 - 08h50 | Registration (in front of C611) |
| 08h50 - 09h00 | Opening remarks |
| Session chair: Paweł Rzążewski | |
| 09h00 - 09h50 | From graph minors to quantum networks Rose McCarty |
| 09h50 - 10h10 | Faster 3-colouring algorithm for graphs of diameter 3 Carla Groenland, Hidde Koerts and Sophie Spirkl |
| 10h10 - 10h30 | The planar edge-coloring theorem of Vizing in O(n log n) time Patryk Jedrzejczak and Łukasz Kowalik |
| 10h30 - 11h00 | Coffee break |
| Session chair: Hans L. Bodlaender | |
| 11h00 - 11h20 | Graph Classes Closed under Self-intersection Konrad K. Dabrowski, Vadim Lozin, Martin Milanič, Andrea Munaro, Daniël Paulusma and Viktor Zamaraev |
| 11h20 - 11h40 | Optimal b-Colourings and Fall Colourings in H-Free Graphs Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David Manlove, Fabricio Mendoza Granada and Daniël Paulusma |
| 11h40 - 12h00 | Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin and Daniël Paulusma |
| 12h00 - 12h20 | Revisiting Token Sliding on Chordal Graphs Rajat Adak, Saraswati Girish Nanoti and Prafullkumar Tale |
| 12h20 - 12h40 | Is Graph Local Complementation Inherently Sequential? Pablo Concha-Vega |
| 12h40 - 13h50 | Lunch break |
| Session chair: Petr Golovach | |
| 13h50 - 14h10 | Cycles in unions of transitive tournaments Bogdan Alecu, Pedro Bureo Villafana and Vadim Lozin |
| 14h10 - 14h30 | Hunting for Directed 2-Spiders Grzegorz Gutowski and Gaurav Kucheriya |
| 14h30 - 14h50 | Making an oriented graph acyclic using inversions of bounded or prescribed size Jørgen Bang-Jensen, Frederic Havet, Florian Hörsch, Clément Rambaud, Amadeus Reinald and Caroline Silva |
| 14h50 - 15h10 | A Note on the Complexity of Directed Clique Grzegorz Gutowski and Mikołaj Rams |
| 15h10 - 15h40 | Coffee break |
| Session chair: Gwenaël Joret | |
| 15h40 - 16h00 | On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs Alex Koutsoutis, Kilian Krause, Chun-Hung Liu, Mirza Redzic and Torsten Ueckerdt |
| 16h00 - 16h20 | Computational and Combinatorial Results on Conflict-free Choosability Shiwali Gupta and Rogers Mathew |
| 16h20 - 16h40 | Weisfeiler-Leman on graphs of small twin-width Irene Heinrich, Moritz Lichter, Klara Pakhomenko and Simon Raßmann |
| 16h40 - 17h00 | Lower Bounds for the Pfaffian Number of Graphs Enrique Junchaya, Alberto Miranda and Cláudio Lucchesi |
| 17h00 - 17h20 | Totally Delta-Modular Tree Decompositions of Graphic Matrices for Integer Programming Caleb McFarland |
| 17h20 - 17h30 | Short break |
| 17h30 - 18h45 | Business meeting (B422) |
Wednesday 3 June
| 08h55-9h00 | Short remarks |
| Session chair: Daniël Paulusma | |
| 09h00 - 09h50 | Graph Searching on Graphs: A Long Story of Pursuit for Width and Structure [Test of Time Award Winner] Dimitrios M. Thilikos |
| Session chair: Paweł Rzążewski | |
| 09h50 - 10h10 | Trade-off between spread and width for tree decompositions [Best Paper] Hans L. Bodlaender and Carla Groenland |
| 10h10 - 10h30 | Obstructions for Minor-Closed Classes of limiting Densities Below 3/2 [Best Student Paper]
Antonios Kominatos, Reem Mahmoud and Dimitrios M. Thilikos |
| 10h30 - 11h00 | Coffee break |
| Session chair: Łukasz Kowalik | |
| 11h00 - 11h20 | Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width Benjamin Bergougnoux, Vera Chekan and Stefan Kratsch |
| 11h20 - 11h40 | Parameterized Complexity of Power Network Design: Coordinating Cable Placement is Hard Thekla Hamm, Bart M. P. Jansen and Faezeh Motiei |
| 11h40 - 12h00 | Preventing Small Global Cuts by Protecting Edges Christian Komusiewicz, Zhenwei Liu, Nils Morawietz and Frank Sommer |
| 12h00 - 12h20 | Optimal path partitions in subcubic and almost-subcubic graphs Tomáš Masařík, Michał Włodarczyk and Mehmet Akif Yıldız |
| 12h20 - 12h40 | Parameterized Complexity of Isometric Path Partition: Treewidth and Diameter Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari and Prafullkumar Tale |
| 12h40 - 12h45 | Conference picture |
| 12h45 - 13h50 | Lunch break |
| Session chair: Prafullkumar Tale | |
| 13h50 - 14h10 | Polynomial Kernels for Spanning Tree with Diversity Requirements Petr Golovach, Diptapriyo Majumdar and Saket Saurabh |
| 14h10 - 14h30 | Clustering with Locally Bounded Ignorance Jaroslav Garvardt and Christian Komusiewicz |
| 14h30 - 14h50 | Complexity of Firefighting on Graphs Julius Althoetmar, Jamico Schade and Torben Schürenberg |
| 14h50 - 15h00 | Short break |
| 15h00 - 18h30 | Excursion to Omer brewery |
| 19h30 - 21h30 | Conference dinner at Hotel Damier |
Thursday 4 June
| Session chair: Jan Goedgebeur | |
| 09h00 - 09h50 | Very Similar, but Not the Same: Local-to-Global Structure, Isomorphism, and Reconstruction Pascal Schweitzer |
| 09h50 - 10h10 | The Complexity of Ramsey Arrowing: A Computational Approach for Hardness Proofs Zohair Raza Hassan |
| 10h10 - 10h30 | The S-Hamiltonian Cycle Problem Antoine Amarilli, Arthur Lombardo and Mikaël Monet |
| 10h30 - 11h00 | Coffee break |
| Session chair: Carla Groenland | |
| 11h00 - 11h20 | Graph Reconstruction with a Connected Components Oracle Juha Harviainen and Pekka Parviainen |
| 11h20 - 11h40 | Implicit representations via the polynomial method Jean Cardinal and Micha Sharir |
| 11h40 - 12h00 | Upward-Planar Drawings with Bounded Span Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo, Fabrizio Frati, Philipp Kindermann, Ignaz Rutter and Johannes Zink |
| 12h00 - 12h20 | Geometric Routing in Geometric Inhomogeneous Random Graphs Yu-Cheng Chiu, Marc Kaufmann, Kostas Lakis and Ulysse Schaller |
| 12h20 - 12h40 | High Beer Index Implies Big Hollow Triangles Arun Kumar Das, Vít Jelínek, Jan Kynčl, Martin Pergel, Felix Schröder, Peter Stumpf and Pavel Valtr |
| 12h40 - 12h45 | Closing remarks |
| 12h45 - 14h00 | Lunch (in hall of building A) |