| 2021 | A Hamilton Cycle in the k-Sided Pancake Network. Ben Cameron, Joe Sawada, Aaron Williams |
| 2021 | A Study on the Existence of Null Labelling for 3-Hypergraphs. Niccolò Di Marco, Andrea Frosini, William Lawrence Kocay |
| 2021 | A Triangle Process on Regular Graphs. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill |
| 2021 | Algorithms and Complexity of s-Club Cluster Vertex Deletion. Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai |
| 2021 | All Subgraphs of a Wheel Are 5-Coupled-Choosable. Sam Barr, Therese Biedl |
| 2021 | An Efficient Noisy Binary Search in Graphs via Median Approximation. Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski |
| 2021 | An FPT Algorithm for Matching Cut and d-Cut. N. R. Aravind, Roopam Saxena |
| 2021 | Approximating Multistage Matching Problems. Markus Chimani, Niklas Troost, Tilo Wiedera |
| 2021 | Approximation Algorithms for Hitting Subgraphs. Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma |
| 2021 | Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k. Toru Hasunuma |
| 2021 | Backtrack Search for Parallelisms of Projective Spaces. Svetlana Topalova, Stela Zhelezova |
| 2021 | Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations. Yoshifumi Manabe, Hibiki Ono |
| 2021 | Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings Paola Flocchini, Lucia Moura |
| 2021 | Combinatorics and Algorithms for Quasi-chain Graphs. Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev |
| 2021 | Complexity and Algorithms for MUL-Tree Pruning. Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk |
| 2021 | Composed Degree-Distance Realizations of Graphs. Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz |
| 2021 | Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy |
| 2021 | Covering Convex Polygons by Two Congruent Disks. Jongmin Choi, Dahye Jeong, Hee-Kap Ahn |
| 2021 | Disjoint Paths and Connected Subgraphs for H-Free Graphs. Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2021 | Edge Exploration of Temporal Graphs. Benjamin Merlin Bumpus, Kitty Meeks |
| 2021 | Heuristically Enhanced IPO Algorithms for Covering Array Generation. Michael Wagner, Ludwig Kampel, Dimitris E. Simos |
| 2021 | Intersecting Disks Using Two Congruent Disks. Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn |
| 2021 | Isomorphic Unordered Labeled Trees up to Substitution Ciphering. Florian Ingels, Romain Azaïs |
| 2021 | Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. Andrea Marino, Ana Silva |
| 2021 | Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs. Nesrine Abbas |
| 2021 | Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract). Konstantinos Georgiou, Somnath Kundu, Pawel Pralat |
| 2021 | Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. Martin Kucera, Ondrej Suchý |
| 2021 | New Approximations and Hardness Results for Submodular Partitioning Problems. Richard Santiago |
| 2021 | Non-preemptive Tree Packing. Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf |
| 2021 | On an Ordering Problem in Weighted Hypergraphs. Peter Damaschke |
| 2021 | On the Oriented Coloring of the Disjoint Union of Graphs. Erika Morais Martins Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein |
| 2021 | Optimal Monomial Quadratization for ODE Systems. Andrey Bychkov, Gleb Pogudin |
| 2021 | Piercing All Translates of a Set of Axis-Parallel Rectangles. Adrian Dumitrescu, Josef Tkadlec |
| 2021 | Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. Soh Kumabe, Takanori Maehara |
| 2021 | Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs. Rahnuma Islam Nishat, Srinivasan Venkatesh, Sue Whitesides |
| 2021 | Relaxed and Approximate Graph Realizations. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz |
| 2021 | Search for Combinatorial Objects Using Lattice Algorithms - Revisited. Alfred Wassermann |
| 2021 | Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups. Simon Coumes, Tassadit Bouadi, Lhouari Nourine, Alexandre Termier |
| 2021 | The Pony Express Communication Problem. Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce |
| 2021 | The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets. Ferdinando Cicalese, Nicolò Pilati |
| 2021 | Vertex Cover at Distance on H-Free Graphs. Clément Dallard, Mirza Krbezlija, Martin Milanic |