Abstract is missing.
- Automatic Decomposition and Branch-and-Price - A Status ReportMarco E. Lübbecke. 1-8 [doi]
- Continuous Local Strategies for Robotic Formation ProblemsBarbara Kempkes, Friedhelm Meyer auf der Heide. 9-17 [doi]
- Engineering Graph Partitioning AlgorithmsVitaly Osipov, Peter Sanders, Christian Schulz. 18-26 [doi]
- Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure PatternsBenjamin Albrecht, Volker Heun. 27-38 [doi]
- Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge GraphsEric Angel, Romain Campigotto, Christian Laforest. 39-50 [doi]
- How to Attack the NP-Complete Dag Realization Problem in PracticeAnnabell Berger, Matthias Müller-Hannemann. 51-62 [doi]
- New Results about Multi-band Uncertainty in Robust OptimizationChristina Büsing, Fabio D'Andreagiovanni. 63-74 [doi]
- Compact Relaxations for Polynomial Programming ProblemsSonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine. 75-86 [doi]
- Relaxations of Multilinear Convex Envelopes: Dual Is Better Than PrimalAlberto Costa, Leo Liberti. 87-98 [doi]
- On Computing the Diameter of Real-World Directed (Weighted) GraphsPierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino. 99-110 [doi]
- Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight ModificationsAnnalisa D'Andrea, Guido Proietti. 111-122 [doi]
- Engineering a New Loop-Free Shortest Paths Routing AlgorithmGianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio. 123-134 [doi]
- Fully Dynamic Maintenance of Arc-Flags in Road NetworksGianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale. 135-147 [doi]
- A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random GraphsMartin Dietzfelbinger, Hendrik Peilke, Michael Rink. 148-159 [doi]
- Branch Mispredictions Don't Affect MergesortAmr Elmasry, Jyrki Katajainen, Max Stenmark. 160-171 [doi]
- A Multiple Sliding Windows Approach to Speed Up String Matching AlgorithmsSimone Faro, Thierry Lecroq. 172-183 [doi]
- Algorithms for Subnetwork Mining in Heterogeneous NetworksGuillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu. 184-194 [doi]
- Computing Strong Articulation Points and Strong Bridges in Large Scale GraphsDonatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi, Federico Santaroni. 195-207 [doi]
- Adaptive Distributed b-Matching in Overlays with PreferencesGiorgos Georgiadis, Marina Papatriantafilou. 208-223 [doi]
- Dynamizing Succinct Tree RepresentationsStelios Joannou, Rajeev Raman. 224-235 [doi]
- A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route NetworkDominik Kirchler, Leo Liberti, Roberto Wolfler Calvo. 236-247 [doi]
- Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete DataMasashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh. 248-259 [doi]
- Candidate Sets for Alternative Routes in Road NetworksDennis Luxen, Dennis Schieferdecker. 260-270 [doi]
- Paired and Altruistic Kidney Donation in the UK: Algorithms and ExperimentationDavid Manlove, Gregg O'Malley. 271-282 [doi]
- An Evaluation of Community Detection Algorithms on Large-Scale Email TrafficFarnaz Moradi, Tomas Olovsson, Philippas Tsigas. 283-294 [doi]
- Fast, Small, Simple Rank/Select on BitmapsGonzalo Navarro, Eliana Providel. 295-306 [doi]
- Space-Efficient Top-k Document RetrievalGonzalo Navarro, Daniel Valenzuela. 307-319 [doi]
- Engineering Efficient Paging AlgorithmsGabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert. 320-331 [doi]
- Feasibility Pump Heuristics for Column Generation ApproachesPierre Pesneau, Ruslan Sadykov, François Vanderbeck. 332-343 [doi]
- Exact Graph Search Algorithms for Generalized Traveling Salesman Path ProblemsMichael N. Rice, Vassilis J. Tsotras. 344-355 [doi]
- Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental ApproachJörg Rothe, Lena Schend. 356-368 [doi]
- Advanced Coarsening Schemes for Graph PartitioningIlya Safro, Peter Sanders, Christian Schulz. 369-380 [doi]
- A Heuristic for Non-convex Variance-Based Clustering CriteriaRodrigo F. Toso, Casimir A. Kulikowski, Ilya B. Muchnik. 381-392 [doi]
- A Decomposition Approach for Solving Critical Clique Detection ProblemsJose L. Walteros, Panos M. Pardalos. 393-404 [doi]