| 2023 | Separating Automatic Relations. | Pablo Barcel, Diego Figueira, Rmi Morvan |
| 2023 | Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification. | Jir Balun, Toms Masopust, Petr Osicka |
| 2023 | Entropic Risk for Turn-Based Stochastic Games. | Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer |
| 2023 | Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. | Vikraman Arvind, Pushkar S. Joglekar |
| 2023 | The Geometry of Reachability in Continuous Vector Addition Systems with States. | Shaull Almagor, Arka Ghosh, Tim Leys, Guillermo A. Prez |
| 2023 | Solving Irreducible Stochastic Mean-Payoff Games and Entropy Games by Relative Krasnoselskii-Mann Iteration. | Marianne Akian, Stphane Gaubert, Ulysse Naepels, Basile Terver |
| 2023 | Descriptive Complexity for Distributed Computing with Circuits. | Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto |
| 2023 | Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. | Antonis Achilleos, Aggeliki Chalki |
| 2023 | Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. | Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann |
| 2023 | Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. | Matthew Johnson, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2023 | Fixed-Parameter Algorithms for Fair Hitting Set Problems. | Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh |
| 2023 | Modification Problems Toward Proper (Helly) Circular-Arc Graphs. | Yixin Cao, Hanchun Yuan, Jianxin Wang |
| 2023 | On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages. | Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer |
| 2023 | Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work. | Jonas Schmidt, Thomas Schwentick |
| 2023 | Inductive Continuity via Brouwer Trees. | Liron Cohen, Bruno da Rocha Paiva, Vincent Rahli, Ayberk Tosun |
| 2023 | Rnyi-Ulam Games and Online Computation with Imperfect Advice. | Spyros Angelopoulos, Shahin Kamali |
| 2023 | Graph Connectivity with Noisy Queries. | Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos |
| 2023 | An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. | Julien Clment, Antoine Genitrini |
| 2023 | On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation. | Yoshiki Nakamura |
| 2023 | Competitive Search in the Line and the Star with Predictions. | Spyros Angelopoulos |
| 2022 | Improved Approximation Algorithms for the Traveling Tournament Problem. | Jingyang Zhao, Mingyu Xiao, Chao Xu |
| 2022 | Computing the Minimum Bottleneck Moving Spanning Tree. | Haitao Wang, Yiming Zhao |
| 2022 | Online Bipartite Matching and Adwords (Invited Talk). | Vijay V. Vazirani |
| 2022 | Space-Bounded Unitary Quantum Computation with Postselection. | Seiichiro Tani |
| 2022 | Higher-Order Causal Theories Are Models of BV-Logic. | Will Simmons, Aleks Kissinger |