| 2023 | Complexity of Conformant Election Manipulation. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2023 | Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. | William S. Evans, David G. Kirkpatrick |
| 2023 | An Efficient Computation of the Rank Function of a Positroid. | Lamar Chidiac, Santiago Guzmn-Pro, Winfried Hochstttler, Anthony Youssef |
| 2023 | Contracting Edges to Destroy a Pattern: A Complexity Study. | Dipayan Chakraborty, R. B. Sandeep |
| 2023 | Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. | Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen |
| 2023 | On Computing Optimal Temporal Branchings. | Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva |
| 2023 | Computing Subset Vertex Covers in H-Free Graphs. | Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Danil Paulusma, Erik Jan van Leeuwen |
| 2023 | The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited. | Johanna Bjrklund |
| 2023 | Parsing Unranked Tree Languages, Folded Once. | Martin Berglund, Henrik Bjrklund, Johanna Bjrklund |
| 2023 | Domino Snake Problems on Groups. | Nathalie Aubrun, Nicolas Bitar |
| 2023 | The Rectilinear Convex Hull of Line Segments. | Carlos Alegra, Justin Dallant, Pablo Prez-Lantero, Carlos Seara |
| 2023 | Convergence of Distributions on Paths. | Samy Abbes |
| 2021 | Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types. | Nobuko Yoshida, Fangyi Zhou, Francisco Ferreira |
| 2021 | Valency-Based Consensus Under Message Adversaries Without Limit-Closure. | Kyrill Winkler, Ulrich Schmid, Thomas Nowak |
| 2021 | Concentration of the Collision Estimator. | Maciej Skorski |
| 2021 | On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits. | S. Raja, G. V. Sumukha Bharadwaj |
| 2021 | Streaming Deletion Problems Parameterized by Vertex Cover. | Jelle J. Oostveen, Erik Jan van Leeuwen |
| 2021 | The Possible Winner Problem with Uncertain Weights Revisited. | Marc Neveling, Jrg Rothe, Robin Weishaupt |
| 2021 | On Finding Separators in Temporal Split and Permutation Graphs. | Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken |
| 2021 | Complexity of Word Problems for HNN-Extensions. | Markus Lohrey |
| 2021 | Propositional Gossip Protocols. | Joseph Livesey, Dominik Wojtczak |
| 2021 | Deciding Top-Down Determinism of Regular Tree Languages. | Peter Leupold, Sebastian Maneth |
| 2021 | Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. | Jesper Jansson, Wing Lik Lee |
| 2021 | Faster FPT Algorithms for Deletion to Pairs of Graph Classes. | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman |
| 2021 | Mengerian Temporal Graphs Revisited. | Allen Ibiapina, Ana Silva |