The ACM Journal of Experimental Algorithmics

Section 1: Regular Articles

Article 1.1: Multipattern string matching with q-grams, by Leena Salmela, Jorma Tarhio, and Jari Kytöjoki.

Article 1.2: Cache-efficient string sorting using copying, by Ranjan Sinha, Justin Zobel, and David Ring.

Article 1.3: Cache-Friendly implementations of transitive closure, by Michael Penner and Viktor K. Prasanna.

Article 1.4: Algorithms for dynamic multicast key distribution, by Justin Goshi and Richard E. Ladner.

Article 1.5: Partitioning planar graphs with costs and weights, by Lyudmil Alexandrov, Hristo Djidjev, Hua Guo, and Anil Maheshweari.

Article 1.6: Heuristics for extimating contact area of supports in layered manufacturing, by Ivaylo Ilinkin, Ravi Janardan, Michiel Smid, Eric Johnson, Paul Castillo, and Jörg Schwerdt.

Article 1.7: A dynamic topological sort algorithm for directed acyclic graphs, by D. J. Pearce and P. H. J. Kelly.
Related Resources:

• A tar file containing the code described in the paper.
• A tar file containing a mechanism for generating random graphs.
• The two tar files can be found at www.mcs.vuw.ac.nz/~djp.

Section 2: Selected Papers from WEA 2005

Article 2.1: JEA Special Section, by Sotiris Nikoletseas.

Article 2.2: A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques, , by Torsten Fahle and Karsten Tiemann.

Article 2.3: A framework for probabilistic numberical evaluation of sensor networks: A case study of a localization protocol , by Pierre Leone, Jose Rolim, Paul Albuquerque, and Christian Mazza.

Article 2.4: GRASP with path relinking for the weighted MAXSAT problem , by Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, and Mauricio G. C. Resende.

Article 2.5: Implementing minimum cycle basis algorithms , by Kurt Mehlhorn and Dimtrios Michail.

Article 2.6: Rectangle covers revisited computationally , by Laura Heinrich-Litan and Marco E. Lübbecke.

Article 2.7: Algorithms for pure Nash equilibria in weighted congestion games , by Panagiota N. Panagopoulou and Paul G. Spirakis.

Article 2.8: Partitioning graphs to speedup Dijktra's algorithm , by Rolf H. Möhring, Heiko Schilling, Birk Sch&umml;tz, Dorothea Wagner, and Thomas Willhalm.

Article 2.9: Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers , by Azzedine Boukerche and Alba Cristina Magalhaes Alves De Melo.

Article 2.10: The ``real'' approximation factor of the MST heuristic for the minimum energy broadcasting, by Michele Flammini, Alfredo Navarra, and Stephane Perennes.