Abstract is missing.
- Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel MachinesMartin Skutella. 1-3 [doi]
- The Hub Labeling AlgorithmAndrew V. Goldberg. 4 [doi]
- Design of Practical Succinct Data Structures for Large Data CollectionsRoberto Grossi, Giuseppe Ottaviano. 5-17 [doi]
- Hub Label CompressionDaniel Delling, Andrew V. Goldberg, Renato F. Werneck. 18-29 [doi]
- Faster Customization of Road NetworksDaniel Delling, Renato F. Werneck. 30-42 [doi]
- Intriguingly Simple and Fast Transit RoutingJulian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner. 43-54 [doi]
- Transit Node Routing ReconsideredJulian Arz, Dennis Luxen, Peter Sanders. 55-66 [doi]
- A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic ProgressionsLasse Kliemann, Ole Kliemann, Chellapilla Patvardhan, Volkmar Sauerland, Anand Srivastav. 67-78 [doi]
- Computational Aspects of Ordered Integer Partition with Upper BoundsRoland Glück, Dominik Köppl, Günther Wirsching. 79-90 [doi]
- Hypergraph Transversal Computation with Binary Decision DiagramsTakahisa Toda. 91-102 [doi]
- Efficient Counting of Maximal Independent Sets in Sparse GraphsFredrik Manne, Sadia Sharmin. 103-114 [doi]
- An Edge Quadtree for External MemoryHerman J. Haverkort, Mark McGranaghan, Laura Toma. 115-126 [doi]
- Branchless Search ProgramsAmr Elmasry, Jyrki Katajainen. 127-138 [doi]
- Lightweight Lempel-Ziv ParsingJuha Kärkkäinen, Dominik Kempa, Simon J. Puglisi. 139-150 [doi]
- Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit SequencesDong Zhou, David G. Andersen, Michael Kaminsky. 151-163 [doi]
- Think Locally, Act Globally: Highly Balanced Graph PartitioningPeter Sanders, Christian Schulz. 164-175 [doi]
- Evaluation of ILP-Based Approaches for Partitioning into Colorful ComponentsSharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier. 176-187 [doi]
- Finding Modules in Networks with Non-modular RegionsSharon Bruckner, Bastian Kayser, Tim O. F. Conrad. 188-199 [doi]
- Telling Stories FastMichele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu. 200-211 [doi]
- Undercover BranchingTimo Berthold, Ambros M. Gleixner. 212-223 [doi]
- Quadratic Outer Approximation for Convex Integer Programming with Box ConstraintsChristoph Buchheim, Long Trieu. 224-235 [doi]
- Separable Non-convex Underestimators for Binary Quadratic ProgrammingChristoph Buchheim, Emiliano Traversi. 236-247 [doi]
- Hybrid SDP Bounding ProcedureFabio Furini, Emiliano Traversi. 248-259 [doi]
- Computing Multimodal Journeys in PracticeDaniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck. 260-271 [doi]
- Efficient Computation of Jogging RoutesAndreas Gemsa, Thomas Pajor, Dorothea Wagner, Tobias Zündorf. 272-283 [doi]
- Dominator Certification and Independent Spanning Trees: An Experimental StudyLoukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan. 284-295 [doi]
- Novel Techniques for Automorphism Group ComputationJosé Luis López-Presa, Luis Núñez Chiroque, Antonio Fernández Anta. 296-307 [doi]
- Blinking Molecule TrackingAndreas Karrenbauer, Dominik Wöll. 308-319 [doi]
- The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative AlgorithmDavi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza. 320-336 [doi]
- An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set NumberMathias Weller. 337-353 [doi]
- In-Out Separation and Column Generation Stabilization by Dual Price SmoothingArtur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck. 354-365 [doi]
- Energy Minimization via a Primal-Dual Algorithm for a Convex ProgramEvripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis. 366-377 [doi]
- Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator ControlBenjamin Hiller, Torsten Klug, Jakob Witzig. 378-389 [doi]
- Cluster-Based Heuristics for the Team Orienteering Problem with Time WindowsDamianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou, Yiannis Tasoulas. 390-401 [doi]
- Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local SearchMarjan van den Akker, Kevin van Blokland, Han Hoogeveen. 402-413 [doi]