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