nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear lower bound on index size for text retrieval
|
Demaine, Erik D. |
|
2003 |
48 |
1 |
p. 2-15 14 p. |
artikel |
2 |
An efficient graph algorithm for dominance constraints
|
Althaus, Ernst |
|
2003 |
48 |
1 |
p. 194-219 26 p. |
artikel |
3 |
Approximation algorithms for TSP with neighborhoods in the plane
|
Dumitrescu, Adrian |
|
2003 |
48 |
1 |
p. 135-159 25 p. |
artikel |
4 |
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
|
Meyer, Ulrich |
|
2003 |
48 |
1 |
p. 91-134 44 p. |
artikel |
5 |
Capacitated vertex covering
|
Guha, Sudipto |
|
2003 |
48 |
1 |
p. 257-270 14 p. |
artikel |
6 |
Competitive on-line stream merging algorithms for media-on-demand
|
Bar-Noy, Amotz |
|
2003 |
48 |
1 |
p. 59-90 32 p. |
artikel |
7 |
Editorial Board
|
|
|
2003 |
48 |
1 |
p. IFC- 1 p. |
artikel |
8 |
Making data structures confluently persistent
|
Fiat, Amos |
|
2003 |
48 |
1 |
p. 16-58 43 p. |
artikel |
9 |
Minimum spanning tree with hop restrictions
|
Hassin, Refael |
|
2003 |
48 |
1 |
p. 220-238 19 p. |
artikel |
10 |
[No title]
|
Pruhs, Kirk |
|
2003 |
48 |
1 |
p. 1- 1 p. |
artikel |
11 |
Packing cycles in undirected graphs
|
Caprara, Alberto |
|
2003 |
48 |
1 |
p. 239-256 18 p. |
artikel |
12 |
Papers to appear in forthcoming issues
|
|
|
2003 |
48 |
1 |
p. 271- 1 p. |
artikel |
13 |
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
|
St. John, Katherine |
|
2003 |
48 |
1 |
p. 173-193 21 p. |
artikel |
14 |
Robust algorithms for restricted domains
|
Raghavan, Vijay |
|
2003 |
48 |
1 |
p. 160-172 13 p. |
artikel |