- Ben Strasser and Tim Zeitz
A Fast and Tight Heuristic for A* in Road Networks - Coline Gianfrotta, Vladimir Reinharz, Dominique Barth and Alain Denise
A Graph-based Similarity Approach to Classify Recurrent Complex Motifs from their Context in RNA Structures - Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck and Hung Tran
An Experimental Study of External Memory Algorithms for Connected Components - Samantha Chen and Yusu Wang
Approximation algorithms for 1-Wasserstein distance between persistence diagrams - Loukas Georgiadis, Konstantinos Giannis, Giuseppe Italiano and Evangelos Kosinas
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice - Simon Puglisi and Bella Zhukova
Document Listing Hacks - Max Franck and Sorrachai Yingchareonthawornchai
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity - Patrick Dinklage, Johannes Fischer and Alexander Herlez
Engineering Predecessor Data Structures for Dynamic Integer Sets - Mark Blacher, Joachim Giesen and Lars Kühne
Fast and Robust Vectorized In-Place Sorting of Primitive Types - Thomas Bläsius, Tobias Friedrich and Maximilian Katzmann
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane - Frederic Cazals, Timothee O'Donnell and Bernard Delmas
Fréchet mean and p-mean on the unit circle: decidability, algorithm, and applications to clustering on the flat torus - Miki Hermann
How to Find the Exit from a 3-Dimensional Maze - Kevin Buchin, Sándor Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers and Martijn Struijs
Minimum Scan Cover and Variants - Theory and Experiments - Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov and Richard Spence
Multi-level Weighted Additive Spanners - Tobias Heuer, Nikolai Maas and Sebastian Schlag
Multilevel Hypergraph Partitioning with Vertex Weights Revisited - Valentin Buchhold and Dorothea Wagner
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications - Kathrin Hanauer, Christian Schulz and Jonathan Trummer
O'Reach: Even Faster Reachability in Large Graphs - Marco Calamai, Pierluigi Crescenzi and Andrea Marino
On Computing the Diameter of (Weighted) Link Streams - Ernst Althaus, Daniela Schnurbusch, Julian Wüschner and Sarah Ziegler
On Tamaki's Algorithm to Compute Treewidths - Louisa Ruixue Huang, Jessica Shi and Julian Shun
Parallel Five-Cycle Counting Algorithms - Seungbum Jo, Wooyoung Park and Srinivasa Rao Satti
Practical Implementation of Encoding Range Top-2 Queries - Demian Hespe, Sebastian Lamm and Christian Schorr
Targeted Branching for the Maximum Independent Set Problem - Emmanuel Arrighi and Mateus De Oliveira Oliveira
Three is Enough for Steiner Trees
SEA 2021 Université Côte d'Azur, Valrose, France
Nice's harbour.
Nice's harbour.
SEA 2021 Université Côte d'Azur, Valrose, France
Antibes, 15 minutes by car from Sophia Antipolis
Antibes, 15 minutes by car from Sophia Antipolis
SEA 2021 Université Côte d'Azur, Valrose, France
Nice, la baie des Anges (Baia dei ange en niçois)
Nice, la baie des Anges (Baia dei ange en niçois)