| 2022 | Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms. | Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf |
| 2022 | A Shift Gray Code for Fixed-Content Łukasiewicz Words. | Paul W. Lapey, Aaron Williams |
| 2022 | Practical Space-Efficient Index for Structural Pattern Matching. | Sung-Hwan Kim, Hwan-Gue Cho |
| 2022 | Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota. | Joanna Kaczmarek, Jrg Rothe |
| 2022 | An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations. | Asei Inoue, Yusuke Kobayashi |
| 2022 | Space-Efficient B Trees via Load-Balancing. | Tomohiro I, Dominik Kppl |
| 2022 | Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening. | Thas Bardini Idalino, Lucia Moura |
| 2022 | The Parameterized Complexity of s-Club with Triangle and Seed Constraints. | Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer |
| 2022 | Harmless Sets in Sparse Classes. | Pl Grns Drange, Irene Muzi, Felix Reidl |
| 2022 | The Red-Blue Separation Problem on Graphs. | Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtil |
| 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, Uverton S. Souza |
| 2022 | The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. | Elisabet Burjons, Janosch Fuchs, Henri Lotze |
| 2022 | List Covering of Regular Multigraphs. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Pawel Rzazewski |
| 2022 | A New Temporal Interpretation of Cluster Editing. | Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester |
| 2022 | An Efficient Algorithm for the Proximity Connected Two Center Problem. | Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer |
| 2022 | Tukey Depth Histograms. | Daniel Bertschinger, Jonas Passweg, Patrick Schnider |
| 2022 | 1-Extendability of Independent Sets. | Pierre Berg, Anthony Busson, Carl Feghali, Rmi Watrigant |
| 2022 | Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. | Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis |
| 2022 | Computing Longest (Common) Lyndon Subsequences. | Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Kppl, Simon J. Puglisi |
| 2022 | An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars. | Avah Banerjee |
| 2022 | Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. | Jnos Balogh, Gyrgy Dsa, Leah Epstein, Lukasz Jez |
| 2022 | Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. | Stepan Artamonov, Maxim A. Babenko |
| 2022 | Approximating Subset Sum Ratio via Subset Sum Computations. | Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis |