default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th SEA 2021: Nice, France
- David Coudert
, Emanuele Natale:
19th International Symposium on Experimental Algorithms, SEA 2021, June 7-9, 2021, Nice, France. LIPIcs 190, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-185-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Max Franck, Sorrachai Yingchareonthawornchai:
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity. 1:1-1:18 - Louisa Ruixue Huang, Jessica Shi, Julian Shun:
Parallel Five-Cycle Counting Algorithms. 2:1-2:18 - Mark Blacher, Joachim Giesen, Lars Kuehne:
Fast and Robust Vectorized In-Place Sorting of Primitive Types. 3:1-3:16 - Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
Minimum Scan Cover and Variants - Theory and Experiments. 4:1-4:16 - Emmanuel Arrighi, Mateus de Oliveira Oliveira:
Three Is Enough for Steiner Trees. 5:1-5:15 - Ben Strasser, Tim Zeitz:
A Fast and Tight Heuristic for A* in Road Networks. 6:1-6:16 - Patrick Dinklage, Johannes Fischer, Alexander Herlez:
Engineering Predecessor Data Structures for Dynamic Integer Sets. 7:1-7:19 - Tobias Heuer, Nikolai Maas, Sebastian Schlag:
Multilevel Hypergraph Partitioning with Vertex Weights Revisited. 8:1-8:20 - Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, Sarah Ziegler:
On Tamaki's Algorithm to Compute Treewidths. 9:1-9:18 - Seungbum Jo, Wooyoung Park, Srinivasa Rao Satti:
Practical Implementation of Encoding Range Top-2 Queries. 10:1-10:13 - Marco Calamai, Pierluigi Crescenzi, Andrea Marino:
On Computing the Diameter of (Weighted) Link Streams. 11:1-11:21 - Simon J. Puglisi, Bella Zhukova:
Document Retrieval Hacks. 12:1-12:12 - Kathrin Hanauer, Christian Schulz, Jonathan Trummer:
O'Reach: Even Faster Reachability in Large Graphs. 13:1-13:24 - Samantha Chen, Yusu Wang:
Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams. 14:1-14:19 - Frédéric Cazals, Bernard Delmas, Timothée O'Donnell:
Fréchet Mean and p-Mean on the Unit Circle: Decidability, Algorithm, and Applications to Clustering on the Flat Torus. 15:1-15:16 - Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Multi-Level Weighted Additive Spanners. 16:1-16:23 - Demian Hespe, Sebastian Lamm, Christian Schorr:
Targeted Branching for the Maximum Independent Set Problem. 17:1-17:21 - Valentin Buchhold, Dorothea Wagner:
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications. 18:1-18:18 - Coline Gianfrotta, Vladimir Reinharz, Dominique Barth, Alain Denise:
A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures. 19:1-19:18 - Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. 20:1-20:19 - Miki Hermann:
How to Find the Exit from a 3-Dimensional Maze. 21:1-21:12 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. 22:1-22:18 - Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran:
An Experimental Study of External Memory Algorithms for Connected Components. 23:1-23:23
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-04 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
