LIPIcs, Volume 103, SEA 2018

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