| 2022 | How Much Randomness is Needed to Convert MA Protocols to AM Protocols? | Nikolai K. Vereshchagin |
| 2022 | Characterizing Level One in Group-Based Concatenation Hierarchies. | Thomas Place, Marc Zeitoun |
| 2022 | Abelian Repetition Threshold Revisited. | Elena A. Petrova, Arseny M. Shur |
| 2022 | Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. | Abidha V. P, Pradeesha Ashok, Avi Tomar, Dolly Yadav |
| 2022 | Partial Vertex Cover on Graphs of Bounded Degeneracy. | Fahad Panolan, Hannane Yaghoubizade |
| 2022 | The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. | Pierre Ohlmann |
| 2022 | On the Determinization of Event-Clock Input-Driven Pushdown Automata. | Mizuhito Ogawa, Alexander Okhotin |
| 2022 | Heterogeneous Multi-commodity Network Flows over Time. | Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao, Zhiya Chen |
| 2022 | New Bounds for the Flock-of-Birds Problem. | Alexander Kozachinskiy |
| 2022 | Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields. | Peter Kostolnyi |
| 2022 | The Fast Algorithm for Online k-server Problem on Trees. | Kamil Khadiev, Maxim Yagafarov |
| 2022 | Discrete Versions of the KKM Lemma and Their PPAD-Completeness. | Alexander Grishutin, Daniil Musatov |
| 2022 | Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. | Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh |
| 2022 | Bounds for Synchronizing Markov Decision Processes. | Laurent Doyen, Marie van den Bogaard |
| 2022 | Output Sensitive Fault Tolerant Maximum Matching. | Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh |
| 2022 | Lossy Kernelization of Same-Size Clustering. | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov |
| 2022 | Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. | Lorenzo Balzotti, Paolo Giulio Franciosa |
| 2022 | Eternal Vertex Cover on Bipartite Graphs. | Jasine Babu, Neeldhara Misra, Saraswati Nanoti |
| 2022 | Parameterized Complexity of List Coloring and Max Coloring. | Bardiya Aryanfard, Fahad Panolan |
| 2022 | Quotient Structures and Groups Computable in Polynomial Time. | Pavel Alaev |
| 2022 | Parameterized Algorithms for Finding Highly Connected Solution. | Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh |
| 2021 | A Generalization of a Theorem of Rothschild and van Lint. | Ning Xie, Shuai Xu, Yekun Xu |
| 2021 | Approximation and Complexity of the Capacitated Geometric Median Problem. | Vladimir Shenmaier |
| 2021 | A Generic Convolution Algorithm for Join Operations on Tree Decompositions. | Johan M. M. van Rooij |
| 2021 | On Separation Between the Degree of a Boolean Function and the Block Sensitivity. | Nikolay V. Proskurin |