7. WEA 2008: Provincetown, MA, USA

• Timo Aho, Tapio Elomaa, Jussi Kujala:
  Reducing Splaying by Taking Advantage of Working Sets. 1-13
  
• Ranjan Sinha, Anthony Wirth:
  Engineering Burstsort: Towards Fast In-Place String Sorting. 14-27
  
• Nicholas Nash, David Gregg:
  Comparing Integer Data Structures for 32 and 64 Bit Keys. 28-42
  
• François Clautiaux, Antoine Jouglet, Aziz Moukrim:
  A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems. 43-54
  
• Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
  Layer-Free Upward Crossing Minimization. 55-68
  
• Kevin M. Lillis, Sriram V. Pemmaraju:
  On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations. 69-86
  
• Zhengbing Bian, Qian-Ping Gu:
  Computing Branch Decomposition of Large Planar Graphs. 87-100
  
• Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende:
  Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem. 101-113
  
• Eli Packer:
  Computing Multiple Watchman Routes. 114-128
  
• Jens Gustedt:
  Engineering Parallel In-Place Random Generation of Integer Permutations. 129-141
  
• Leonor Frias, Jordi Petit:
  Parallel Partition Revisited. 142-153
  
• Sebastiano Vigna:
  Broadword Implementation of Rank/Select Queries. 154-168
  
• Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
  Efficient Implementations of Heuristics for Routing and Wavelength Assignment. 169-180
  
• Dimitris Kalles, Alexis C. Kaporis, Paul G. Spirakis:
  Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. 181-193
  
• Amotz Bar-Noy, Yi Feng, Matthew P. Johnson, Ou Liu:
  When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries. 194-207
  
• Deepak Ajwani, Itay Malinger, Ulrich Meyer, Sivan Toledo:
  Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. 208-219
  
• Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck:
  Fast Local Search for the Maximum Independent Set Problem. 220-234
  
• Gerald Lach, Marco E. Lübbecke:
  Optimal University Course Timetables and the Partial Transversal Polytope. 235-248
  
• Christoph Buchheim, Frauke Liers, Marcus Oswald:
  A Basic Toolbox for Constrained Quadratic 0/1 Optimization. 249-262
  
• Jens Jägersküpper, Mike Preuss:
  Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory. 263-274
  
• Ernst Althaus, Rouven Naujoks:
  Reconstructing Phylogenetic Networks with One Recombination. 275-288
  
• Sebastian Böcker, Sebastian Briesemeister, Gunnar W. Klau:
  Exact Algorithms for Cluster Editing: Evaluation and Experiments. 289-302
  
• Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner:
  Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. 303-318
  
• Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling:
  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. 319-333
  
• Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes:
  Bidirectional A^* Search for Time-Dependent Fast Paths. 334-346
  
• Yann Disser, Matthias Müller-Hannemann, Mathias Schnee:
  Multi-criteria Shortest Paths in Time-Dependent Train Networks. 347-361
  

Last update Thu May 23 18:07:59 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page