|
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 | Coloring mixed hypertrees |
Král’, Daniel |
2006 |
154 | 4 |
p. 660-672 13 p. |
article |
|
| 2 | Contents |
2006 |
154 | 4 |
p. vii- 1 p. |
article |
||
| 3 | Designing PTASs for MIN-SUM scheduling problems |
Afrati, F. |
2006 |
154 | 4 |
p. 622-639 18 p. |
article |
|
| 4 | Editorial Board |
2006 |
154 | 4 |
p. v-vi nvt p. |
article |
||
| 5 | Guest editors |
2006 |
154 | 4 |
p. 610- 1 p. |
article |
||
| 6 | Guide for authors |
2006 |
154 | 4 |
p. I-IV nvt p. |
article |
||
| 7 | Hybrid rounding techniques for knapsack problems |
Mastrolilli, Monaldo |
2006 |
154 | 4 |
p. 640-649 10 p. |
article |
|
| 8 | Introduction |
Bampis, Evripidis |
2006 |
154 | 4 |
p. 609- 1 p. |
article |
|
| 9 | Non-independent randomized rounding and coloring |
Doerr, Benjamin |
2006 |
154 | 4 |
p. 650-659 10 p. |
article |
|
| 10 | Optimal on-line flow time with resource augmentation |
Epstein, Leah |
2006 |
154 | 4 |
p. 611-621 11 p. |
article |
|
| 11 | Path problems in generalized stars, complete graphs, and brick wall graphs |
Erlebach, Thomas |
2006 |
154 | 4 |
p. 673-683 11 p. |
article |
|
| 12 | The complexity of maximum matroid–greedoid intersection and weighted greedoid maximization |
Mielikäinen, Taneli |
2006 |
154 | 4 |
p. 684-691 8 p. |
article |
12 results found