<h2>LIPIcs, Volume 190, SEA 2021</h2>
<ul>
<li>
<span class="authors">David Coudert and Emanuele Natale</span>
<span class="title">LIPIcs, Volume 190, SEA 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021">10.4230/LIPIcs.SEA.2021</a>
</li>
<li>
<span class="authors">David Coudert and Emanuele Natale</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.0">10.4230/LIPIcs.SEA.2021.0</a>
</li>
<li>
<span class="authors">Max Franck and Sorrachai Yingchareonthawornchai</span>
<span class="title">Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.1">10.4230/LIPIcs.SEA.2021.1</a>
</li>
<li>
<span class="authors">Louisa Ruixue Huang, Jessica Shi, and Julian Shun</span>
<span class="title">Parallel Five-Cycle Counting Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.2">10.4230/LIPIcs.SEA.2021.2</a>
</li>
<li>
<span class="authors">Mark Blacher, Joachim Giesen, and Lars Kühne</span>
<span class="title">Fast and Robust Vectorized In-Place Sorting of Primitive Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.3">10.4230/LIPIcs.SEA.2021.3</a>
</li>
<li>
<span class="authors">Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, and Martijn Struijs</span>
<span class="title">Minimum Scan Cover and Variants - Theory and Experiments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.4">10.4230/LIPIcs.SEA.2021.4</a>
</li>
<li>
<span class="authors">Emmanuel Arrighi and Mateus de Oliveira Oliveira</span>
<span class="title">Three Is Enough for Steiner Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.5">10.4230/LIPIcs.SEA.2021.5</a>
</li>
<li>
<span class="authors">Ben Strasser and Tim Zeitz</span>
<span class="title">A Fast and Tight Heuristic for A* in Road Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.6">10.4230/LIPIcs.SEA.2021.6</a>
</li>
<li>
<span class="authors">Patrick Dinklage, Johannes Fischer, and Alexander Herlez</span>
<span class="title">Engineering Predecessor Data Structures for Dynamic Integer Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.7">10.4230/LIPIcs.SEA.2021.7</a>
</li>
<li>
<span class="authors">Tobias Heuer, Nikolai Maas, and Sebastian Schlag</span>
<span class="title">Multilevel Hypergraph Partitioning with Vertex Weights Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.8">10.4230/LIPIcs.SEA.2021.8</a>
</li>
<li>
<span class="authors">Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, and Sarah Ziegler</span>
<span class="title">On Tamaki’s Algorithm to Compute Treewidths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.9">10.4230/LIPIcs.SEA.2021.9</a>
</li>
<li>
<span class="authors">Seungbum Jo, Wooyoung Park, and Srinivasa Rao Satti</span>
<span class="title">Practical Implementation of Encoding Range Top-2 Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.10">10.4230/LIPIcs.SEA.2021.10</a>
</li>
<li>
<span class="authors">Marco Calamai, Pierluigi Crescenzi, and Andrea Marino</span>
<span class="title">On Computing the Diameter of (Weighted) Link Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.11">10.4230/LIPIcs.SEA.2021.11</a>
</li>
<li>
<span class="authors">Simon J. Puglisi and Bella Zhukova</span>
<span class="title">Document Retrieval Hacks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.12">10.4230/LIPIcs.SEA.2021.12</a>
</li>
<li>
<span class="authors">Kathrin Hanauer, Christian Schulz, and Jonathan Trummer</span>
<span class="title">O'Reach: Even Faster Reachability in Large Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.13">10.4230/LIPIcs.SEA.2021.13</a>
</li>
<li>
<span class="authors">Samantha Chen and Yusu Wang</span>
<span class="title">Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.14">10.4230/LIPIcs.SEA.2021.14</a>
</li>
<li>
<span class="authors">Frédéric Cazals, Bernard Delmas, and Timothee O'Donnell</span>
<span class="title">Fréchet Mean and p-Mean on the Unit Circle: Decidability, Algorithm, and Applications to Clustering on the Flat Torus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.15">10.4230/LIPIcs.SEA.2021.15</a>
</li>
<li>
<span class="authors">Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence</span>
<span class="title">Multi-Level Weighted Additive Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.16">10.4230/LIPIcs.SEA.2021.16</a>
</li>
<li>
<span class="authors">Demian Hespe, Sebastian Lamm, and Christian Schorr</span>
<span class="title">Targeted Branching for the Maximum Independent Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.17">10.4230/LIPIcs.SEA.2021.17</a>
</li>
<li>
<span class="authors">Valentin Buchhold and Dorothea Wagner</span>
<span class="title">Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.18">10.4230/LIPIcs.SEA.2021.18</a>
</li>
<li>
<span class="authors">Coline Gianfrotta, Vladimir Reinharz, Dominique Barth, and Alain Denise</span>
<span class="title">A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.19">10.4230/LIPIcs.SEA.2021.19</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, and Evangelos Kosinas</span>
<span class="title">Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.20">10.4230/LIPIcs.SEA.2021.20</a>
</li>
<li>
<span class="authors">Miki Hermann</span>
<span class="title">How to Find the Exit from a 3-Dimensional Maze</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.21">10.4230/LIPIcs.SEA.2021.21</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, and Maximilian Katzmann</span>
<span class="title">Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.22">10.4230/LIPIcs.SEA.2021.22</a>
</li>
<li>
<span class="authors">Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, and Hung Tran</span>
<span class="title">An Experimental Study of External Memory Algorithms for Connected Components</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2021.23">10.4230/LIPIcs.SEA.2021.23</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing