nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Analogs & duals of the MAST problem for sequences & trees
|
Fellows, Michael |
|
2003 |
49 |
1 |
p. 192-216 25 p. |
artikel |
2 |
Approximate coloring of uniform hypergraphs
|
Krivelevich, Michael |
|
2003 |
49 |
1 |
p. 2-12 11 p. |
artikel |
3 |
Editorial Board
|
|
|
2003 |
49 |
1 |
p. IFC- 1 p. |
artikel |
4 |
Finding an optimal path without growing the tree
|
Chen, Danny Z. |
|
2003 |
49 |
1 |
p. 13-41 29 p. |
artikel |
5 |
Fitting points on the real line and its application to RH mapping
|
Håstad, Johan |
|
2003 |
49 |
1 |
p. 42-62 21 p. |
artikel |
6 |
Fully dynamic shortest paths in digraphs with arbitrary arc weights
|
Frigioni, Daniele |
|
2003 |
49 |
1 |
p. 86-113 28 p. |
artikel |
7 |
Maximizing job completions online
|
Kalyanasundaram, Bala |
|
2003 |
49 |
1 |
p. 63-85 23 p. |
artikel |
8 |
[No title]
|
Bilardi, Gianfranco |
|
2003 |
49 |
1 |
p. 1- 1 p. |
artikel |
9 |
Papers to appear in forthcoming issues
|
|
|
2003 |
49 |
1 |
p. 217- 1 p. |
artikel |
10 |
Δ-stepping: a parallelizable shortest path algorithm
|
Meyer, U. |
|
2003 |
49 |
1 |
p. 114-152 39 p. |
artikel |
11 |
Techniques for scheduling with rejection
|
Engels, Daniel W. |
|
2003 |
49 |
1 |
p. 175-191 17 p. |
artikel |
12 |
The moving-target traveling salesman problem
|
Helvig, C.S. |
|
2003 |
49 |
1 |
p. 153-174 22 p. |
artikel |