| 2022 | Algorithmic Aspects of Small Quasi-Kernels. Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette |
| 2022 | An Algorithmic Framework for Locally Constrained Homomorphisms. Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma |
| 2022 | Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates. Mathew C. Francis, Atrayee Majumder, Rogers Mathew |
| 2022 | Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. Hugo Jacob, Marcin Pilipczuk |
| 2022 | Classifying Subset Feedback Vertex Set for H-Free Graphs. Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski |
| 2022 | Computing List Homomorphisms in Geometric Intersection Graphs. Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski |
| 2022 | Disjoint Compatibility via Graph Classes. Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber |
| 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 | Extending Partial Representations of Circular-Arc Graphs. Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman |
| 2022 | Finding k-Secluded Trees Faster. Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon |
| 2022 | Generalized k-Center: Distinguishing Doubling and Highway Dimension. Andreas Emil Feldmann, Tung Anh Vu |
| 2022 | Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers Michael A. Bekos, Michael Kaufmann |
| 2022 | Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2022 | Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. David Dekker, Bart M. P. Jansen |
| 2022 | Linearizing Partial Search Orders. Robert Scheffler |
| 2022 | Minimal Roman Dominating Functions: Extensions and Enumeration. Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann |
| 2022 | Minimum Weight Euclidean (1+ε )-Spanners. Csaba D. Tóth |
| 2022 | On Anti-stochastic Properties of Unlabeled Graphs. Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii |
| 2022 | On Fully Diverse Sets of Geometric Objects and Graphs. Fabian Klute, Marc J. van Kreveld |
| 2022 | On the Lossy Kernelization for Connected Treedepth Deletion Set. Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2022 | On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy. Gabriel L. Duarte, Uéverton S. Souza |
| 2022 | Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini |
| 2022 | Parameterized Complexity of Weighted Multicut in Trees. Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale |
| 2022 | Polychromatic Colorings of Unions of Geometric Hypergraphs. Vera Chekan, Torsten Ueckerdt |
| 2022 | Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 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 Høgemo, Jan Arne Telle, Martin Vatshelle |
| 2022 | Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman |
| 2022 | The Complexity of Contracting Bipartite Graphs into Small Cycles. R. Krithika, Roohani Sharma, Prafullkumar Tale |
| 2022 | The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink |
| 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 Balabán, Petr Hlinený, Jan Jedelský |
| 2022 | s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai |