| 2021 | A Multistage View on 2-Satisfiability. Till Fluschnik |
| 2021 | A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. Rajesh Chitnis |
| 2021 | Abundant Extensions. Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora |
| 2021 | Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings Tiziana Calamoneri, Federico Corò |
| 2021 | Algorithms for Energy Conservation in Heterogeneous Data Centers. Susanne Albers, Jens Quedenfeld |
| 2021 | Can Local Optimality Be Used for Efficient Data Reduction? Christian Komusiewicz, Nils Morawietz |
| 2021 | Circumventing Connectivity for Kernelization. Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma |
| 2021 | Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. Barnaby Martin, Daniël Paulusma, Siani Smith |
| 2021 | Covering a Set of Line Segments with a Few Squares. Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong |
| 2021 | Distributed Distance-r Covering Problems on Sparse High-Girth Graphs. Saeed Akhoondian Amiri, Ben Wiederhake |
| 2021 | Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi |
| 2021 | Extending Partial Representations of Rectangular Duals with Given Contact Orientations. Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff |
| 2021 | FPT and Kernelization Algorithms for the Induced Tree Problem. Guilherme de Castro Mendes Gomes, Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter |
| 2021 | Fragile Complexity of Adaptive Algorithms. Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman |
| 2021 | Globally Rigid Augmentation of Minimally Rigid Graphs in R Csaba Király, András Mihálykó |
| 2021 | Invited Talks. Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor |
| 2021 | On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier |
| 2021 | On Vertex-Weighted Graph Realizations. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz |
| 2021 | On the Role of 3's for the 1-2-3 Conjecture. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney |
| 2021 | Online Two-Dimensional Vector Packing With Advice. Bengt J. Nilsson, Gordana Vujovic |
| 2021 | Online and Approximate Network Construction from Bounded Connectivity Constraints. Jesper Jansson, Christos Levcopoulos, Andrzej Lingas |
| 2021 | Phylogenetic Networks, A Way to Cope with Complex Evolutionary Processes. Katharina T. Huber |
| 2021 | Recent Advances in Competitive Analysis of Online Algorithms. Joseph (Seffi) Naor |
| 2021 | Reconfiguration of Connected Graph Partitions via Recombination. Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth |
| 2021 | Temporal Matching on Geometric Graph Data. Timothé Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan |
| 2021 | The Multi-budget Maximum Weighted Coverage Problem. Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj |
| 2021 | The Parameterized Suffix Tray. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | The Weisfeiler-Leman Algorithm and Recognition of Graph Properties. Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky |
| 2021 | Three Problems on Well-Partitioned Chordal Graphs. Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima |
| 2021 | Throughput Scheduling with Equal Additive Laxity. Martin Böhm, Nicole Megow, Jens Schlöter |
| 2021 | Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. Louis Dublois, Michael Lampis, Vangelis Th. Paschos |
| 2021 | Upper Tail Analysis of Bucket Sort and Random Tries. Ioana O. Bercea, Guy Even |