| Monday, May 2 |
| 09:30 |
– Registration |
| 09:45 |
– Presentation of the Participants |
| 10:00 |
– Sebastian Siebertz First-Order Logic with Connectivity Operators: expressiveness and model-checking |
| 11:00 |
– Coffee break |
| 11:30 |
– Kirill Simonov The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width |
| 12:00 |
– Jesper Nederlof Tight bounds for counting colorings and connected edge sets parameterized by cutwidth |
| 12:30 |
– Lunch |
| 15:30 |
– Coffee break |
| 16:00 |
– Open problem session (end: 18:00) |
| Tuesday, May 3 |
| 09:30 |
– Tuukka Korhonnen Fast FPT-Approximation of Branchwidth |
| 10:30 |
– Fahad Panolan Deletion and Elimination to Hereditary Graph classes |
| 11:00 |
– Coffee break |
| 11:30 |
– Peter Gartland A characterization of graphs with (quasi)-polynomial many minimal separators |
| 12:00 |
– Ioan Todinca A Meta-Theorem for Distributed Certification |
| 12:30 |
– Lunch |
| 15:30 |
– Coffee break |
| 16:00 |
– Sebastian Ordyniak SAT Backdoors: Depth Beats Size |
| 16:30 |
– William Lochet Disjoint paths on dense graphs (end: 17:00) |
| Wednesday, May 4 |
| 09:30 |
– Dimitrios Thilikos A Compound Logic for Modification Problems: Big Kingdoms Fall from Within |
| 10:30 |
– Christian Komusiewicz Exploiting Triadic Closure Algorithmically |
| 11:00 |
– Coffee break |
| 11:30 |
– Giannos Stamoulis Paths and Cycles of Large Rank in Frameworks |
| 12:00 |
– Pallavi Jain Parameterized Algorithms for Gerrymandering on Graphs |
| 12:30 |
– Lunch |
| 15:30 |
– Coffee break |
| 16:00 |
– Jari de Kroon Finding k-Secluded Trees Faster |
| 16:30 |
– Sándor Kisfaludi-Bak Hyperbolic grids and hyperbolic planar graphs |
| Thursday, May 5 |
| 09:30 |
– Bart Jansen Search-Space Reduction Beyond Kernelization |
| 10:30 |
– Michal Wlodarzcyk Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion |
| 11:00 |
– Coffee break |
| 11:30 |
– Ben Bumpus Exploring temporal graphs: introducing interval-membership-width |
| 12:00 |
– Celine Swennenhuis Parameterized Complexities of Independent Set Reconfiguration |
| 12:30 |
– Free afternoon |
| 18:00 |
– Farewell cocktail party at the Sky bar (29th floor) |
| Friday, May 6 |
| 09:30 |
– Sergio Cabello FPT in two and three dimensions |
| 10:30 |
– Mateus De Oliveira Oliveira Tree Automatic Classes of Finite Structures of Bounded Width |
| 11:00 |
– Coffee break |
| 11:30 |
– Farhad Vadiee Dynamic Programming Cores for Minor Containment and Related Problems |
| 12:00 |
– Discussion of progress in solving open problems/Closing remarks (end: 12:30) |