| 2024 | On the Connectivity of the Flip Graph of Plane Spanning Paths. | Linda Kleist, Peter Kramer, Christian Rieck |
| 2024 | Degreewidth on Semi-complete Digraphs. | Ryan Keeney, Daniel Lokshtanov |
| 2024 | Popular Solutions for Optimal Matchings. | Telikepalli Kavitha |
| 2024 | Roman Cycle Hitting Set. | Satyabrata Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia |
| 2024 | Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete. | Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf |
| 2024 | Finite Vertex-Colored Ultrahomogeneous Oriented Graphs. | Irene Heinrich, Eda Kaja, Pascal Schweitzer |
| 2024 | Lightweight Near-Additive Spanners. | Yuval Gitlitz, Ofer Neiman, Richard Spence |
| 2024 | The Parameterized Complexity Landscape of the Unsplittable Flow Problem. | Robert Ganian, Mathis Rocton, Daniel Unterberger |
| 2024 | Face-Hitting Dominating Sets in Planar Graphs. | P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad |
| 2024 | Untangling Gaussian Mixtures. | Eva Fluck, Sandra Kiefer, Christoph Standke |
| 2024 | Beyond Recognizing Well-Covered Graphs. | Carl Feghali, Malory Marin, Rmi Watrigant |
| 2024 | Approximations and Hardness of Covering and Packing Partially Ordered Items. | Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai |
| 2024 | A New Approach for Approximating Directed Rooted Networks. | Sarel Cohen, Lior Kamma, Aikaterini Niklanovits |
| 2024 | Covering a Graph with Minimal Local Sets. | Nathan Claudet, Simon Perdrix |
| 2024 | Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. | Aleksander Bjrn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg |
| 2024 | XNLP-Hardness of Parameterized Problems on Planar Graphs. | Hans L. Bodlaender, Krisztina Szilgyi |
| 2024 | Approximation Algorithms for Treewidth, Pathwidth, and Treedepth - A Short Survey. | Hans L. Bodlaender |
| 2024 | Improved Outerplanarity Bounds for Planar Graphs. | Therese Biedl, Debajyoti Mondal |
| 2024 | Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. | Stphane Bessy, Daniel Gonalves, Amadeus Reinald |
| 2024 | Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time. | Gatan Berthe, Marin Bougeret, Daniel Gonalves, Jean-Florent Raymond |
| 2024 | Enumerating Minimal Solution Sets for Metric Graph Problems. | Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney |
| 2024 | Independent Set Reconfiguration in H-Free Graphs. | Valentin Bartier, Nicolas Bousquet, Moritz Mhlenthaler |
| 2024 | Fast Winning Strategies for the Attacker in Eternal Domination. | Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Tho Pierron |
| 2023 | Graph Search Trees and Their Leaves. | Robert Scheffler |
| 2023 | Critical Relaxed Stable Matchings with Two-Sided Ties. | Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan |