Abstract is missing.
- Parallel Construction of Succinct TreesLeo Ferres, José Fuentes Sepúlveda, Meng He, Norbert Zeh. 3-14 [doi]
- Tree Compression with Top Trees RevisitedLorenz Hübschle-Schneider, Rajeev Raman. 15-27 [doi]
- A Bulk-Parallel Priority Queue in External Memory with STXXLTimo Bingmann, Thomas Keh, Peter Sanders. 28-40 [doi]
- Greedily Improving Our Own Centrality in A NetworkPierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj. 43-55 [doi]
- An Exact Algorithm for Diameters of Large Real Directed GraphsTakuya Akiba, Yoichi Iwata, Yuki Kawata. 56-67 [doi]
- Graph Partitioning for Independent SetsSebastian Lamm, Peter Sanders, Christian Schulz 0003. 68-81 [doi]
- Finding Connected Subgraphs of Fixed Minimum Density: Implementation and ExperimentsChristian Komusiewicz, Manuel Sorge, Kolja Stahl. 82-93 [doi]
- On the Generation of Cutting Planes which Maximize the Bound ImprovementStefano Coniglio, Martin Tieves. 97-109 [doi]
- Separation of Generic Cutting Planes in Branch-and-Price Using a BasisMarco E. Lübbecke, Jonas T. Witt. 110-121 [doi]
- On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-SpaceClaudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske. 122-133 [doi]
- Scheduling MapReduce Jobs and Data Shuffle on Unrelated ProcessorsDimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Emmanouil Zampetakis, Georgios Zois. 137-150 [doi]
- Station Assignment with ReallocationMiguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong. 151-164 [doi]
- Online Knapsack of Unknown Capacity: - Energy Optimization for Smartphone CommunicationsDaniele Diodati, Alfredo Navarra, Cristina M. Pinotti. 165-177 [doi]
- Reoptimization Techniques for MIP SolversGerald Gamrath, Benjamin Hiller, Jakob Witzig. 181-192 [doi]
- Submodular Minimization in the Context of Modern LP and MILP Methods and SolversAndrew Orso, Jon Lee, Siqian Shen. 193-204 [doi]
- Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian SolverDaniel Hoske, Dimitar Lukarski, Henning Meyerhenke, Michael Wegner. 205-218 [doi]
- Efficient and Practical Tree Preconditioning for Solving Laplacian SystemsLuca Castelli Aleardi, Alexandre Nolin, Maks Ovsjanikov. 219-231 [doi]
- Efficient Generation of Stable Planar Cages for ChemistryDominique Barth, Olivier David, Franck Quessette, Vincent Reinhard, Yann Strozecki, Sandrine Vial. 235-246 [doi]
- Accurate and Efficient Methods to Improve Multiple Circular Sequence AlignmentCarl Barton, Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis, Ahmad Retha, Fatima Vayani. 247-258 [doi]
- Solving k-means on High-Dimensional Big DataJan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt 0001. 259-270 [doi]
- Public Transit LabelingDaniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck. 273-285 [doi]
- On Balanced Separators in Road NetworksAaron Schild, Christian Sommer. 286-297 [doi]
- SALT. A Unified Framework for All Shortest-Path Query Variants on Road NetworksAlexandros Efentakis, Dieter Pfoser, Yannis Vassiliou. 298-311 [doi]
- Huffman Codes versus Augmented Non-Prefix-Free CodesBoran Adas, Ersin Bayraktar, M. Oguzhan Külekci. 315-326 [doi]
- Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with GapsRiku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen. 327-338 [doi]
- An Empirical Study of Finding Approximate Equilibria in Bimatrix GamesJohn Fearnley, Tobenna Peter Igwe, Rahul Savani. 339-351 [doi]
- The Effect of Almost-Empty Faces on Planar Kandinsky DrawingsMichael A. Bekos, Michael Kaufmann 0001, Robert Krug 0001, Martin Siebenhaller. 352-364 [doi]
- An Experimental Analysis of a Polynomial Compression for the Steiner Cycle ProblemStefan Fafianie, Stefan Kratsch. 367-378 [doi]
- On the Quadratic Shortest Path ProblemBorzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim. 379-390 [doi]
- A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree DecompositionsThomas Bosman. 391-402 [doi]