nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('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. |
artikel |
2 |
Author index to volume
|
|
|
2004 |
140 |
1-3 |
p. 281- 1 p. |
artikel |
3 |
Book announcements
|
|
|
2004 |
140 |
1-3 |
p. 273-275 3 p. |
artikel |
4 |
Contents
|
|
|
2004 |
140 |
1-3 |
p. xi-xii nvt p. |
artikel |
5 |
Continuous bottleneck tree partitioning problems
|
Halman, Nir |
|
2004 |
140 |
1-3 |
p. 185-206 22 p. |
artikel |
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. |
artikel |
7 |
Editorial Board
|
|
|
2004 |
140 |
1-3 |
p. v-vii nvt p. |
artikel |
8 |
Editorial Note: DAM Software Section
|
Leonard, C.J |
|
2004 |
140 |
1-3 |
p. ix-x nvt p. |
artikel |
9 |
Exchange relations, Dyck paths and copolymer adsorption
|
Rechnitzer, A. |
|
2004 |
140 |
1-3 |
p. 49-71 23 p. |
artikel |
10 |
Forthcoming Special Issues
|
|
|
2004 |
140 |
1-3 |
p. 277-279 3 p. |
artikel |
11 |
Gray code for derangements
|
Baril, Jean-Luc |
|
2004 |
140 |
1-3 |
p. 207-221 15 p. |
artikel |
12 |
Guide for authors
|
|
|
2004 |
140 |
1-3 |
p. I-IV nvt p. |
artikel |
13 |
Hybrid grids and the Homing Robot
|
Rabinoff, Joseph |
|
2004 |
140 |
1-3 |
p. 155-168 14 p. |
artikel |
14 |
List of referees
|
|
|
2004 |
140 |
1-3 |
p. 259-271 13 p. |
artikel |
15 |
Master index to volumes
|
|
|
2004 |
140 |
1-3 |
p. 283-294 12 p. |
artikel |
16 |
Neighborhood unions and cyclability of graphs
|
Liu, Huiqing |
|
2004 |
140 |
1-3 |
p. 91-101 11 p. |
artikel |
17 |
New lower bounds for the three-dimensional finite bin packing problem
|
Boschetti, Marco A. |
|
2004 |
140 |
1-3 |
p. 241-258 18 p. |
artikel |
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. |
artikel |
19 |
On the construction of most reliable networks
|
Deng, Hanyuan |
|
2004 |
140 |
1-3 |
p. 19-33 15 p. |
artikel |
20 |
Searching in trees
|
Recker, Frank |
|
2004 |
140 |
1-3 |
p. 169-183 15 p. |
artikel |
21 |
The average connectivity of a digraph
|
Henning, Michael A. |
|
2004 |
140 |
1-3 |
p. 143-153 11 p. |
artikel |
22 |
The integrity of a cubic graph
|
Vince, A. |
|
2004 |
140 |
1-3 |
p. 223-239 17 p. |
artikel |
23 |
The stable crews problem
|
Cechlárová, Katarı́na |
|
2004 |
140 |
1-3 |
p. 1-17 17 p. |
artikel |
24 |
Worst-case analysis of a dynamic channel assignment strategy
|
Narayanan, Lata |
|
2004 |
140 |
1-3 |
p. 115-141 27 p. |
artikel |