nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new lower bound for the single row facility layout problem
|
Amaral, André R.S. |
|
2009 |
157 |
1 |
p. 183-190 8 p. |
artikel |
2 |
Balancing modular transfer lines with serial–parallel activation of spindle heads at stations
|
Dolgui, A. |
|
2009 |
157 |
1 |
p. 68-89 22 p. |
artikel |
3 |
Coloring the square of the Kneser graph KG ( 2 k + 1 , k ) and the Schrijver graph SG ( 2 k + 2 , k )
|
Chen, Jun-Yo |
|
2009 |
157 |
1 |
p. 170-176 7 p. |
artikel |
4 |
Contents
|
|
|
2009 |
157 |
1 |
p. vii-viii nvt p. |
artikel |
5 |
Critically indecomposable graphs
|
Dubey, Chandan K. |
|
2009 |
157 |
1 |
p. 149-163 15 p. |
artikel |
6 |
Disjoint paths in symmetric digraphs
|
Jarry, A. |
|
2009 |
157 |
1 |
p. 90-97 8 p. |
artikel |
7 |
Editorial Board
|
|
|
2009 |
157 |
1 |
p. v-vi nvt p. |
artikel |
8 |
Forwarding index of cube-connected cycles
|
Yan, Jun |
|
2009 |
157 |
1 |
p. 1-7 7 p. |
artikel |
9 |
Layouts for mobility management in wireless ATM networks
|
Flammini, Michele |
|
2009 |
157 |
1 |
p. 98-111 14 p. |
artikel |
10 |
Listing minimal edge-covers of intersecting families with applications to connectivity problems
|
Nutov, Zeev |
|
2009 |
157 |
1 |
p. 112-117 6 p. |
artikel |
11 |
Mutual exclusion scheduling with interval graphs or related classes, Part I
|
Gardi, Frédéric |
|
2009 |
157 |
1 |
p. 19-35 17 p. |
artikel |
12 |
Offensive r -alliances in graphs
|
Fernau, Henning |
|
2009 |
157 |
1 |
p. 177-182 6 p. |
artikel |
13 |
On Ramsey numbers of fans
|
Lin, Qizhong |
|
2009 |
157 |
1 |
p. 191-194 4 p. |
artikel |
14 |
On randomized broadcasting in Star graphs
|
Elsässer, R. |
|
2009 |
157 |
1 |
p. 126-139 14 p. |
artikel |
15 |
On the matching polynomial of subdivision graphs
|
Yan, Weigen |
|
2009 |
157 |
1 |
p. 195-200 6 p. |
artikel |
16 |
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
|
Lin, Ji-Cherng |
|
2009 |
157 |
1 |
p. 140-148 9 p. |
artikel |
17 |
The box-TDI system associated with 2-edge connected spanning subgraphs
|
Chen, Xujin |
|
2009 |
157 |
1 |
p. 118-125 8 p. |
artikel |
18 |
The complexity of nonrepetitive coloring
|
Marx, Dániel |
|
2009 |
157 |
1 |
p. 13-18 6 p. |
artikel |
19 |
The generalized assignment problem with flexible jobs
|
Rainwater, Chase |
|
2009 |
157 |
1 |
p. 49-67 19 p. |
artikel |
20 |
The hierarchical product of graphs
|
Barrière, L. |
|
2009 |
157 |
1 |
p. 36-48 13 p. |
artikel |
21 |
The minimum number of e -vertex-covers among hypergraphs with e edges of given ranks
|
Chang, F.H. |
|
2009 |
157 |
1 |
p. 164-169 6 p. |
artikel |
22 |
The Ramsey number for a cycle of length six versus a clique of order eight
|
Chen, Yaojun |
|
2009 |
157 |
1 |
p. 8-12 5 p. |
artikel |