Abstract is missing.
- Erratum: Customizable Contraction HierarchiesJulian Dibbelt, Ben Strasser, Dorothea Wagner. [doi]
- Selecting Data for Experiments: Past, Present and FutureJon Bentley. 1-9 [doi]
- The Hospitals / Residents Problem with Couples: Complexity and Integer Programming ModelsPéter Biró, David F. Manlove, Iain McBride. 10-21 [doi]
- Integral Simplex Using Decomposition with Primal CutsSamuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi. 22-33 [doi]
- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected GraphsMartin Bergner, Marco E. Lübbecke, Jonas T. Witt. 34-45 [doi]
- Experimental Evaluation of a Branch and Bound Algorithm for Computing PathwidthDavid Coudert, Dorian Mazauric, Nicolas Nisse. 46-58 [doi]
- An Exact Algorithm for the Discrete Chromatic Art Gallery ProblemMaurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza. 59-73 [doi]
- Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree ProblemAttila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski. 74-86 [doi]
- Relocation in Carsharing Systems Using Flows in Time-Expanded NetworksSven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener. 87-98 [doi]
- Dynamic Windows Scheduling with ReallocationMartin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves. 99-110 [doi]
- Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk UpdatesStephan Erb, Moritz Kobitzsch, Peter Sanders. 111-122 [doi]
- Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning ForestAapo Kyrola, Julian Shun, Guy E. Blelloch. 123-137 [doi]
- Retrieval and Perfect Hashing Using FingerprintingIngo Müller 0002, Peter Sanders, Robert Schulze, Wei Zhou. 138-149 [doi]
- Efficient Wavelet Tree Construction and Querying for Multicore ArchitecturesJose Fuentes Sepúlveda, Erick Elejalde, Leo Ferres, Diego Seco. 150-161 [doi]
- Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One BasketDavid Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona. 162-173 [doi]
- Loop Nesting Forests, Dominators, and ApplicationsLoukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan. 174-186 [doi]
- DenseZDD: A Compact and Fast Index for Families of SetsShuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane. 187-198 [doi]
- An Evaluation of Dynamic Labeling Schemes for Tree NetworksNoy Rotbart, Marcos Vaz Salles, Iasonas Zotos. 199-210 [doi]
- Engineering Color Barcode Algorithms for Mobile ApplicationsDonatella Firmani, Giuseppe F. Italiano, Marco Querini. 211-222 [doi]
- Computing Consensus CurvesLivio De La Cruz, Stephen G. Kobourov, Sergey Pupyrev, Paul S. Shen, Sankar Veeramoni. 223-234 [doi]
- Evaluation of Labeling Strategies for Rotating MapsAndreas Gemsa, Martin Nöllenburg, Ignaz Rutter. 235-246 [doi]
- Experimental Comparison of Semantic Word CloudsLukas Barth, Stephen G. Kobourov, Sergey Pupyrev. 247-258 [doi]
- Hub Labels: Theory and PracticeDaniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck. 259-270 [doi]
- Customizable Contraction HierarchiesJulian Dibbelt, Ben Strasser, Dorothea Wagner. 271-282 [doi]
- Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous BatchesAnnalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti. 283-294 [doi]
- Exploiting GPS Data in Public Transport Journey PlannersLuca Allulli, Giuseppe F. Italiano, Federico Santaroni. 295-306 [doi]
- Order-Preserving Matching with FiltrationTommi Hirvola, Jorma Tarhio. 307-314 [doi]
- Approximate Online Matching of Circular StringsTommi Hirvola, Jorma Tarhio. 315-325 [doi]
- From Theory to Practice: Plug and Play with Succinct Data StructuresSimon Gog, Timo Beller, Alistair Moffat, Matthias Petri. 326-337 [doi]
- Improved ESP-index: A Practical Self-index for Highly Repetitive TextsYoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto. 338-350 [doi]
- Partitioning Complex Networks via Size-Constrained ClusteringHenning Meyerhenke, Peter Sanders, Christian Schulz. 351-363 [doi]
- Tree-Based Coarsening and Partitioning of Complex NetworksRoland Glantz, Henning Meyerhenke, Christian Schulz. 364-375 [doi]
- Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social NetworksSepp Hartung, Clemens Hoffmann, André Nichterlein. 376-387 [doi]
- Search Space Reduction through Commitments in Pathwidth Computation: An Experimental StudyYasuaki Kobayashi, Keita Komuro, Hisao Tamaki. 388-399 [doi]
- Efficient Representation for Online Suffix Tree ConstructionN. Jesper Larsson, Kasper Fuglsang, Kenneth Karlsson. 400-411 [doi]
- LCP Array Construction in External MemoryJuha Kärkkäinen, Dominik Kempa. 412-423 [doi]
- Faster Compressed Suffix Trees for Repetitive Text CollectionsGonzalo Navarro, Alberto Ordóñez Pereira. 424-435 [doi]
- Improved and Extended Locating Functionality on Compressed Suffix ArraysSimon Gog, Gonzalo Navarro. 436-447 [doi]