LIPIcs, Volume 190, SEA 2021

• David Coudert and Emanuele Natale LIPIcs, Volume 190, SEA 2021, Complete Volume 10.4230/LIPIcs.SEA.2021
• David Coudert and Emanuele Natale Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SEA.2021.0
• Max Franck and Sorrachai Yingchareonthawornchai Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity 10.4230/LIPIcs.SEA.2021.1
• Louisa Ruixue Huang, Jessica Shi, and Julian Shun Parallel Five-Cycle Counting Algorithms 10.4230/LIPIcs.SEA.2021.2
• Mark Blacher, Joachim Giesen, and Lars Kühne Fast and Robust Vectorized In-Place Sorting of Primitive Types 10.4230/LIPIcs.SEA.2021.3
• Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, and Martijn Struijs Minimum Scan Cover and Variants - Theory and Experiments 10.4230/LIPIcs.SEA.2021.4
• Emmanuel Arrighi and Mateus de Oliveira Oliveira Three Is Enough for Steiner Trees 10.4230/LIPIcs.SEA.2021.5
• Ben Strasser and Tim Zeitz A Fast and Tight Heuristic for A* in Road Networks 10.4230/LIPIcs.SEA.2021.6
• Patrick Dinklage, Johannes Fischer, and Alexander Herlez Engineering Predecessor Data Structures for Dynamic Integer Sets 10.4230/LIPIcs.SEA.2021.7
• Tobias Heuer, Nikolai Maas, and Sebastian Schlag Multilevel Hypergraph Partitioning with Vertex Weights Revisited 10.4230/LIPIcs.SEA.2021.8
• Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, and Sarah Ziegler On Tamaki’s Algorithm to Compute Treewidths 10.4230/LIPIcs.SEA.2021.9
• Seungbum Jo, Wooyoung Park, and Srinivasa Rao Satti Practical Implementation of Encoding Range Top-2 Queries 10.4230/LIPIcs.SEA.2021.10
• Marco Calamai, Pierluigi Crescenzi, and Andrea Marino On Computing the Diameter of (Weighted) Link Streams 10.4230/LIPIcs.SEA.2021.11
• Simon J. Puglisi and Bella Zhukova Document Retrieval Hacks 10.4230/LIPIcs.SEA.2021.12
• Kathrin Hanauer, Christian Schulz, and Jonathan Trummer O'Reach: Even Faster Reachability in Large Graphs 10.4230/LIPIcs.SEA.2021.13
• Samantha Chen and Yusu Wang Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams 10.4230/LIPIcs.SEA.2021.14
• Frédéric Cazals, Bernard Delmas, and Timothee O'Donnell Fréchet Mean and p-Mean on the Unit Circle: Decidability, Algorithm, and Applications to Clustering on the Flat Torus 10.4230/LIPIcs.SEA.2021.15
• Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence Multi-Level Weighted Additive Spanners 10.4230/LIPIcs.SEA.2021.16
• Demian Hespe, Sebastian Lamm, and Christian Schorr Targeted Branching for the Maximum Independent Set Problem 10.4230/LIPIcs.SEA.2021.17
• Valentin Buchhold and Dorothea Wagner Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications 10.4230/LIPIcs.SEA.2021.18
• 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 10.4230/LIPIcs.SEA.2021.19
• Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, and Evangelos Kosinas Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice 10.4230/LIPIcs.SEA.2021.20
• Miki Hermann How to Find the Exit from a 3-Dimensional Maze 10.4230/LIPIcs.SEA.2021.21
• Thomas Bläsius, Tobias Friedrich, and Maximilian Katzmann Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane 10.4230/LIPIcs.SEA.2021.22
• 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 10.4230/LIPIcs.SEA.2021.23