Invited speaker:Robert Bixby, Rice University

Session 1:Combinatorial optimization 1

Iain McBride, David F. Manlove, and Peter Biro. The Hospitals/Residents Problem with Couples: Complexity and Integer Programming Models

Samuel Rosat, Issmail Elhallaoui, François Soumis, and Andrea Lodi. Integral Simplex Using Decomposition with Primal Cuts

Martin Bergner, Marco Lübbecke, and Jonas Witt. A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs

David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth

Session 2: Data structures

Stephan Erb, Moritz Kobitzsch, and Peter Sanders. Parallel Bi-Objective Shortest Paths using Weight-Balanced B-Trees with Bulk Updates

Aapo Kyrola, Julian Shun, and Guy Blelloch. Beyond Synchronous Computation: New Techniques for External Memory Graph Algorithms

Ingo Müller, Peter Sanders, Robert Schulze, and Wei Zhou. Retrieval and Perfect Hashing using Fingerprinting

Jose Fuentes-Sepúlveda, Erick Elejalde, Leo Ferres, and Diego Seco. Efficient Wavelet Tree Construction and Querying for Multicore Architectures

Session 3: Graph drawing

Donatella Firmani, Giuseppe F. Italiano, and Marco Querini. Engineering Color Barcode Algorithms for Mobile Applications

Livio De La Cruz, Stephen Kobourov, Sergey Pupyrev, Paul S. Shen, and Sankar Veeramoni. Computing Consensus Curves

Andreas Gemsa, Martin Nöllenburg, and Ignaz Rutter. Evaluation of Labeling Strategies for Rotating Maps

Lukas Barth, Stephen Kobourov, and Sergey Pupyrev. Experimental Comparison of Semantic Word Clouds

Invited speaker:Jon Bentley, Avaya Labs Research

Selecting Data for Experiments: Past, Present and Future

Session 4: Shortest path

Daniel Delling, Andrew Goldberg, Ruslan Savchenko, and Renato Werneck. Hub Labels: Theory and Practice

Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable Contraction Hierarchies

Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci and Guido Proietti. Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

Luca Allulli, Giuseppe F. Italiano, and Federico Santaroni. Exploiting GPS Data in Public Transport Journey Planners

Session 5: Combinatorial optimization 2"

Maurício J. O. Zambon, Pedro J. de Rezende, and Cid C. de Souza. An Exact Algorithm for the Chromatic Art Gallery Problem

Attila Bernath, Krzysztof Ciebiera, Piotr Godlewski, and Piotr Sankowski. Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem

Sven O. Krumke, Alain Quilliot, Annegret Wagler, and Jan-Thierry Wegener. Relocation in Carsharing Systems using Flows in Time-Expanded Networks

Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves. Dynamic Windows Scheduling with Reallocations

Session 6: String algorithms

Tamanna Chhabra and Jorma Tarhio. Order-Preserving Matching with Filtration

Tommi Hirvola and Jorma Tarhio. Approximate Online Matching of Circular Strings

Simon Gog, Timo Beller, Alistair Moffat, and Matthias Petri. From Theory to Practice: Plug and Play with Succinct Data Structures

Yoshimasa Takabatake, Yasuo Tabei, and Hiroshi Sakamoto. Improved ESP-Index: A Practical Self-Index for Highly Repetitive Texts

Session 7: Data structures

David Eppstein, Michael Goodrich, Michael Mitzenmacher, and Paweł Pszona. Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket

Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, and Robert Tarjan. Loop Nesting Forests, Dominators, and Applications

Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-Ichi Minato, and Kunihiko Sadakane. DenseZDD: A Compact and Fast Index for Families of Sets

Noy Rotbart, Marcos Vaz Salles, and Iasonas Zotos. An Evaluation of Dynamic Labeling Schemes for Tree Networks

Session 8: Graph algorithms

Henning Meyerhenke, Peter Sanders, and Christian Schulz. Partitioning Complex Networks via Size-constrained Clustering

Roland Glantz, Henning Meyerhenke, and Christian Schulz. Tree-based Coarsening and Partitioning of Complex Networks

Sepp Hartung, Clemens Hoffmann, and André Nichterlein. Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks

Yasuaki Kobayashi, Keita Komuro, and Hisao Tamaki. Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study

Session 9: Suffix structures

Jesper Larsson, Kasper Fuglsang, and Kenneth Karlsson. Efficient Representation for Online Suffix Tree Construction

Juha Kärkkäinen and Dominik Kempa. LCP Array Construction in External Memory

Gonzalo Navarro and Alberto Ordóñez Pereira. Faster Compressed Suffix Trees for Repetitive Text Collections

Simon Gog and Gonzalo Navarro. Improved and Extended locating Functionality on Compressed Suffix Arrays