Volume 13,
September 2008
Regular Papers
- Georg Gottlob, Marko Samer:
A backtracking-based algorithm for hypertree decomposition.
- Gonzalo Navarro:
Implementing the LZ-index: Theory versus practice.
- Mark Lanthier, Doron Nussbaum, Tsuo-Jung Wang:
Computing an approximation of the 1-center problem on weighted terrain surfaces.
- Ilya Safro, Dorit Ron, Achi Brandt:
Multilevel algorithms for linear ordering problems.
- Herman J. Haverkort, Laura Toma, Yi Zhuang:
Computing visibility on terrains in external memory.
- Amotz Bar-Noy, Richard E. Ladner, Jacob Christensen, Tami Tamir:
A general buffer scheme for the windows scheduling problem.
- Andreas Larsson, Anders Gidenstam, Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas:
Multiword atomic read/write registers on multiprocessor systems.
- Kimmo Fredriksson:
Succinct backward-DAWG-matching.
- Nicholas Nash, Sylvain Lelait, David Gregg:
Efficiently implementing maximum independent set algorithms on circle graphs.
- Clémence Magnien, Matthieu Latapy, Michel Habib:
Fast computation of empirically tight bounds for the diameter of massive graphs.
- Amr Elmasry, Abdelrahman Hammad:
Inversion-sensitive sorting algorithms in practice.
- Paolo Ferragina, Rodrigo González, Gonzalo Navarro, Rossano Venturini:
Compressed text indexes: From theory to practice.
- Wady Naanaa:
A domain decomposition algorithm for constraint satisfaction.
- Telikepalli Kavitha, Katakam Vamsi Krishna:
An improved heuristic for computing short integral cycle bases.
- John D. Crabtree, Dinesh P. Mehta:
Automated reaction mapping.
Selected Papers from ALENEX 2006
Copyright © Mon Nov 2 21:44:58 2009
by Michael Ley (ley@uni-trier.de)
