Abstract is missing.
- Experimental Study of Resilient Algorithms and Data StructuresUmberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano. 1-12 [doi]
- Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in GraphsPanos M. Pardalos, Steffen Rebennack. 13-22 [doi]
- Alternative Routes in Road NetworksIttai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck. 23-34 [doi]
- Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent NetworksAnnabell Berger, Martin Grimmer, Matthias Müller-Hannemann. 35-46 [doi]
- Space-Efficient SHARC-RoutingEdith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner. 47-58 [doi]
- A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental EvaluationSerafino Cicerone, Gianlorenzo D Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio. 59-70 [doi]
- Distributed Time-Dependent Contraction HierarchiesTim Kieritz, Dennis Luxen, Peter Sanders, Christian Vetter. 83-93 [doi]
- Practical Compressed Suffix TreesRodrigo Cánovas, Gonzalo Navarro. 94-105 [doi]
- Maximum Cliques in Protein Structure ComparisonNoël Malod-Dognin, Rumen Andonov, Nicola Yanev. 106-117 [doi]
- Exact Bipartite Crossing Minimization under Tree ConstraintsFrank Baumann, Christoph Buchheim, Frauke Liers. 118-128 [doi]
- Bit-Parallel Search Algorithms for Long PatternsBranislav Durian, Hannu Peltola, Leena Salmela, Jorma Tarhio. 129-140 [doi]
- Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and ExperimentsChris Whidden, Robert G. Beiko, Norbert Zeh. 141-153 [doi]
- Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway CarsAlain Hauser, Jens Maue. 154-165 [doi]
- Time-Dependent Contraction Hierarchies and ApproximationGernot Veit Batz, Robert Geisberger, Sabine Neubauer, Peter Sanders. 166-177 [doi]
- A New Combinational Logic Minimization Technique with Applications to CryptologyJoan Boyar, René Peralta. 178-189 [doi]
- Randomized Rounding for Routing and Covering Problems: Experiments and ImprovementsBenjamin Doerr, Marvin Künnemann, Magnus Wahlström. 190-201 [doi]
- The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price AlgorithmHernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa. 202-213 [doi]
- An Approximate ::::epsilon::::-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing ProblemLucio Grandinetti, Francesca Guerriero, Demetrio Laganà, Ornella Pisacane. 214-225 [doi]
- A Branch-and-Price Algorithm for Multi-mode Resource LevelingEamonn T. Coughlan, Marco E. Lübbecke, Jens Schulz. 226-238 [doi]
- Experiments with a Generic Dantzig-Wolfe Decomposition for Integer ProgramsGerald Gamrath, Marco E. Lübbecke. 239-252 [doi]
- Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack ProblemCharles Delort, Olivier Spanjaard. 253-265 [doi]
- Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria SeparationEdoardo Amaldi, Stefano Coniglio, Stefano Gualandi. 266-275 [doi]
- New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and DeliveryAnand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi. 276-287 [doi]
- A Metaheuristic for a Two Echelon Location-Routing ProblemMaurizio Boccia, Teodor Gabriel Crainic, Antonio Sforza, Claudio Sterle. 288-301 [doi]
- New Fast Heuristics for the 2D Strip Packing Problem with Guillotine ConstraintMinh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut. 302-313 [doi]
- An Experimental Comparison of Different Heuristics for the Master Bay Plan ProblemDaniela Ambrosino, Davide Anghinolfi, Massimo Paolucci 0002, Anna Sciomachen. 314-325 [doi]
- An Analysis of Heuristics for Vertex ColouringMarco Chiarandini, Thomas Stützle. 326-337 [doi]
- Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic AlgorithmPaola Festa, José Fernando Gonçalves, Mauricio G. C. Resende, Ricardo M. A. Silva. 338-349 [doi]
- Experiments with a Feasibility Pump Approach for Nonconvex MINLPsClaudia D Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi. 350-360 [doi]
- Paging Multiple Users in Cellular Network: Yellow Page and Conference Call ProblemsAmotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002. 361-372 [doi]
- Realtime Classification for Encrypted TrafficRoni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty. 373-385 [doi]
- Data Propagation with Guaranteed Delivery for Mobile NetworksHakob Aslanyan, Pierre Leone, José D. P. Rolim. 386-397 [doi]
- Data Structures Resilient to Memory Faults: An Experimental Study of DictionariesUmberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano. 398-410 [doi]
- Experiments on Union-Find Algorithms for the Disjoint-Set Data StructureMd. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne. 411-423 [doi]
- Policy-Based Benchmarking of Weak Heaps and Their Relatives, Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen. 424-435 [doi]
- Modularity-Driven Clustering of Dynamic GraphsRobert Görke, Pascal Maillard, Christian Staudt, Dorothea Wagner. 436-448 [doi]
- Gateway Decompositions for Constrained Reachability ProblemsBastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner. 449-461 [doi]
- Robust and Efficient Delaunay Triangulations of Points on Or Close to a SphereManuel Caroli, Pedro Machado Manhães de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, Camille Wormser. 462-473 [doi]
- Fault Recovery in Wireless Networks: The Geometric Recolouring ApproachHenk Meijer, Yurai Núñez Rodríguez, David Rappaport. 474-485 [doi]
- Geometric Minimum Spanning Trees with GeoFilterKruskalSamidh Chatterjee, Michael Connor, Piyush Kumar. 486-500 [doi]
- Practical Nearest Neighbor Search in the PlaneMichael Connor, Piyush Kumar. 501-512 [doi]