<h2>LIPIcs, Volume 160, SEA 2020</h2>
<ul>
<li>
<span class="authors">Simone Faro and Domenico Cantone</span>
<span class="title">LIPIcs, Volume 160, SEA 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020">10.4230/LIPIcs.SEA.2020</a>
</li>
<li>
<span class="authors">Simone Faro and Domenico Cantone</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.0">10.4230/LIPIcs.SEA.2020.0</a>
</li>
<li>
<span class="authors">Martin Aumüller</span>
<span class="title">Algorithm Engineering for High-Dimensional Similarity Search Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.1">10.4230/LIPIcs.SEA.2020.1</a>
</li>
<li>
<span class="authors">Stefan Edelkamp</span>
<span class="title">Algorithm Engineering for Sorting and Searching, and All That (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.2">10.4230/LIPIcs.SEA.2020.2</a>
</li>
<li>
<span class="authors">Nicola Prezza</span>
<span class="title">Indexing Compressed Text: A Tale of Time and Space (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.3">10.4230/LIPIcs.SEA.2020.3</a>
</li>
<li>
<span class="authors">Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, and Christian Schulz</span>
<span class="title">High-Quality Hierarchical Process Mapping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.4">10.4230/LIPIcs.SEA.2020.4</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, and Cynthia A. Phillips</span>
<span class="title">Probing a Set of Trajectories to Maximize Captured Information</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.5">10.4230/LIPIcs.SEA.2020.5</a>
</li>
<li>
<span class="authors">Kotaro Matsuda, Shuhei Denzumi, and Kunihiko Sadakane</span>
<span class="title">Storing Set Families More Compactly with Top ZDDs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.6">10.4230/LIPIcs.SEA.2020.6</a>
</li>
<li>
<span class="authors">Dominik Köppl, Simon J. Puglisi, and Rajeev Raman</span>
<span class="title">Fast and Simple Compact Hashing via Bucketing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.7">10.4230/LIPIcs.SEA.2020.7</a>
</li>
<li>
<span class="authors">Daniel Berend and Yochai Twitto</span>
<span class="title">Effect of Initial Assignment on Local Search Performance for Max Sat</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.8">10.4230/LIPIcs.SEA.2020.8</a>
</li>
<li>
<span class="authors">Yu Nakahata, Masaaki Nishino, Jun Kawahara, and Shin-ichi Minato</span>
<span class="title">Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.9">10.4230/LIPIcs.SEA.2020.9</a>
</li>
<li>
<span class="authors">Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, and Sven Zühlsdorf</span>
<span class="title">Engineering Exact Quasi-Threshold Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.10">10.4230/LIPIcs.SEA.2020.10</a>
</li>
<li>
<span class="authors">Lars Gottesbüren, Michael Hamann, Sebastian Schlag, and Dorothea Wagner</span>
<span class="title">Advanced Flow-Based Multilevel Hypergraph Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.11">10.4230/LIPIcs.SEA.2020.11</a>
</li>
<li>
<span class="authors">Zsuzsanna Lipták, Simon J. Puglisi, and Massimiliano Rossi</span>
<span class="title">Pattern Discovery in Colored Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.12">10.4230/LIPIcs.SEA.2020.12</a>
</li>
<li>
<span class="authors">Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, and Ayumi Shinohara</span>
<span class="title">Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.13">10.4230/LIPIcs.SEA.2020.13</a>
</li>
<li>
<span class="authors">Kathrin Hanauer, Monika Henzinger, and Christian Schulz</span>
<span class="title">Faster Fully Dynamic Transitive Closure in Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.14">10.4230/LIPIcs.SEA.2020.14</a>
</li>
<li>
<span class="authors">Tobias Maier, Peter Sanders, and Robert Williger</span>
<span class="title">Concurrent Expandable AMQs on the Basis of Quotient Filters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.15">10.4230/LIPIcs.SEA.2020.15</a>
</li>
<li>
<span class="authors">Jonas Sauer, Dorothea Wagner, and Tobias Zündorf</span>
<span class="title">Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.16">10.4230/LIPIcs.SEA.2020.16</a>
</li>
<li>
<span class="authors">Alexander Kleff, Frank Schulz, Jakob Wagenblatt, and Tim Zeitz</span>
<span class="title">Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.17">10.4230/LIPIcs.SEA.2020.17</a>
</li>
<li>
<span class="authors">Ali Al Zoobi, David Coudert, and Nicolas Nisse</span>
<span class="title">Space and Time Trade-Off for the k Shortest Simple Paths Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.18">10.4230/LIPIcs.SEA.2020.18</a>
</li>
<li>
<span class="authors">James Trimble</span>
<span class="title">An Algorithm for the Exact Treedepth Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.19">10.4230/LIPIcs.SEA.2020.19</a>
</li>
<li>
<span class="authors">Frances Cooper and David Manlove</span>
<span class="title">Algorithms for New Types of Fair Stable Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.20">10.4230/LIPIcs.SEA.2020.20</a>
</li>
<li>
<span class="authors">Dmytro Antypov, Argyrios Deligkas, Vladimir Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, and Michail Theofilatos</span>
<span class="title">Crystal Structure Prediction via Oblivious Local Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.21">10.4230/LIPIcs.SEA.2020.21</a>
</li>
<li>
<span class="authors">Kengo Nakamura, Shuhei Denzumi, and Masaaki Nishino</span>
<span class="title">Variable Shift SDD: A More Succinct Sentential Decision Diagram</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.22">10.4230/LIPIcs.SEA.2020.22</a>
</li>
<li>
<span class="authors">Elias Kuthe and Sven Rahmann</span>
<span class="title">Engineering Fused Lasso Solvers on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.23">10.4230/LIPIcs.SEA.2020.23</a>
</li>
<li>
<span class="authors">Roberto Grossi, Andrea Marino, and Shima Moghtasedi</span>
<span class="title">Finding Structurally and Temporally Similar Trajectories in Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.24">10.4230/LIPIcs.SEA.2020.24</a>
</li>
<li>
<span class="authors">Lukas Barth and Dorothea Wagner</span>
<span class="title">Zipping Segment Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.25">10.4230/LIPIcs.SEA.2020.25</a>
</li>
<li>
<span class="authors">Valentin Buchhold, Daniel Delling, Dennis Schieferdecker, and Michael Wegner</span>
<span class="title">Fast and Stable Repartitioning of Road Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.26">10.4230/LIPIcs.SEA.2020.26</a>
</li>
<li>
<span class="authors">Meng He and Serikzhan Kazi</span>
<span class="title">Path Query Data Structures in Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2020.27">10.4230/LIPIcs.SEA.2020.27</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