Abstract is missing.
- An Alternative Ranking Problem for Search EnginesCorinna Cortes, Mehryar Mohri, Ashish Rastogi. 1-22 [doi]
- Engineering Fast Route Planning AlgorithmsPeter Sanders, Dominik Schultes. 23-36 [doi]
- Random Models for Geometric Graphs (Abstract)Maria J. Serna. 37 [doi]
- Better Landmarks Within ReachAndrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck. 38-51 [doi]
- Landmark-Based Routing in Dynamic GraphsDaniel Delling, Dorothea Wagner. 52-65 [doi]
- Dynamic Highway-Node RoutingDominik Schultes, Peter Sanders. 66-79 [doi]
- Dynamic Trees in PracticeRobert Endre Tarjan, Renato Fonseca F. Werneck. 80-93 [doi]
- On the Cost of Persistence and Authentication in Skip ListsMichael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia. 94-107 [doi]
- Cache-, Hash- and Space-Efficient Bloom FiltersFelix Putze, Peter Sanders, Johannes Singler. 108-121 [doi]
- Crossing Minimization in Weighted Bipartite GraphsOlca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler. 122-135 [doi]
- Fast Minimum-Weight Double-Tree Shortcutting for Metric TSPVladimir G. Deineko, Alexandre Tiskin. 136-149 [doi]
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing ProblemArtur Alves Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa. 150-160 [doi]
- Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor NetworksOlivier Powell, Sotiris E. Nikoletseas. 161-174 [doi]
- A Distributed Primal-Dual Heuristic for Steiner Problems in NetworksMarcelo C. P. Santos, Lúcia Maria de A. Drummond, Eduardo Uchoa. 175-188 [doi]
- An Experimental Study of Stability in Heterogeneous NetworksMaria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos. 189-202 [doi]
- Simple Compression Code Supporting Random Access and Fast String MatchingKimmo Fredriksson, Fedor Nikitin. 203-216 [doi]
- Engineering a Compressed Suffix Tree ImplementationNiko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen. 217-228 [doi]
- Simple Space-Time Trade-Offs for AESAKarina Figueroa, Kimmo Fredriksson. 229-241 [doi]
- Engineering Algorithms for Approximate Weighted MatchingJens Maue, Peter Sanders. 242-255 [doi]
- Experimental Evaluation of Parametric Max-Flow AlgorithmsMaxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou. 256-269 [doi]
- Experimental Study of Geometric t-Spanners: A Running Time ComparisonMohammad Farshi, Joachim Gudmundsson. 270-284 [doi]
- Vertex Cover Approximations on Random GraphsEyjolfur Asgeirsson, Clifford Stein. 285-296 [doi]
- Optimal Edge Deletions for Signed Graph BalancingFalk Hüffner, Nadja Betzler, Rolf Niedermeier. 297-310 [doi]
- Algorithms for the Balanced Edge Partitioning ProblemEkaterina Smorodkina, Mayur Thakur, Daniel R. Tauritz. 311-323 [doi]
- Experimental Evaluations of Algorithms for IP Table MinimizationAngelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli. 324-337 [doi]
- Algorithms for Longer OLED LifetimeFriedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu. 338-351 [doi]
- Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement DataFei Ye, Yan Guo, Andrew Lawson, Jijun Tang. 352-364 [doi]
- Benchmarks for Strictly Fundamental Cycle BasesChristian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi. 365-378 [doi]
- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree ProblemMarkus Behle, Michael Jünger, Frauke Liers. 379-392 [doi]
- Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge WeightsCelso C. Ribeiro, Rodrigo F. Toso. 393-405 [doi]
- An Efficient Implementation for the 0-1 Multi-objective Knapsack ProblemCristina Bazgan, Hadrien Hugot, Daniel Vanderpooten. 406-419 [doi]
- Trunk Packing RevisitedErnst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth. 420-432 [doi]
- Exact Algorithms for the Matrix Bid AuctionDries R. Goossens, Frits C. R. Spieksma. 433-445 [doi]