Table of Contents

• Ad-Hoc Affectance-Selective Families for Layer DisseminationHarshita Kudaravalli, Miguel A. Mosteiro. [doi]
• Engineering an Approximation Scheme for Traveling Salesman in Planar GraphsAmariah Becker, Eli Fox-Epstein, Philip N. Klein, David Meierfrankenfeld. [doi]
• Engineering Streaming AlgorithmsGraham Cormode. [doi]
• Better Process Mapping and Sparse Quadratic AssignmentChristian Schulz, Jesper Larsson Träff. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers [doi]
• Jdrasil: A Modular Library for Computing Tree DecompositionsMax Bannach, Sebastian Berndt, Thorsten Ehlers. [doi]
• The Isomap Algorithm in Distance GeometryLeo Liberti, Claudia D'Ambrosio. [doi]
• Faster Betweenness Centrality Updates in Evolving NetworksElisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe. [doi]
• Personal Routes with High-Dimensional Costs and Dynamic Approximation GuaranteesStefan Funke, Sören Laue, Sabine Storandt. [doi]
• Designing Energy-Efficient Heat Recovery Networks using Mixed-Integer Nonlinear OptimisationRadu Baltean-Lugojan, Christodoulos A. Floudas, Ruth Misener, Miten Mistry. [doi]
• Incremental Low-High Orders of Directed Graphs and ApplicationsLoukas Georgiadis, Giannis Konstantinos, Aikaterini Karanasiou, Luigi Laura. [doi]
• Fast and Scalable Minimal Perfect Hashing for Massive Key SetsAntoine Limasset, Guillaume Rizk, Rayan Chikhi, Pierre Peterlongo. [doi]
• Practical Range Minimum Queries RevisitedNiklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit. [doi]
• Online Construction of Wavelet TreesPaulo G. S. da Fonseca, Israel B. F. da Silva. [doi]
• Engineering External Memory LCP Array Construction: Parallel, In-Place and Large AlphabetJuha Kärkkäinen, Dominik Kempa. [doi]
• The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion ProcessDaniyah A. Aloqalaa, Jenny A. Hodgson, Prudence W. H. Wong. [doi]
• Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear MemoryManuel Penschuck. [doi]
• A Framework of Dynamic Data Structures for String ProcessingNicola Prezza. [doi]
• Dictionaries RevisitedMartin Farach-Colton. [doi]
• Graph Partitioning with Acyclicity ConstraintsOrlando Moreira, Merten Popp, Christian Schulz. [doi]
• Consumption Profiles in Route Planning for Electric Vehicles: Theory and ApplicationsMoritz Baum, Jonas Sauer, Dorothea Wagner, Tobias Zündorf. [doi]
• Extending Search Phases in the Micali-Vazirani AlgorithmMichael Huang, Clifford Stein. [doi]
• Distributed Domain PropagationRobert Lion Gottwald, Stephen J. Maher, Yuji Shinano. [doi]
• Compression with the tudocomp FrameworkPatrick Dinklage, Johannes Fischer 0001, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane. [doi]
• Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High OrdersLoukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou. [doi]
• Efficient Traffic Assignment for Public Transit NetworksLars Briem, Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, Dorothea Wagner, Tobias Zündorf. [doi]
• Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community StructureTobias Heuer, Sebastian Schlag. [doi]
• Fast Deterministic SelectionAndrei Alexandrescu. [doi]
• Efficient Algorithms for k-Regret Minimizing SetsPankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri. [doi]
• The Quantile Index - Succinct Self-Index for Top-k Document RetrievalNiklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit. [doi]
• Minimum Spanning Tree under Explorable Uncertainty in Theory and ExperimentsJacob Focke, Nicole Megow, Julie Meißner. [doi]
• Algorithm Engineering for All-Pairs Suffix-Prefix MatchingJihyuk Lim, Kunsoo Park. [doi]
• Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower EquilibriaNicola Basilico, Stefano Coniglio, Nicola Gatti 0001, Alberto Marchesi. [doi]
• On the Separation of Topology-Free Rank Inequalities for the Max Stable Set ProblemStefano Coniglio, Stefano Gualandi. [doi]