8. SEA 2009: Dortmund, Germany

• Heinz Bast:
  Parallelism in Current and Future Processors - Challenges and Support for Designing Optimal Algorithms. 1
  
• Michael A. Bender:
  From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering. 2
  
• Anne Auger, Nikolaus Hansen, J. M. Perez Zerpa, Raymond Ros, Marc Schoenauer:
  Experimental Comparisons of Derivative Free Optimization Algorithms. 3-15
  
• Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz:
  On Computational Models for Flash Memory Devices. 16-27
  
• Kamal Al-Bawani, Alexander Souza:
  Competitive Buffer Management with Stochastic Packet Arrivals. 28-39
  
• Ernst Althaus, Daniel Dumitriu:
  Fast and Accurate Bounds on Linear Programs. 40-50
  
• Reinhard Bauer, Dorothea Wagner:
  Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study. 51-62
  
• Mark de Berg, Peter Hachenberger:
  Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy. 63-75
  
• Paolo Bertasi, Marco Bressan, Enoch Peserico:
  psort, Yet Another Fast Stable Sorting Software. 76-88
  
• Raouf Boutaba, Martin Karsten, Maxwell Young:
  A Heuristic for Fair Correlation-Aware Resource Placement. 89-100
  
• Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn:
  Measuring the Similarity of Geometric Graphs. 101-112
  
• Adan Cosgaya-Lozano, Norbert Zeh:
  A Heuristic Strong Connectivity Algorithm for Large Graphs. 113-124
  
• Daniel Delling, Dorothea Wagner:
  Pareto Paths with SHARC. 125-136
  
• Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
  An Application of Self-organizing Data Structures to Compression. 137-148
  
• Holger Flier, Thomas Graffagnino, Marc Nunkesser:
  Scheduling Additional Trains on Dense Corridors. 149-160
  
• Simon Gog:
  Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. 161-172
  
• Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner:
  Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. 173-184
  
• Lasse Kliemann, Anand Srivastav:
  Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. 185-196
  
• Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia:
  Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. 197-208
  
• Sylvain Lazard, Luis Mariano Peñaranda, Elias P. Tsigaridas:
  Univariate Algebraic Kernel and Application to Arrangements. 209-220
  
• José Luis López-Presa, Antonio Fernández Anta:
  Fast Algorithm for Graph Isomorphism Testing. 221-232
  
• Hannes Moser, Rolf Niedermeier, Manuel Sorge:
  Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. 233-244
  
• Giuseppe Nicosia, Giovanni Stracquadanio:
  A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs. 245-256
  
• Andreas Noack, Randolf Rotta:
  Multi-level Algorithms for Modularity Clustering. 257-268
  
• Riku Saikkonen, Eljas Soisalon-Soininen:
  Bulk-Insertion Sort: Towards Composite Measures of Presortedness. 269-280
  
• Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov:
  Computing Elevation Maxima by Searching the Gauss Sphere. 281-292