ACM Journal of Experimental Algorithmics, Volume 11

Volume 11, 2006

• Leena Salmela, Jorma Tarhio, Jari Kytöjoki:
  Multipattern string matching with q-grams.
  
• Ranjan Sinha, Justin Zobel, David Ring:
  Cache-efficient string sorting using copying.
  
• Michael Penner, Viktor K. Prasanna:
  Cache-Friendly implementations of transitive closure.
  
• Justin Goshi, Richard E. Ladner:
  Algorithms for dynamic multicast key distribution.
  
• Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari:
  Partitioning planar graphs with costs and weights.
  
• Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt:
  Heuristics for estimating contact area of supports in layered manufacturing.
  
• David J. Pearce, Paul H. J. Kelly:
  A dynamic topological sort algorithm for directed acyclic graphs.
  

• Sotiris E. Nikoletseas:
  JEA Special Section.
  
• Michele Flammini, Alfredo Navarra, Stephane Perennes:
  The "real" approximation factor of the MST heuristic for the minimum energy broadcasting.
  
• Torsten Fahle, Karsten Tiemann:
  A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques.
  
• Pierre Leone, José D. P. Rolim, Paul Albuquerque, Christian Mazza:
  A framework for probabilistic numerical evaluation of sensor networks: A case study of a localization protocol.
  
• Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
  GRASP with path relinking for the weighted MAXSAT problem.
  
• Kurt Mehlhorn, Dimitrios Michail:
  Implementing minimum cycle basis algorithms.
  
• Laura Heinrich-Litan, Marco E. Lübbecke:
  Rectangle covers revisited computationally.
  
• Panagiota N. Panagopoulou, Paul G. Spirakis:
  Algorithms for pure Nash equilibria in weighted congestion games.
  
• Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
  Partitioning graphs to speedup Dijkstra's algorithm.
  
• Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo:
  Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers.