Volume 48, Number 1, August 2003
- Kirk Pruhs:
Foreword.
1
- Erik D. Demaine, Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval.
2-15
- Amos Fiat, Haim Kaplan:
Making data structures confluently persistent.
16-58
- Amotz Bar-Noy, Richard E. Ladner:
Competitive on-line stream merging algorithms for media-on-demand.
59-90
- Ulrich Meyer:
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds.
91-134
- Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane.
135-159
- Vijay Raghavan, Jeremy Spinrad:
Robust algorithms for restricted domains.
160-172
- Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter:
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining.
173-193
- Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel:
An efficient graph algorithm for dominance constraints.
194-219
- Refael Hassin, Asaf Levin:
Minimum spanning tree with hop restrictions.
220-238
- Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing cycles in undirected graphs.
239-256
- Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or:
Capacitated vertex covering.
257-270
Volume 48, Number 2, September 2003
Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms
- Nodari Vakhania:
A better algorithm for sequencing with release and delivery times on identical machines.
273-293
- Kunihiko Sadakane:
New text indexing functionalities of the compressed suffix arrays.
294-313
- Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos:
Scheduling data transfers in a network and the set scheduling problem.
314-332
- Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed:
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width.
333-359
- Leah Epstein, Tamir Tassa:
Vector assignment problems: a general framework.
360-384
- Pascal Ferraro, Christophe Godin:
Optimal mappings with minimum number of connected components in tree-to-tree comparison problems.
385-406
- Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut:
Dynamic TCP acknowledgment in the LogP model.
407-428
- Sudipto Guha, Adam Meyerson, Kamesh Munagala:
A constant factor approximation algorithm for the fault-tolerant facility location problem.
429-440
- Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen:
Compact floor-planning via orderly spanning trees.
441-451
Last update Sat May 25 20:37:45 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
