| 2021 | On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. | Svein Hgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle |
| 2021 | Computational Complexity of Synchronization Under Sparse Regular Constraints. | Stefan Hoffmann |
| 2021 | Computational Complexity of Computing a Quasi-Proper Equilibrium. | Kristoffer Arnsfelt Hansen, Troels Bjerre Lund |
| 2021 | On Minimizing Regular Expressions Without Kleene Star. | Hermann Gruber, Markus Holzer, Simon Wolfsteiner |
| 2021 | Two-Sided Matching Markets with Strongly Correlated Preferences. | Hugo Gimbert, Claire Mathieu, Simon Mauras |
| 2021 | The Space Complexity of Sum Labelling. | Henning Fernau, Kshitij Gajjar |
| 2021 | Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. | David Eppstein, Siddharth Gupta, Elham Havvaei |
| 2021 | Minimum Consistent Subset Problem for Trees. | Sanjana Dey, Anil Maheshwari, Subhas C. Nandy |
| 2021 | Regular Model Checking with Regular Relations. | Vrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi |
| 2021 | Linear-Time Minimal Cograph Editing. | Christophe Crespelle |
| 2021 | Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. | Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi |
| 2021 | The Satisfiability Problem for a Quantitative Fragment of PCTL. | Miroslav Chodil, Antonn Kucera |
| 2021 | Bipartite 3-Regular Counting Problems with Mixed Signs. | Jin-Yi Cai, Austen Z. Fan, Yin Liu |
| 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 | Computational Complexity of Covering Disconnected Multigraphs. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Michaela Seifrtov |
| 2021 | A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider. | Max Bender, Jacob Gilbert, Kirk Pruhs |
| 2021 | From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. | Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Lser, Marcus Wilhelm |
| 2021 | First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. | Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith |
| 2019 | The Fault-Tolerant Metric Dimension of Cographs. | Duygu Vietz, Egon Wanke |
| 2019 | Bivariate B-Splines from Convex Pseudo-circle Configurations. | Dominique Schmitt |
| 2019 | Optimal Channel Utilization with Limited Feedback. | Gianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski |
| 2019 | Largest Common Prefix of a Regular Tree Language. | Markus Lohrey, Sebastian Maneth |
| 2019 | Two Characterizations of Finite-State Dimension. | Alexander Kozachinskiy, Alexander Shen |
| 2019 | Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. | Miroslaw Kowaluk, Andrzej Lingas |