| 2026 | Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers Henning Fernau, Philipp Kindermann |
| 2025 | A Parameterized Complexity Analysis of Bounded Height Depth-First Search Trees. Lars Jaffke, Paloma Thomé de Lima, Wojciech Nadara, Emmanuel Sam |
| 2025 | A Simple Quadratic Kernel for Token Jumping on Surfaces. Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille |
| 2025 | A Structural Description of Zykov and Blanche Descartes Graphs. Malory Marin, Stéphan Thomassé, Nicolas Trotignon, Rémi Watrigant |
| 2025 | Boundaried Kernelization. Leonid Antipov, Stefan Kratsch |
| 2025 | Bounding Width on Graph Classes of Constant Diameter. Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma |
| 2025 | Canadian Traveler Problems in Temporal Graphs. Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie |
| 2025 | Chromatic Index Under Parameterized Settings. Sriram Bhyravarapu, Soumen Mandal, Ashutosh Rai, Saket Saurabh, Shaily Verma |
| 2025 | Concurrency Constrained Scheduling with Tree-Like Constraints. Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen |
| 2025 | Connectivity-Preserving Minimum Separator in AT-Free Graphs. Batya Kenig |
| 2025 | Efficient Parameterized Approximation. Stefan Kratsch, Pascal Kunz |
| 2025 | Excluding an Induced Wheel Minor in Graphs Without Large Induced Stars. Mujin Choi, Claire Hilaire, Martin Milanic, Sebastian Wiederrecht |
| 2025 | Expanders in Models of Social Networks. Marc Kaufmann, Johannes Lengler, Ulysse Schaller, Konstantin Sturm |
| 2025 | Faster Algorithms for Graph Monopolarity. Geevarghese Philip, Shrinidhi Teganahally Sridhara |
| 2025 | Interval k-graphs : Recognition and Forbidden Obstructions. Haiko Müller, Arash Rafiey |
| 2025 | Matchings with Five Directions in Hypercubes Extend to Hamilton Cycles and Paths with Prescribed Ends. Jirí Fink, Vojtech Hotmar |
| 2025 | Non-crossing H-Graphs: A Generalization of Proper Interval Graphs Admitting FPT Algorithms. Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma |
| 2025 | On Graphs Coverable by Chubby Shortest Paths. Meike Hatzel, Michal Pilipczuk |
| 2025 | On Plane Cycles in Geometric Multipartite Graphs. Marco Ricci, Jonathan Rollin, André Schulz, Alexandra Weinberger |
| 2025 | On the Time Complexity of Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs. Babak Ghanbari, Robert Sámal |
| 2025 | Playing Snake on a Graph. Denise Graafsma, Bodo Manthey, Alexander Skopalik |
| 2025 | Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer |
| 2025 | Polynomial-Time Recognition and Maximum Independent Set in Burling Graphs. Pawel Rzazewski, Bartosz Walczak |
| 2025 | Realizing Temporal Transportation Trees. George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis |
| 2025 | Reductions in Local Certification. Louis Esperet, Sébastien Zeitoun |
| 2025 | Segment Intersection Representations, Level Planarity and Constrained Ordering Problems. Simon D. Fink, Matthias Pfretzschner, Peter Stumpf |
| 2025 | Structural Parameterizations for Induced and Acyclic Matching. Michael Lampis, Manolis Vasilakis |
| 2025 | Subgraph-Universal Planar Graphs for Trees. Helena Bergold, Vesna Irsic Chenoweth, Robert Lauff, Joachim Orthaber, Manfred Scheucher, Alexandra Wesolek |
| 2025 | Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT. Sriram Bhyravarapu, Shashanka Kulamarva, Pritesh Kumar, Shivesh K. Roy, Saket Saurabh |
| 2025 | Succinct Preferential-Attachment Graphs. Ziad Ismaili Alaoui, Namrata, Sebastian Wild |
| 2025 | The Peculiarities of Extending Queue Layouts. Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg |
| 2025 | Unbent Collections of Orthogonal Drawings. Todor Antic, Giuseppe Liotta, Tomás Masarík, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff, Johannes Zink |
| 2025 | When Does FTP Become FPT? Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |