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