19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 1-434, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Proceedings{coudert_et_al:LIPIcs.SEA.2021, title = {{LIPIcs, Volume 190, SEA 2021, Complete Volume}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {1--434}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021}, URN = {urn:nbn:de:0030-drops-137716}, doi = {10.4230/LIPIcs.SEA.2021}, annote = {Keywords: LIPIcs, Volume 190, SEA 2021, Complete Volume} }
19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{coudert_et_al:LIPIcs.SEA.2021.0, author = {Coudert, David and Natale, Emanuele}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.0}, URN = {urn:nbn:de:0030-drops-137722}, doi = {10.4230/LIPIcs.SEA.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Max Franck and Sorrachai Yingchareonthawornchai. Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 1:1-1:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{franck_et_al:LIPIcs.SEA.2021.1, author = {Franck, Max and Yingchareonthawornchai, Sorrachai}, title = {{Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {1:1--1:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.1}, URN = {urn:nbn:de:0030-drops-137735}, doi = {10.4230/LIPIcs.SEA.2021.1}, annote = {Keywords: Algorithm Engineering, Algorithmic Graph Theory, Sublinear Algorithms} }
Louisa Ruixue Huang, Jessica Shi, and Julian Shun. Parallel Five-Cycle Counting Algorithms. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 2:1-2:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{huang_et_al:LIPIcs.SEA.2021.2, author = {Huang, Louisa Ruixue and Shi, Jessica and Shun, Julian}, title = {{Parallel Five-Cycle Counting Algorithms}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {2:1--2:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.2}, URN = {urn:nbn:de:0030-drops-137749}, doi = {10.4230/LIPIcs.SEA.2021.2}, annote = {Keywords: Cycle counting, parallel algorithms, graph algorithms} }
Mark Blacher, Joachim Giesen, and Lars Kühne. Fast and Robust Vectorized In-Place Sorting of Primitive Types. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{blacher_et_al:LIPIcs.SEA.2021.3, author = {Blacher, Mark and Giesen, Joachim and K\"{u}hne, Lars}, title = {{Fast and Robust Vectorized In-Place Sorting of Primitive Types}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {3:1--3:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.3}, URN = {urn:nbn:de:0030-drops-137758}, doi = {10.4230/LIPIcs.SEA.2021.3}, annote = {Keywords: Quicksort, Sorting Networks, Vectorization, SIMD, AVX2} }
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. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 4:1-4:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{buchin_et_al:LIPIcs.SEA.2021.4, author = {Buchin, Kevin and Fekete, S\'{a}ndor P. and Hill, Alexander and Kleist, Linda and Kostitsyna, Irina and Krupke, Dominik and Lambers, Roel and Struijs, Martijn}, title = {{Minimum Scan Cover and Variants - Theory and Experiments}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.4}, URN = {urn:nbn:de:0030-drops-137765}, doi = {10.4230/LIPIcs.SEA.2021.4}, annote = {Keywords: Graph scanning, angular metric, makespan, energy, bottleneck, complexity, approximation, algorithm engineering, mixed-integer programming, constraint programming} }
Emmanuel Arrighi and Mateus de Oliveira Oliveira. Three Is Enough for Steiner Trees. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{arrighi_et_al:LIPIcs.SEA.2021.5, author = {Arrighi, Emmanuel and de Oliveira Oliveira, Mateus}, title = {{Three Is Enough for Steiner Trees}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.5}, URN = {urn:nbn:de:0030-drops-137775}, doi = {10.4230/LIPIcs.SEA.2021.5}, annote = {Keywords: Steiner Tree, Heuristics, 3TST} }
Ben Strasser and Tim Zeitz. A Fast and Tight Heuristic for A* in Road Networks. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{strasser_et_al:LIPIcs.SEA.2021.6, author = {Strasser, Ben and Zeitz, Tim}, title = {{A Fast and Tight Heuristic for A* in Road Networks}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.6}, URN = {urn:nbn:de:0030-drops-137780}, doi = {10.4230/LIPIcs.SEA.2021.6}, annote = {Keywords: route planning, shortest paths, realistic road networks} }
Patrick Dinklage, Johannes Fischer, and Alexander Herlez. Engineering Predecessor Data Structures for Dynamic Integer Sets. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 7:1-7:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dinklage_et_al:LIPIcs.SEA.2021.7, author = {Dinklage, Patrick and Fischer, Johannes and Herlez, Alexander}, title = {{Engineering Predecessor Data Structures for Dynamic Integer Sets}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {7:1--7:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.7}, URN = {urn:nbn:de:0030-drops-137799}, doi = {10.4230/LIPIcs.SEA.2021.7}, annote = {Keywords: integer data structures, dynamic data structures, predecessor, universe reduction, y-fast trie, fusion tree, B-tree} }
Tobias Heuer, Nikolai Maas, and Sebastian Schlag. Multilevel Hypergraph Partitioning with Vertex Weights Revisited. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 8:1-8:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{heuer_et_al:LIPIcs.SEA.2021.8, author = {Heuer, Tobias and Maas, Nikolai and Schlag, Sebastian}, title = {{Multilevel Hypergraph Partitioning with Vertex Weights Revisited}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {8:1--8:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.8}, URN = {urn:nbn:de:0030-drops-137802}, doi = {10.4230/LIPIcs.SEA.2021.8}, annote = {Keywords: multilevel hypergraph partitioning, balanced partitioning, vertex weights} }
Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, and Sarah Ziegler. On Tamaki’s Algorithm to Compute Treewidths. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{althaus_et_al:LIPIcs.SEA.2021.9, author = {Althaus, Ernst and Schnurbusch, Daniela and W\"{u}schner, Julian and Ziegler, Sarah}, title = {{On Tamaki’s Algorithm to Compute Treewidths}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.9}, URN = {urn:nbn:de:0030-drops-137818}, doi = {10.4230/LIPIcs.SEA.2021.9}, annote = {Keywords: Tree Decomposition, Exact Algorithm, Algorithms Engineering} }
Seungbum Jo, Wooyoung Park, and Srinivasa Rao Satti. Practical Implementation of Encoding Range Top-2 Queries. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jo_et_al:LIPIcs.SEA.2021.10, author = {Jo, Seungbum and Park, Wooyoung and Satti, Srinivasa Rao}, title = {{Practical Implementation of Encoding Range Top-2 Queries}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.10}, URN = {urn:nbn:de:0030-drops-137827}, doi = {10.4230/LIPIcs.SEA.2021.10}, annote = {Keywords: Range top-2 query, Range minimum query, Cartesian tree, Succinct encoding} }
Marco Calamai, Pierluigi Crescenzi, and Andrea Marino. On Computing the Diameter of (Weighted) Link Streams. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 11:1-11:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{calamai_et_al:LIPIcs.SEA.2021.11, author = {Calamai, Marco and Crescenzi, Pierluigi and Marino, Andrea}, title = {{On Computing the Diameter of (Weighted) Link Streams}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {11:1--11:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.11}, URN = {urn:nbn:de:0030-drops-137836}, doi = {10.4230/LIPIcs.SEA.2021.11}, annote = {Keywords: Temporal graph, shortest path, diameter} }
Simon J. Puglisi and Bella Zhukova. Document Retrieval Hacks. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 12:1-12:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{puglisi_et_al:LIPIcs.SEA.2021.12, author = {Puglisi, Simon J. and Zhukova, Bella}, title = {{Document Retrieval Hacks}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {12:1--12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.12}, URN = {urn:nbn:de:0030-drops-137848}, doi = {10.4230/LIPIcs.SEA.2021.12}, annote = {Keywords: String Processing, Pattern matching, Document listing, Document retrieval, Succinct data structures, Repetitive text collections} }
Kathrin Hanauer, Christian Schulz, and Jonathan Trummer. O'Reach: Even Faster Reachability in Large Graphs. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 13:1-13:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{hanauer_et_al:LIPIcs.SEA.2021.13, author = {Hanauer, Kathrin and Schulz, Christian and Trummer, Jonathan}, title = {{O'Reach: Even Faster Reachability in Large Graphs}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {13:1--13:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.13}, URN = {urn:nbn:de:0030-drops-137856}, doi = {10.4230/LIPIcs.SEA.2021.13}, annote = {Keywords: Reachability, Static Graphs, Graph Algorithms, Reachability Index, Algorithm Engineering} }
Samantha Chen and Yusu Wang. Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 14:1-14:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chen_et_al:LIPIcs.SEA.2021.14, author = {Chen, Samantha and Wang, Yusu}, title = {{Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {14:1--14:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.14}, URN = {urn:nbn:de:0030-drops-137861}, doi = {10.4230/LIPIcs.SEA.2021.14}, annote = {Keywords: persistence diagrams, approximation algorithms, Wasserstein distance, optimal transport} }
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. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cazals_et_al:LIPIcs.SEA.2021.15, author = {Cazals, Fr\'{e}d\'{e}ric and Delmas, Bernard and O'Donnell, Timothee}, title = {{Fr\'{e}chet Mean and p-Mean on the Unit Circle: Decidability, Algorithm, and Applications to Clustering on the Flat Torus}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.15}, URN = {urn:nbn:de:0030-drops-137870}, doi = {10.4230/LIPIcs.SEA.2021.15}, annote = {Keywords: Frech\'{e}t mean, p-mean, circular statistics, decidability, robustness, multi-precision, angular spaces, flat torus, clustering, molecular conformations} }
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence. Multi-Level Weighted Additive Spanners. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 16:1-16:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ahmed_et_al:LIPIcs.SEA.2021.16, author = {Ahmed, Reyan and Bodwin, Greg and Sahneh, Faryad Darabi and Hamm, Keaton and Kobourov, Stephen and Spence, Richard}, title = {{Multi-Level Weighted Additive Spanners}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {16:1--16:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.16}, URN = {urn:nbn:de:0030-drops-137885}, doi = {10.4230/LIPIcs.SEA.2021.16}, annote = {Keywords: multi-level, graph spanner, approximation algorithms} }
Demian Hespe, Sebastian Lamm, and Christian Schorr. Targeted Branching for the Maximum Independent Set Problem. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 17:1-17:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{hespe_et_al:LIPIcs.SEA.2021.17, author = {Hespe, Demian and Lamm, Sebastian and Schorr, Christian}, title = {{Targeted Branching for the Maximum Independent Set Problem}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {17:1--17:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.17}, URN = {urn:nbn:de:0030-drops-137893}, doi = {10.4230/LIPIcs.SEA.2021.17}, annote = {Keywords: Graphs, Combinatorial Optimization, Independent Set, Vertex Cover, Clique, Branch-and-Reduce, Branch-and-Bound, Data Reduction} }
Valentin Buchhold and Dorothea Wagner. Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{buchhold_et_al:LIPIcs.SEA.2021.18, author = {Buchhold, Valentin and Wagner, Dorothea}, title = {{Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.18}, URN = {urn:nbn:de:0030-drops-137908}, doi = {10.4230/LIPIcs.SEA.2021.18}, annote = {Keywords: Nearest neighbors, points of interest, travel demand generation, radiation model, customizable contraction hierarchies} }
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. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 19:1-19:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{gianfrotta_et_al:LIPIcs.SEA.2021.19, author = {Gianfrotta, Coline and Reinharz, Vladimir and Barth, Dominique and Denise, Alain}, title = {{A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {19:1--19:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.19}, URN = {urn:nbn:de:0030-drops-137912}, doi = {10.4230/LIPIcs.SEA.2021.19}, annote = {Keywords: Graph similarity, clustering, RNA 3D folding, RNA motif} }
Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, and Evangelos Kosinas. Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{georgiadis_et_al:LIPIcs.SEA.2021.20, author = {Georgiadis, Loukas and Giannis, Konstantinos and Italiano, Giuseppe F. and Kosinas, Evangelos}, title = {{Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.20}, URN = {urn:nbn:de:0030-drops-137920}, doi = {10.4230/LIPIcs.SEA.2021.20}, annote = {Keywords: 2-Connectivity, Graph Algorithms, Split Components} }
Miki Hermann. How to Find the Exit from a 3-Dimensional Maze. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 21:1-21:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{hermann:LIPIcs.SEA.2021.21, author = {Hermann, Miki}, title = {{How to Find the Exit from a 3-Dimensional Maze}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {21:1--21:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.21}, URN = {urn:nbn:de:0030-drops-137934}, doi = {10.4230/LIPIcs.SEA.2021.21}, annote = {Keywords: Young tableaux, randomized algorithm, probabilistic algorithm} }
Thomas Bläsius, Tobias Friedrich, and Maximilian Katzmann. Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 22:1-22:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{blasius_et_al:LIPIcs.SEA.2021.22, author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Katzmann, Maximilian}, title = {{Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {22:1--22:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.22}, URN = {urn:nbn:de:0030-drops-137944}, doi = {10.4230/LIPIcs.SEA.2021.22}, annote = {Keywords: force-directed drawing algorithms, spring embedding, hyperbolic space} }
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. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 23:1-23:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{brodal_et_al:LIPIcs.SEA.2021.23, author = {Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Hammer, David and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung}, title = {{An Experimental Study of External Memory Algorithms for Connected Components}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {23:1--23:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.23}, URN = {urn:nbn:de:0030-drops-137958}, doi = {10.4230/LIPIcs.SEA.2021.23}, annote = {Keywords: Connected Components, Experimental Evaluation, External Memory, Graph Algorithms, Randomization} }