| 2022 | On Algorithms Based on Finitely Many Homomorphism Counts. | Yijia Chen, Jrg Flum, Mingjun Liu, Zhiyang Xun |
| 2022 | Sample Compression Schemes for Balls in Graphs. | Jrmie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sbastien Ratel, Yann Vaxs |
| 2022 | On Synthesizing Computable Skolem Functions for First Order Logic. | Supratik Chakraborty, S. Akshay |
| 2022 | On Kernels for d-Path Vertex Cover. | Radovan Cerven, Pratibha Choudhary, Ondrej Such |
| 2022 | Continuous Rational Functions Are Deterministic Regular. | Olivier Carton, Gatan Douneau-Tabot |
| 2022 | Bounded Degree Nonnegative Counting CSP. | Jin-Yi Cai, Daniel P. Szabo |
| 2022 | Boundaries to Single-Agent Stability in Additively Separable Hedonic Games. | Martin Bullinger |
| 2022 | Extending Partial Representations of Circle Graphs in Near-Linear Time. | Guido Brckner, Ignaz Rutter, Peter Stumpf |
| 2022 | Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions. | Robert I. Booth, Titouan Carette |
| 2022 | On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. | Ilario Bonacina, Nicola Galesi, Massimo Lauria |
| 2022 | Tree Exploration in Dual-Memory Model. | Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski, Dominik Pajak |
| 2022 | Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. | Niclas Boehmer, Klaus Heeger, Rolf Niedermeier |
| 2022 | Skolem Meets Schanuel. | Yuri Bilu, Florian Luca, Joris Nieuwveld, Jol Ouaknine, David Purser, James Worrell |
| 2022 | Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. | Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew |
| 2022 | Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. | C. S. Bhargav, Sagnik Dutta, Nitin Saxena |
| 2022 | Fixed-Point Cycles and Approximate EFX Allocations. | Benjamin Aram Berendsohn, Simona Boyadzhiyska, Lszl Kozma |
| 2022 | Algebraic Representations of Unique Bipartite Perfect Matching. | Gal Beniamini |
| 2022 | Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. | Bartosz Bednarczyk, Reijo Jaakkola |
| 2022 | Graph Realization of Distance Sets. | Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz |
| 2022 | On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Dror Rawitz |
| 2022 | An Updated Survey of Bidding Games on Graphs (Invited Talk). | Guy Avni, Thomas A. Henzinger |
| 2022 | Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. | David Auger, Pierre Coucheney, Loric Duhaze |
| 2022 | On Upward-Planar L-Drawings of Graphs. | Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo |
| 2022 | RAC Drawings of Graphs with Low Degree. | Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister |
| 2022 | Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. | Antoine Amarilli, Mikal Monet |