| 2026 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2026 | Totally Δ-Modular Tree Decompositions of Graphic Matrices for Integer Programming. | Caleb McFarland |
| 2026 | Optimal Path Partitions in Subcubic and Almost-Subcubic Graphs. | Toms Masark, Michal Wlodarczyk, Mehmet Akif Yildiz |
| 2026 | On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs. | Alex Koutsoutis, Kilian Krause, Chun-Hung Liu, Mirza Redzic, Torsten Ueckerdt |
| 2026 | Preventing Small Global Cuts by Protecting Edges. | Christian Komusiewicz, Zhenwei Liu, Nils Morawietz, Frank Sommer |
| 2026 | Obstructions for Minor-Closed Classes of Limiting Densities Below 3/2. | Antonios Kominatos, Reem Mahmoud, Dimitrios M. Thilikos |
| 2026 | Lower Bounds for the Pfaffian Number of Graphs. | Enrique Junchaya, Alberto Alexandre Assis Miranda, Cludio Leonardo Lucchesi |
| 2026 | The Planar Edge-Coloring Theorem of Vizing in O(nlog n) Time. | Patryk Jedrzejczak, Lukasz Kowalik |
| 2026 | Weisfeiler-Leman on Graphs of Small Twin-Width. | Irene Heinrich, Moritz Lichter, Klara Pakhomenko, Simon Ramann |
| 2026 | The Complexity of Ramsey Arrowing: A Computational Approach for Hardness Proofs. | Zohair Raza Hassan |
| 2026 | Graph Reconstruction with a Connected Components Oracle. | Juha Harviainen, Pekka Parviainen |
| 2026 | Parameterized Complexity of Power Network Design: Coordinating Cable Placement Is Hard. | Thekla Hamm, Bart M. P. Jansen, Faezeh Motiei |
| 2026 | A Note on the Complexity of Directed Clique. | Grzegorz Gutowski, Mikolaj Rams |
| 2026 | Hunting for Directed 2-Spiders. | Grzegorz Gutowski, Gaurav Kucheriya |
| 2026 | Computational and Combinatorial Results on Conflict-Free Choosability. | Shiwali Gupta, Rogers Mathew |
| 2026 | Faster 3-Colouring Algorithm for Graphs of Diameter 3. | Carla Groenland, Hidde Koerts, Sophie Spirkl |
| 2026 | Polynomial Kernels for Spanning Tree with Diversity Requirements. | Petr A. Golovach, Diptapriyo Majumdar, Saket Saurabh |
| 2026 | Clustering with Locally Bounded Ignorance. | Jaroslav Garvardt, Christian Komusiewicz |
| 2026 | Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification. | Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Danil Paulusma |
| 2026 | High Beer Index Implies Big Hollow Triangles. | Arun Kumar Das, Vt Jelnek, Jan Kyncl, Martin Pergel, Felix Schrder, Peter Stumpf, Pavel Valtr |
| 2026 | Graph Classes Closed Under Self-Intersection. | Konrad K. Dabrowski, Vadim V. Lozin, Martin Milanic, Andrea Munaro, Danil Paulusma, Viktor Zamaraev |
| 2026 | Is Graph Local Complementation Inherently Sequential? | Pablo Concha-Vega |
| 2026 | Geometric Routing in Geometric Inhomogeneous Random Graphs. | Yu-Cheng Chiu, Marc Kaufmann, Kostas Lakis, Ulysse Schaller |
| 2026 | Parameterized Complexity of Isometric Path Partition: Treewidth and Diameter. | Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale |
| 2026 | Implicit Representations via the Polynomial Method. | Jean Cardinal, Micha Sharir |