| 2022 | 1-Extendability of Independent Sets. Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant |
| 2022 | A New Temporal Interpretation of Cluster Editing. Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester |
| 2022 | A Shift Gray Code for Fixed-Content Łukasiewicz Words. Paul W. Lapey, Aaron Williams |
| 2022 | An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations. Asei Inoue, Yusuke Kobayashi |
| 2022 | An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars. Avah Banerjee |
| 2022 | An Efficient Algorithm for the Proximity Connected Two Center Problem. Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer |
| 2022 | Approximating Subset Sum Ratio via Subset Sum Computations. Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis |
| 2022 | Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings Cristina Bazgan, Henning Fernau |
| 2022 | Computing Longest (Common) Lyndon Subsequences. Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi |
| 2022 | Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. Charis Papadopoulos, Spyridon Tzimas |
| 2022 | Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota. Joanna Kaczmarek, Jörg Rothe |
| 2022 | Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis |
| 2022 | Distance from Triviality 2.0: Hybrid Parameterizations. Akanksha Agrawal, M. S. Ramanujan |
| 2022 | Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks. Thi Huyen Chau Nguyen, Werner Grass, Klaus Jansen |
| 2022 | Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. Stepan Artamonov, Maxim A. Babenko |
| 2022 | Graph Parameters, Implicit Representations and Factorial Properties. Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev |
| 2022 | Harmless Sets in Sparse Classes. Pål Grønås Drange, Irene Muzi, Felix Reidl |
| 2022 | Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms. Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf |
| 2022 | Linear Time Construction of Indexable Elastic Founder Graphs. Nicola Rizzo, Veli Mäkinen |
| 2022 | List Covering of Regular Multigraphs. Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski |
| 2022 | Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model. Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal |
| 2022 | Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. János Balogh, György Dósa, Leah Epstein, Lukasz Jez |
| 2022 | On Critical Node Problems with Vulnerable Vertices. Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer |
| 2022 | On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. Soumen Nandi, Sagnik Sen, S. Taruni |
| 2022 | On the Existence of EFX Allocations. Bhaskar Ray Chaudhury |
| 2022 | On the Intractability Landscape of Digraph Intersection Representations. Andrea Caucchiolo, Ferdinando Cicalese |
| 2022 | Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs. Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza |
| 2022 | Perfect Matchings with Crossings. Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber |
| 2022 | Practical Space-Efficient Index for Structural Pattern Matching. Sung-Hwan Kim, Hwan-Gue Cho |
| 2022 | Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. Takuya Mieno, Mitsuru Funakoshi |
| 2022 | Space-Efficient B Trees via Load-Balancing. Tomohiro I, Dominik Köppl |
| 2022 | Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening. Thaís Bardini Idalino, Lucia Moura |
| 2022 | The Parameterized Complexity of s-Club with Triangle and Seed Constraints. Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer |
| 2022 | The Red-Blue Separation Problem on Graphs. Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä |
| 2022 | The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. Elisabet Burjons, Janosch Fuchs, Henri Lotze |
| 2022 | Tukey Depth Histograms. Daniel Bertschinger, Jonas Passweg, Patrick Schnider |
| 2022 | Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. Felicia Lucke, Felix Mann |
| 2022 | Winner Determination Algorithms for Graph Games with Matching Structures. Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono |