LIPIcs, Volume 75, SEA 2017

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