<h2>LIPIcs, Volume 103, SEA 2018</h2>
<ul>
<li>
<span class="authors">Gianlorenzo D'Angelo</span>
<span class="title">LIPIcs, Volume 103, SEA'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018">10.4230/LIPIcs.SEA.2018</a>
</li>
<li>
<span class="authors">Gianlorenzo D'Angelo</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.0">10.4230/LIPIcs.SEA.2018.0</a>
</li>
<li>
<span class="authors">Tobias Heuer, Peter Sanders, and Sebastian Schlag</span>
<span class="title">Network Flow-Based Refinement for Multilevel Hypergraph Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.1">10.4230/LIPIcs.SEA.2018.1</a>
</li>
<li>
<span class="authors">Ruslan Shaydulin and Ilya Safro</span>
<span class="title">Aggregative Coarsening for Multilevel Hypergraph Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.2">10.4230/LIPIcs.SEA.2018.2</a>
</li>
<li>
<span class="authors">Sonja Biedermann, Monika Henzinger, Christian Schulz, and Bernhard Schuster</span>
<span class="title">Memetic Graph Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.3">10.4230/LIPIcs.SEA.2018.3</a>
</li>
<li>
<span class="authors">Alexandra Henzinger, Alexander Noe, and Christian Schulz</span>
<span class="title">ILP-based Local Search for Graph Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.4">10.4230/LIPIcs.SEA.2018.4</a>
</li>
<li>
<span class="authors">Kosuke Matsumoto, Kohei Hatano, and Eiji Takimoto</span>
<span class="title">Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.5">10.4230/LIPIcs.SEA.2018.5</a>
</li>
<li>
<span class="authors">Nafiseh Sedaghat, Tamon Stephen, and Leonid Chindelevitch</span>
<span class="title">Speeding up Dualization in the Fredman-Khachiyan Algorithm B</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.6">10.4230/LIPIcs.SEA.2018.6</a>
</li>
<li>
<span class="authors">M. Oguzhan Külekci</span>
<span class="title">An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.7">10.4230/LIPIcs.SEA.2018.7</a>
</li>
<li>
<span class="authors">Frances Cooper and David Manlove</span>
<span class="title">A 3/2-Approximation Algorithm for the Student-Project Allocation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.8">10.4230/LIPIcs.SEA.2018.8</a>
</li>
<li>
<span class="authors">Krishnapriya A M, Meghana Nasre, Prajakta Nimbhorkar, and Amit Rawat</span>
<span class="title">How Good Are Popular Matchings?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.9">10.4230/LIPIcs.SEA.2018.9</a>
</li>
<li>
<span class="authors">Katerina Altmanová, Dusan Knop, and Martin Koutecký</span>
<span class="title">Evaluating and Tuning n-fold Integer Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.10">10.4230/LIPIcs.SEA.2018.10</a>
</li>
<li>
<span class="authors">Michael Bastubbe, Marco E. Lübbecke, and Jonas T. Witt</span>
<span class="title">A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.11">10.4230/LIPIcs.SEA.2018.11</a>
</li>
<li>
<span class="authors">Krzysztof Kiljan and Marcin Pilipczuk</span>
<span class="title">Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.12">10.4230/LIPIcs.SEA.2018.12</a>
</li>
<li>
<span class="authors">Kazuya Haraguchi</span>
<span class="title">An Efficient Local Search for the Minimum Independent Dominating Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.13">10.4230/LIPIcs.SEA.2018.13</a>
</li>
<li>
<span class="authors">Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, and Sebastian Siebertz</span>
<span class="title">Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.14">10.4230/LIPIcs.SEA.2018.14</a>
</li>
<li>
<span class="authors">Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, and Alexander Wolff</span>
<span class="title">Multi-Level Steiner Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.15">10.4230/LIPIcs.SEA.2018.15</a>
</li>
<li>
<span class="authors">Solon P. Pissis and Ahmad Retha</span>
<span class="title">Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.16">10.4230/LIPIcs.SEA.2018.16</a>
</li>
<li>
<span class="authors">Djamal Belazzougui, Fabio Cunial, and Olgert Denas</span>
<span class="title">Fast matching statistics in small space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.17">10.4230/LIPIcs.SEA.2018.17</a>
</li>
<li>
<span class="authors">Bastien Cazaux, Samuel Juhel, and Eric Rivals</span>
<span class="title">Practical lower and upper bounds for the Shortest Linear Superstring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.18">10.4230/LIPIcs.SEA.2018.18</a>
</li>
<li>
<span class="authors">Jean-François Baffier, Yago Diez, and Matias Korman</span>
<span class="title">Experimental Study of Compressed Stack Algorithms in Limited Memory Environments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.19">10.4230/LIPIcs.SEA.2018.19</a>
</li>
<li>
<span class="authors">Martin Wilhelm</span>
<span class="title">Restructuring Expression Dags for Efficient Parallelization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.20">10.4230/LIPIcs.SEA.2018.20</a>
</li>
<li>
<span class="authors">Yu Nakahata, Jun Kawahara, and Shoji Kasahara</span>
<span class="title">Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.21">10.4230/LIPIcs.SEA.2018.21</a>
</li>
<li>
<span class="authors">Markus Chimani, Ivo Hedtke, and Tilo Wiedera</span>
<span class="title">Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.22">10.4230/LIPIcs.SEA.2018.22</a>
</li>
<li>
<span class="authors">Shixun Huang, Zhifeng Bao, J. Shane Culpepper, Ping Zhang, and Bang Zhang</span>
<span class="title">A Linear-Time Algorithm for Finding Induced Planar Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.23">10.4230/LIPIcs.SEA.2018.23</a>
</li>
<li>
<span class="authors">Luca Castelli Aleardi, Gaspard Denis, and Éric Fusy</span>
<span class="title">Fast Spherical Drawing of Triangulations: An Experimental Study of Graph Drawing Tools</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.24">10.4230/LIPIcs.SEA.2018.24</a>
</li>
<li>
<span class="authors">Sahar Bsaybes, Alain Quilliot, and Annegret K. Wagler</span>
<span class="title">Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.25">10.4230/LIPIcs.SEA.2018.25</a>
</li>
<li>
<span class="authors">Vinicius N. G. Pereira, Mário César San Felice, Pedro Henrique D. B. Hokama, and Eduardo C. Xavier</span>
<span class="title">The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.26">10.4230/LIPIcs.SEA.2018.26</a>
</li>
<li>
<span class="authors">Valentin Buchhold, Peter Sanders, and Dorothea Wagner</span>
<span class="title">Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.27">10.4230/LIPIcs.SEA.2018.27</a>
</li>
<li>
<span class="authors">Petteri Kaski, Juho Lauri, and Suhas Thejaswi</span>
<span class="title">Engineering Motif Search for Large Motifs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.28">10.4230/LIPIcs.SEA.2018.28</a>
</li>
<li>
<span class="authors">Michal Ziobro and Marcin Pilipczuk</span>
<span class="title">Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.29">10.4230/LIPIcs.SEA.2018.29</a>
</li>
<li>
<span class="authors">Adolfo Piperno</span>
<span class="title">Isomorphism Test for Digraphs with Weighted Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2018.30">10.4230/LIPIcs.SEA.2018.30</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