| 2021 | A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider. Max Bender, Jacob Gilbert, Kirk Pruhs |
| 2021 | Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi |
| 2021 | Bipartite 3-Regular Counting Problems with Mixed Signs. Jin-Yi Cai, Austen Z. Fan, Yin Liu |
| 2021 | Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types. Nobuko Yoshida, Fangyi Zhou, Francisco Ferreira |
| 2021 | Complexity of Word Problems for HNN-Extensions. Markus Lohrey |
| 2021 | Computational Complexity of Computing a Quasi-Proper Equilibrium. Kristoffer Arnsfelt Hansen, Troels Bjerre Lund |
| 2021 | Computational Complexity of Covering Disconnected Multigraphs. Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová |
| 2021 | Computational Complexity of Synchronization Under Sparse Regular Constraints. Stefan Hoffmann |
| 2021 | Concentration of the Collision Estimator. Maciej Skorski |
| 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 | First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith |
| 2021 | From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm |
| 2021 | Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings Evripidis Bampis, Aris Pagourtzis |
| 2021 | Linear-Time Minimal Cograph Editing. Christophe Crespelle |
| 2021 | Mengerian Temporal Graphs Revisited. Allen Ibiapina, Ana Silva |
| 2021 | Minimum Consistent Subset Problem for Trees. Sanjana Dey, Anil Maheshwari, Subhas C. Nandy |
| 2021 | On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle |
| 2021 | On Finding Separators in Temporal Split and Permutation Graphs. Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken |
| 2021 | On Minimizing Regular Expressions Without Kleene Star. Hermann Gruber, Markus Holzer, Simon Wolfsteiner |
| 2021 | On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits. S. Raja, G. V. Sumukha Bharadwaj |
| 2021 | Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. David Eppstein, Siddharth Gupta, Elham Havvaei |
| 2021 | Propositional Gossip Protocols. Joseph Livesey, Dominik Wojtczak |
| 2021 | Regular Model Checking with Regular Relations. Vrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi |
| 2021 | Streaming Deletion Problems Parameterized by Vertex Cover. Jelle J. Oostveen, Erik Jan van Leeuwen |
| 2021 | TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs. Nicolas Bousquet, Alice Joffard |
| 2021 | The Complexity of Bicriteria Tree-Depth. Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula |
| 2021 | The Possible Winner Problem with Uncertain Weights Revisited. Marc Neveling, Jörg Rothe, Robin Weishaupt |
| 2021 | The Satisfiability Problem for a Quantitative Fragment of PCTL. Miroslav Chodil, Antonín Kucera |
| 2021 | The Space Complexity of Sum Labelling. Henning Fernau, Kshitij Gajjar |
| 2021 | Two-Sided Matching Markets with Strongly Correlated Preferences. Hugo Gimbert, Claire Mathieu, Simon Mauras |
| 2021 | Valency-Based Consensus Under Message Adversaries Without Limit-Closure. Kyrill Winkler, Ulrich Schmid, Thomas Nowak |