| 2022 | Embedding Arbitrary Boolean Circuits into Fungal Automata. | Augusto Modanese, Thomas Worsch |
| 2022 | Improved Parallel Algorithms for Generalized Baumslag Groups. | Caroline Mattes, Armin Wei |
| 2022 | The Net Automaton of a Rational Expression. | Sylvain Lombardy, Jacques Sakarovitch |
| 2022 | Estimating the Clustering Coefficient Using Sample Complexity Analysis. | Alane M. de Lima, Murilo V. G. da Silva, Andr Lus Vignatti |
| 2022 | Near-Optimal Search Time in δ-Optimal Space. | Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares |
| 2022 | Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries. | Seungbum Jo, Geunho Kim |
| 2022 | On the Complexity of Half-Guarding Monotone Polygons. | Hannah Miller Hillberg, Erik Krohn, Alex Pahlow |
| 2022 | On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering Structures. | Flix Hernndez, Gerardo Vega |
| 2022 | Conelikes and Ranker Comparisons. | Viktor Henriksson, Manfred Kufleitner |
| 2022 | Tree 3-Spanners on Generalized Prisms of Graphs. | Renzo Gmez, Flvio Keidi Miyazawa, Yoshiko Wakabayashi |
| 2022 | Weighted Connected Matchings. | Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vincius Fernandes dos Santos, Jayme Luiz Szwarcfiter |
| 2022 | MCSP is Hard for Read-Once Nondeterministic Branching Programs. | Ludmila Glinskih, Artur Riazanov |
| 2022 | On Vertex Guarding Staircase Polygons. | Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski |
| 2022 | Approximation Schemes for Packing Problems with ℓ | Waldo Glvez, Vctor Verdugo |
| 2022 | Bounds on Oblivious Multiparty Quantum Communication Complexity. | Franois Le Gall, Daiki Suruga |
| 2022 | Approximations for the Steiner Multicycle Problem. | Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura |
| 2022 | Patterns in Ordered (random) Matchings. | Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski |
| 2022 | Median and Hybrid Median K-Dimensional Trees. | Amalia Duch, Conrado Martnez, Merc Pons, Salvador Roura |
| 2022 | Pathlength of Outerplanar Graphs. | Thomas Dissaux, Nicolas Nisse |
| 2022 | Complexity Results on Untangling Red-Blue Matchings. | Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier |
| 2022 | On r-Guarding SCOTs - A New Family of Orthogonal Polygons. | Vasco Cruz, Ana Paula Toms |
| 2022 | Theoretical Analysis of git bisect. | Julien Courtiel, Paul Dorbec, Romain Lecoq |
| 2022 | On the Closures of Monotone Algebraic Classes and Variants of the Determinant. | Prasad Chaugule, Nutan Limaye |
| 2022 | Binary Completely Reachable Automata. | David Casas, Mikhail V. Volkov |
| 2022 | On APN Functions Whose Graphs are Maximal Sidon Sets. | Claude Carlet |