| 2021 | 19th International Symposium on Experimental Algorithms, SEA 2021, Nice, France, June 7-9, 2021 David Coudert, Emanuele Natale |
| 2021 | A Fast and Tight Heuristic for A* in Road Networks. Ben Strasser, Tim Zeitz |
| 2021 | A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures. Coline Gianfrotta, Vladimir Reinharz, Dominique Barth, Alain Denise |
| 2021 | An Experimental Study of External Memory Algorithms for Connected Components. Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran |
| 2021 | Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams. Samantha Chen, Yusu Wang |
| 2021 | Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2021 | Document Retrieval Hacks. Simon J. Puglisi, Bella Zhukova |
| 2021 | Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity. Max Franck, Sorrachai Yingchareonthawornchai |
| 2021 | Engineering Predecessor Data Structures for Dynamic Integer Sets. Patrick Dinklage, Johannes Fischer, Alexander Herlez |
| 2021 | Fast and Robust Vectorized In-Place Sorting of Primitive Types. Mark Blacher, Joachim Giesen, Lars Kuehne |
| 2021 | Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2021 | Fréchet Mean and p-Mean on the Unit Circle: Decidability, Algorithm, and Applications to Clustering on the Flat Torus. Frédéric Cazals, Bernard Delmas, Timothée O'Donnell |
| 2021 | How to Find the Exit from a 3-Dimensional Maze. Miki Hermann |
| 2021 | Minimum Scan Cover and Variants - Theory and Experiments. Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs |
| 2021 | Multi-Level Weighted Additive Spanners. Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence |
| 2021 | Multilevel Hypergraph Partitioning with Vertex Weights Revisited. Tobias Heuer, Nikolai Maas, Sebastian Schlag |
| 2021 | Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications. Valentin Buchhold, Dorothea Wagner |
| 2021 | O'Reach: Even Faster Reachability in Large Graphs. Kathrin Hanauer, Christian Schulz, Jonathan Trummer |
| 2021 | On Computing the Diameter of (Weighted) Link Streams. Marco Calamai, Pierluigi Crescenzi, Andrea Marino |
| 2021 | On Tamaki's Algorithm to Compute Treewidths. Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, Sarah Ziegler |
| 2021 | Parallel Five-Cycle Counting Algorithms. Louisa Ruixue Huang, Jessica Shi, Julian Shun |
| 2021 | Practical Implementation of Encoding Range Top-2 Queries. Seungbum Jo, Wooyoung Park, Srinivasa Rao Satti |
| 2021 | Targeted Branching for the Maximum Independent Set Problem. Demian Hespe, Sebastian Lamm, Christian Schorr |
| 2021 | Three Is Enough for Steiner Trees. Emmanuel Arrighi, Mateus de Oliveira Oliveira |