| 2025 | Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers Daniel Král, Martin Milanic |
| 2024 | A New Approach for Approximating Directed Rooted Networks. Sarel Cohen, Lior Kamma, Aikaterini Niklanovits |
| 2024 | Approximating Branchwidth on Parametric Extensions of Planarity. Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2024 | Approximation Algorithms for Treewidth, Pathwidth, and Treedepth - A Short Survey. Hans L. Bodlaender |
| 2024 | Approximations and Hardness of Covering and Packing Partially Ordered Items. Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai |
| 2024 | Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg |
| 2024 | Beyond Recognizing Well-Covered Graphs. Carl Feghali, Malory Marin, Rémi Watrigant |
| 2024 | Covering a Graph with Minimal Local Sets. Nathan Claudet, Simon Perdrix |
| 2024 | Degreewidth on Semi-complete Digraphs. Ryan Keeney, Daniel Lokshtanov |
| 2024 | Enumerating Minimal Solution Sets for Metric Graph Problems. Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney |
| 2024 | Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth. Miriam Münch, Maximilian Pfister, Ignaz Rutter |
| 2024 | Face-Hitting Dominating Sets in Planar Graphs. P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad |
| 2024 | Fast Winning Strategies for the Attacker in Eternal Domination. Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron |
| 2024 | Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time. Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond |
| 2024 | Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith |
| 2024 | Finite Vertex-Colored Ultrahomogeneous Oriented Graphs. Irene Heinrich, Eda Kaja, Pascal Schweitzer |
| 2024 | Graph Reconstruction with Connectivity Queries. Kacper Kluk, Hoang La, Marta Piecyk |
| 2024 | Improved Outerplanarity Bounds for Planar Graphs. Therese Biedl, Debajyoti Mondal |
| 2024 | Independent Set Reconfiguration in H-Free Graphs. Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler |
| 2024 | Lightweight Near-Additive Spanners. Yuval Gitlitz, Ofer Neiman, Richard Spence |
| 2024 | Many Views of Planar Point Sets. Jan Kyncl, Jan Soukup |
| 2024 | On Polynomial Kernelization for Stable Cutset. Stefan Kratsch, Van Bang Le |
| 2024 | On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs. Benedikt Künzel, Jonathan Rollin |
| 2024 | On the Connectivity of the Flip Graph of Plane Spanning Paths. Linda Kleist, Peter Kramer, Christian Rieck |
| 2024 | Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald |
| 2024 | Popular Solutions for Optimal Matchings. Telikepalli Kavitha |
| 2024 | Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete. Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf |
| 2024 | Revisiting Path Contraction and Cycle Contraction. R. Krithika, V. K. Kutty Malu, Prafullkumar Tale |
| 2024 | Roman Cycle Hitting Set. Satyabrata Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia |
| 2024 | The Complexity of Diameter on H-free Graphs. Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen |
| 2024 | The Parameterized Complexity Landscape of the Unsplittable Flow Problem. Robert Ganian, Mathis Rocton, Daniel Unterberger |
| 2024 | Untangling Gaussian Mixtures. Eva Fluck, Sandra Kiefer, Christoph Standke |
| 2024 | XNLP-Hardness of Parameterized Problems on Planar Graphs. Hans L. Bodlaender, Krisztina Szilágyi |