| 2022 | Finding k-Secluded Trees Faster. | Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon |
| 2022 | Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. | David Dekker, Bart M. P. Jansen |
| 2022 | Polychromatic Colorings of Unions of Geometric Hypergraphs. | Vera Chekan, Torsten Ueckerdt |
| 2022 | s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. | Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai |
| 2022 | An Algorithmic Framework for Locally Constrained Homomorphisms. | Laurent Bulteau, Konrad K. Dabrowski, Noleen Khler, Sebastian Ordyniak, Danil Paulusma |
| 2022 | Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. | Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna |
| 2022 | Problems Hard for Treewidth but Easy for Stable Gonality. | Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen |
| 2022 | Recognition of Linear and Star Variants of Leaf Powers is in P. | Benjamin Bergougnoux, Svein Hgemo, Jan Arne Telle, Martin Vatshelle |
| 2022 | Token Sliding on Graphs of Girth Five. | Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz |
| 2022 | Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. | Jakub Balabn, Petr Hlinen, Jan Jedelsk |
| 2022 | Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). | Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman |
| 2022 | Disjoint Compatibility via Graph Classes. | Oswin Aichholzer, Julia Obmann, Pavel Patk, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber |
| 2022 | Minimal Roman Dominating Functions: Extensions and Enumeration. | Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann |
| 2021 | The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. | Nils Vortmeier, Ioannis Kokkinis |
| 2021 | A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs. | Sylwester Swat, Marta Kasprzak |
| 2021 | Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. | Maciej Rymar, Hendrik Molter, Andr Nichterlein, Rolf Niedermeier |
| 2021 | On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. | Isja Mannens, Jesper Nederlof, Cline M. F. Swennenhuis, Krisztina Szilgyi |
| 2021 | The Perfect Matching Cut Problem Revisited. | Van Bang Le, Jan Arne Telle |
| 2021 | Labeling Schemes for Deterministic Radio Multi-broadcast. | Colin Krisko, Avery Miller |
| 2021 | On 3-Coloring of (2P | Vt Jelnek, Tereza Klimosov, Toms Masark, Jana Novotn, Aneta Pokorn |
| 2021 | FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. | Bart M. P. Jansen, Jari J. H. de Kroon |
| 2021 | Preventing Small (s,t)Cuts by Protecting Edges. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2021 | Disjoint Stable Matchings in Linear Time. | Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip |
| 2021 | Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2021 | The Graphs of Stably Matchable Pairs. | David Eppstein |