<h2>LIPIcs, Volume 75, SEA 2017</h2>
<ul>
<li>
<span class="authors">Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, and Rajeev Raman</span>
<span class="title">LIPIcs, Volume 75, SEA'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017">10.4230/LIPIcs.SEA.2017</a>
</li>
<li>
<span class="authors">Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, and Rajeev Raman</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.0">10.4230/LIPIcs.SEA.2017.0</a>
</li>
<li>
<span class="authors">Radu Baltean-Lugojan, Christodoulos A. Floudas, Ruth Misener, and Miten Mistry</span>
<span class="title">Designing Energy-Efficient Heat Recovery Networks using Mixed-Integer Nonlinear Optimisation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.1">10.4230/LIPIcs.SEA.2017.1</a>
</li>
<li>
<span class="authors">Martin Farach-Colton</span>
<span class="title">Dictionaries Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.2">10.4230/LIPIcs.SEA.2017.2</a>
</li>
<li>
<span class="authors">Graham Cormode</span>
<span class="title">Engineering Streaming Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.3">10.4230/LIPIcs.SEA.2017.3</a>
</li>
<li>
<span class="authors">Christian Schulz and Jesper Larsson Träff</span>
<span class="title">Better Process Mapping and Sparse Quadratic Assignment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.4">10.4230/LIPIcs.SEA.2017.4</a>
</li>
<li>
<span class="authors">Leo Liberti and Claudia D'Ambrosio</span>
<span class="title">The Isomap Algorithm in Distance Geometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.5">10.4230/LIPIcs.SEA.2017.5</a>
</li>
<li>
<span class="authors">Robert Lion Gottwald, Stephen J. Maher, and Yuji Shinano</span>
<span class="title">Distributed Domain Propagation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.6">10.4230/LIPIcs.SEA.2017.6</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, and Subhash Suri</span>
<span class="title">Efficient Algorithms for k-Regret Minimizing Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.7">10.4230/LIPIcs.SEA.2017.7</a>
</li>
<li>
<span class="authors">Amariah Becker, Eli Fox-Epstein, Philip N. Klein, and David Meierfrankenfeld</span>
<span class="title">Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.8">10.4230/LIPIcs.SEA.2017.8</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Giuseppe F. Italiano, and Aikaterini Karanasiou</span>
<span class="title">Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.9">10.4230/LIPIcs.SEA.2017.9</a>
</li>
<li>
<span class="authors">Michael Huang and Clifford Stein</span>
<span class="title">Extending Search Phases in the Micali-Vazirani Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.10">10.4230/LIPIcs.SEA.2017.10</a>
</li>
<li>
<span class="authors">Nicola Prezza</span>
<span class="title">A Framework of Dynamic Data Structures for String Processing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.11">10.4230/LIPIcs.SEA.2017.11</a>
</li>
<li>
<span class="authors">Niklas Baumstark, Simon Gog, Tobias Heuer, and Julian Labeit</span>
<span class="title">Practical Range Minimum Queries Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.12">10.4230/LIPIcs.SEA.2017.12</a>
</li>
<li>
<span class="authors">Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, and Kunihiko Sadakane</span>
<span class="title">Compression with the tudocomp Framework</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.13">10.4230/LIPIcs.SEA.2017.13</a>
</li>
<li>
<span class="authors">Jihyuk Lim and Kunsoo Park</span>
<span class="title">Algorithm Engineering for All-Pairs Suffix-Prefix Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.14">10.4230/LIPIcs.SEA.2017.14</a>
</li>
<li>
<span class="authors">Niklas Baumstark, Simon Gog, Tobias Heuer, and Julian Labeit</span>
<span class="title">The Quantile Index - Succinct Self-Index for Top-k Document Retrieval</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.15">10.4230/LIPIcs.SEA.2017.15</a>
</li>
<li>
<span class="authors">Paulo G. S. da Fonseca and Israel B. F. da Silva</span>
<span class="title">Online Construction of Wavelet Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.16">10.4230/LIPIcs.SEA.2017.16</a>
</li>
<li>
<span class="authors">Juha Kärkkäinen and Dominik Kempa</span>
<span class="title">Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.17">10.4230/LIPIcs.SEA.2017.17</a>
</li>
<li>
<span class="authors">Stefan Funke, Sören Laue, and Sabine Storandt</span>
<span class="title">Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.18">10.4230/LIPIcs.SEA.2017.18</a>
</li>
<li>
<span class="authors">Moritz Baum, Jonas Sauer, Dorothea Wagner, and Tobias Zündorf</span>
<span class="title">Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.19">10.4230/LIPIcs.SEA.2017.19</a>
</li>
<li>
<span class="authors">Lars Briem, Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, Dorothea Wagner, and Tobias Zündorf</span>
<span class="title">Efficient Traffic Assignment for Public Transit Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.20">10.4230/LIPIcs.SEA.2017.20</a>
</li>
<li>
<span class="authors">Tobias Heuer and Sebastian Schlag</span>
<span class="title">Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.21">10.4230/LIPIcs.SEA.2017.21</a>
</li>
<li>
<span class="authors">Jacob Focke, Nicole Megow, and Julie Meißner</span>
<span class="title">Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.22">10.4230/LIPIcs.SEA.2017.22</a>
</li>
<li>
<span class="authors">Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, and Arie Slobbe</span>
<span class="title">Faster Betweenness Centrality Updates in Evolving Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.23">10.4230/LIPIcs.SEA.2017.23</a>
</li>
<li>
<span class="authors">Andrei Alexandrescu</span>
<span class="title">Fast Deterministic Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.24">10.4230/LIPIcs.SEA.2017.24</a>
</li>
<li>
<span class="authors">Antoine Limasset, Guillaume Rizk, Rayan Chikhi, and Pierre Peterlongo</span>
<span class="title">Fast and Scalable Minimal Perfect Hashing for Massive Key Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.25">10.4230/LIPIcs.SEA.2017.25</a>
</li>
<li>
<span class="authors">Manuel Penschuck</span>
<span class="title">Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.26">10.4230/LIPIcs.SEA.2017.26</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou, and Luigi Laura</span>
<span class="title">Incremental Low-High Orders of Directed Graphs and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.27">10.4230/LIPIcs.SEA.2017.27</a>
</li>
<li>
<span class="authors">Max Bannach, Sebastian Berndt, and Thorsten Ehlers</span>
<span class="title">Jdrasil: A Modular Library for Computing Tree Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.28">10.4230/LIPIcs.SEA.2017.28</a>
</li>
<li>
<span class="authors">Stefano Coniglio and Stefano Gualandi</span>
<span class="title">On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.29">10.4230/LIPIcs.SEA.2017.29</a>
</li>
<li>
<span class="authors">Orlando Moreira, Merten Popp, and Christian Schulz</span>
<span class="title">Graph Partitioning with Acyclicity Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.30">10.4230/LIPIcs.SEA.2017.30</a>
</li>
<li>
<span class="authors">Nicola Basilico, Stefano Coniglio, Nicola Gatti, and Alberto Marchesi</span>
<span class="title">Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.31">10.4230/LIPIcs.SEA.2017.31</a>
</li>
<li>
<span class="authors">Daniyah A. Aloqalaa, Jenny A. Hodgson, and Prudence W. H. Wong</span>
<span class="title">The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion Process</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.32">10.4230/LIPIcs.SEA.2017.32</a>
</li>
<li>
<span class="authors">Harshita Kudaravalli and Miguel A. Mosteiro</span>
<span class="title">Ad-Hoc Affectance-Selective Families for Layer Dissemination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2017.33">10.4230/LIPIcs.SEA.2017.33</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