|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
24 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree |
Nagamochi, Hiroshi |
2004 |
140 | 1-3 |
p. 103-114 12 p. |
article |
|
| 2 | Author index to volume |
2004 |
140 | 1-3 |
p. 281- 1 p. |
article |
||
| 3 | Book announcements |
2004 |
140 | 1-3 |
p. 273-275 3 p. |
article |
||
| 4 | Contents |
2004 |
140 | 1-3 |
p. xi-xii nvt p. |
article |
||
| 5 | Continuous bottleneck tree partitioning problems |
Halman, Nir |
2004 |
140 | 1-3 |
p. 185-206 22 p. |
article |
|
| 6 | Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs |
Keil, J.Mark |
2004 |
140 | 1-3 |
p. 73-89 17 p. |
article |
|
| 7 | Editorial Board |
2004 |
140 | 1-3 |
p. v-vii nvt p. |
article |
||
| 8 | Editorial Note: DAM Software Section |
Leonard, C.J |
2004 |
140 | 1-3 |
p. ix-x nvt p. |
article |
|
| 9 | Exchange relations, Dyck paths and copolymer adsorption |
Rechnitzer, A. |
2004 |
140 | 1-3 |
p. 49-71 23 p. |
article |
|
| 10 | Forthcoming Special Issues |
2004 |
140 | 1-3 |
p. 277-279 3 p. |
article |
||
| 11 | Gray code for derangements |
Baril, Jean-Luc |
2004 |
140 | 1-3 |
p. 207-221 15 p. |
article |
|
| 12 | Guide for authors |
2004 |
140 | 1-3 |
p. I-IV nvt p. |
article |
||
| 13 | Hybrid grids and the Homing Robot |
Rabinoff, Joseph |
2004 |
140 | 1-3 |
p. 155-168 14 p. |
article |
|
| 14 | List of referees |
2004 |
140 | 1-3 |
p. 259-271 13 p. |
article |
||
| 15 | Master index to volumes |
2004 |
140 | 1-3 |
p. 283-294 12 p. |
article |
||
| 16 | Neighborhood unions and cyclability of graphs |
Liu, Huiqing |
2004 |
140 | 1-3 |
p. 91-101 11 p. |
article |
|
| 17 | New lower bounds for the three-dimensional finite bin packing problem |
Boschetti, Marco A. |
2004 |
140 | 1-3 |
p. 241-258 18 p. |
article |
|
| 18 | New upper and lower bounds on the channel capacity of read/write isolated memory |
Golin, Mordecai J. |
2004 |
140 | 1-3 |
p. 35-48 14 p. |
article |
|
| 19 | On the construction of most reliable networks |
Deng, Hanyuan |
2004 |
140 | 1-3 |
p. 19-33 15 p. |
article |
|
| 20 | Searching in trees |
Recker, Frank |
2004 |
140 | 1-3 |
p. 169-183 15 p. |
article |
|
| 21 | The average connectivity of a digraph |
Henning, Michael A. |
2004 |
140 | 1-3 |
p. 143-153 11 p. |
article |
|
| 22 | The integrity of a cubic graph |
Vince, A. |
2004 |
140 | 1-3 |
p. 223-239 17 p. |
article |
|
| 23 | The stable crews problem |
Cechlárová, Katarı́na |
2004 |
140 | 1-3 |
p. 1-17 17 p. |
article |
|
| 24 | Worst-case analysis of a dynamic channel assignment strategy |
Narayanan, Lata |
2004 |
140 | 1-3 |
p. 115-141 27 p. |
article |
24 results found