Practical Variable Length Gap Pattern Matching .................. 1
Johannes Bader, Simon Gog, and Matthias Petri
Fast Exact Computation of Isochrones in Road Networks .......... 17
Moritz Baum, Valentin Buchhold, Julian Dibbelt, and
Dorothea Wagner
Dynamic Time-Dependent Route Planning in Road Networks with
User Preferences ............................................... 33
Moritz Baum, Julian Dibbelt, Thomas Pajor, and Dorothea
Wagner
UKP5: A New Algorithm for the Unbounded Knapsack
Problem ........................................................ 50
Henrique Becker and Luciana S. Buriol
Lempel-Ziv Decoding in External Memory ......................... 63
Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, and
Simon J. Puglisi
A Practical Method for the Minimum Genus of a Graph: Models
and Experiments ................................................ 75
Stephan Beyer, Markus Chimani, Ivo Hedtke, and Michal
Kotrbčík
Compact Flow Diagrams for State Sequences ...................... 89
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael
Horton, and Stef Sijben
Practical Dynamic Entropy-Compressed Bitvectors with
Applications .................................................. 105
Joshimar Cordova and Gonzalo Navarro
Accelerating Local Search for the Maximum Independent Set
Problem ....................................................... 118
Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian
Schulz, Darren Strash, and Renato F. Werneck
Computing Nonsimple Polygons of Minimum Perimeter ............. 134
Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael
Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian
Maurer, Joseph S.B. Mitchell, Arne Schmidt, Christiane
Schmidt, and Julian Troegel
Sparse Subgraphs for 2-Connectivity in Directed Graphs ........ 150
Loukas Georgiadis, Giuseppe F. ltaliano, Aikaterini
Karanasiou, Charts Papadopoulos, and Nikos Parotsidis
Worst-Case-Efficient Dynamic Arrays in Practice ............... 167
Jyrki Katajainen
On the Solution of Circulant Weighing Matrices Problems
Using Algorithm Portfolios on Multi-core Processors ........... 184
Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos
E. Parsopoulos, and Dimitris Souravlias
Engineering Hybrid DenseZDDs .................................. 201
Taito Lee, Shuhei Denzumi, and Kunihiko Sadakane
Steiner Tree Heuristic in the Euclidean d-Space Using
Bottleneck Distances .......................................... 217
Stepfian S. Lorenzen and Pawel Winter
Tractable Pathfinding for the Stochastic On-Time Arrival
Problem ....................................................... 231
Mehrdad Niknami and Samitha Samaranayake
An Experimental Evaluation of Fast Approximation Algorithms
for the Maximum Satisfiability Problem ........................ 246
Matthias Poloczek and David P. Williamson
Experimental Analysis of Algorithms for Coflow Scheduling ..... 262
Zhen Qiu, Clifford Stein, and Yuan Zhong
An Empirical Study of Online Packet Scheduling Algorithms ..... 278
Nourhan Sakr and Cliff Stein
Advanced Multilevel Node Separator Algorithms ................. 294
Peter Sanders and Christian Schulz
A Merging Heuristic for the Rectangle Decomposition of
Binary Matrices ............................................... 310
Julien Subercaze, Christophe Gravier, and Pierre-Olivier
Rocher
CHICO: A Compressed Hybrid Index for Repetitive Collections ... 326
Daniel Valenzuela
Fast Scalable Construction of (Minimal Perfect Hash)
Functions ..................................................... 339
Marco Genuzio, Giuseppe Ottaviano, and Sebastiane Vigna
Better Partitions of Protein Graphs for Subsystem Quantum
Chemistry ..................................................... 353
Moritz von Looz, Mario Wolter, Christoph R. Jacob, and
Henning Meyerhenke
Online Algorithm for Approximate Quantile Queries on Sliding
Windows ....................................................... 369
Chun-Nam Yu, Michael Crouch, Ruichuan Chen, and
Alessandra Sala
Author Index .................................................. 385
|
