Tuesday June 18
| 18:00 | Welcome reception |
Wednesday June 19
| 9:00 | Invited talk - Shiri Chechik Approximate Shortest Paths and Distance Oracles |
| 9:50 | Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber and Hadas Shachnai Approximations and Hardness of Packing Partially Ordered Items |
| 10:10 | Telikepalli Kavitha Popular Solutions for Optimal Matchings |
| 10:30 | coffee break |
| 11:00 | Gaétan Berthe, Marin Bougeret, Daniel Gonçalves and Jean-Florent Raymond Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time |
| 11:20 | Aleksander Bjoern Grodt Christiansen, Linda Kleist, Irene Parada and Eva Rotenberg Augmenting Plane Straight-Line Graphs to Meet Parity Constraints |
| 11:40 | Michael Hoffmann, Tillmann Miltzow, Simon Weber and Lasse Wulf Recognition of Unit Segment and Polyline Graphs is ∃R-Complete |
| 12:00 | Benedikt Künzel and Jonathan Rollin On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs |
| 12:20 | morning scientific program concludes |
| 12:30 | lunch |
| 14:00 | Stéphane Bessy, Daniel Gonçalves and Amadeus Reinald Oriented Trees in O(k \sqrt{k})-chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture |
| 14:20 | Nathan Claudet and Simon Perdrix Covering a Graph with Minimal Local Sets |
| 14:40 | Irene Heinrich, Eda Kaja and Pascal Schweitzer Classification of Finite Directed Vertex-colored Ultrahomogeneous Graphs |
| 15:00 | Kacper Kluk, Hoang La and Marta Piecyk Graph Reconstruction with Connectivity Queries |
| 15:20 | coffee break |
| 15:50 | Guillaume Bagan, Nicolas Bousquet, Nacim Oijid and Théo Pierron Fast Winning Strategies for the Attacker in Eternal Domination |
| 16:10 | Satyabrata Jana, Sounak Modak, Saket Saurabh and Kushal Singanporia Roman Cycle Hitting Set |
| 16:30 | break |
| 16:40 | Best Paper and Best Student Paper ceremony |
| 16:50 | P. Francis, Abraham M. Illickan, Lijo M. Jose and Deepak Rajendraprasad Face-hitting Dominating Sets in Planar Graphs |
| 17:10 | Ryan Keeney and Daniel Lokshtanov Degreewidth on Semi-Complete Digraphs |
| 17:30 | Jan Kynčl and Jan Soukup Many Views of Planar Point Sets |
| 17:50 | afternoon scientific program concludes |
| 18:30 | dinner |
| 20:00 | business meeting |
Thursday June 20
| 9:00 | ToT Award talk - Hans L. Bodlaender Approximations of Treewidth and Other Graph Parameters |
| 9:50 | Benjamin Bergougnoux, Oscar Defrain and Fionn Mc Inerney Enumerating Minimal Solution Sets for Metric Graph Problems |
| 10:10 | Carl Feghali, Malory Marin and Rémi Watrigant Beyond Recognizing well-covered Graphs |
| 10:30 | coffee break |
| 11:00 | Sarel Cohen, Lior Kamma and Aikaterini Niklanovits A New Approach for Approximating Directed Rooted Networks |
| 11:20 | Eva Fluck, Sandra Kiefer and Christoph Standke Untangling Gaussian Mixtures |
| 11:40 | Yuval Gitlitz, Ofer Neiman and Richard Spence Lightweight Near-Additive Spanners for Weighted Graphs |
| 12:00 | Robert Ganian, Mathis Rocton and Daniel Unterberger The Parameterized Complexity Landscape of the Unsplittable Flow Problem |
| 12:20 | morning scientific program concludes |
| 12:30 | lunch |
| 14:00 | Stefan Kratsch and Van Bang Le On Polynomial Kernelization for Stable Cutset |
| 14:20 | R. Krithika, Kutty Malu V K and Prafullkumar Tale Revisiting Path Contraction and Cycle Contraction |
| 14:40 | Felicia Lucke, Ali Momeni, Daniel Paulusma and Siani Smith Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs |
| 15:00 | Jelle Oostveen, Daniel Paulusma and Erik Jan van Leeuwen The Complexity of Diameter on H-free graphs |
| 15:20 | afternoon scientific program concludes |
| 15:40 | departure for conference excursion, which will be followed by conference dinner |
Friday June 21
| 9:00 | Invited talk - Michał Pilipczuk Graph Classes and Logic |
| 9:50 | Valentin Bartier, Nicolas Bousquet and Moritz Muehlenthaler Independent Set Reconfiguration in H-free Graphs |
| 10:10 | Linda Kleist, Peter Kramer and Christian Rieck On the Connectivity of the Flip Graph of Plane Spanning Paths |
| 10:30 | coffee break |
| 11:00 | Hans Bodlaender and Krisztina Szilagyi XNLP-hardness of Parameterized Problems on Planar Graphs |
| 11:20 | Therese Biedl and Debajyoti Mondal Improved Outerplanarity Bounds for Planar Graphs |
| 11:40 | Miriam Münch, Maximilian Pfister and Ignaz Rutter Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth |
| 12:00 | Dimitrios Thilikos and Sebastian Wiederrecht Approximating Branchwidth on Parametric Extensions of Planarity |
| 12:20 | morning scientific program concludes |
| 12:30 | lunch |
