| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
About equivalent interval colorings of weighted graphs
|
Bouchard, Mathieu
|
|
2009
|
157 |
17 |
p. 3615-3624
10 p.
|
artikel
|
| 2 |
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
|
Giaro, K.
|
|
2009
|
157 |
17 |
p. 3625-3630
6 p.
|
artikel
|
| 3 |
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
|
Kamiyama, Naoyuki
|
|
2009
|
157 |
17 |
p. 3665-3677
13 p.
|
artikel
|
| 4 |
A new neighborhood and tabu search for the Blocking Job Shop
|
Gröflin, Heinz
|
|
2009
|
157 |
17 |
p. 3643-3655
13 p.
|
artikel
|
| 5 |
Approximating the maximum 2- and 3-edge-colorable subgraph problems
|
Kosowski, Adrian
|
|
2009
|
157 |
17 |
p. 3593-3600
8 p.
|
artikel
|
| 6 |
Bicolored graph partitioning, or: gerrymandering at its worst
|
Apollonio, N.
|
|
2009
|
157 |
17 |
p. 3601-3614
14 p.
|
artikel
|
| 7 |
Contents
|
|
|
2009
|
157 |
17 |
p. vii-viii
nvt p.
|
artikel
|
| 8 |
Detecting induced subgraphs
|
Lévêque, Benjamin
|
|
2009
|
157 |
17 |
p. 3540-3551
12 p.
|
artikel
|
| 9 |
Disjoint paths in sparse graphs
|
Bentz, Cédric
|
|
2009
|
157 |
17 |
p. 3558-3568
11 p.
|
artikel
|
| 10 |
Editorial Board
|
|
|
2009
|
157 |
17 |
p. v-vi
nvt p.
|
artikel
|
| 11 |
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
|
Katoh, Naoki
|
|
2009
|
157 |
17 |
p. 3569-3585
17 p.
|
artikel
|
| 12 |
Finding induced trees
|
Derhy, N.
|
|
2009
|
157 |
17 |
p. 3552-3557
6 p.
|
artikel
|
| 13 |
Foreword
|
Gambardella, Luca Maria
|
|
2009
|
157 |
17 |
p. 3495-3496
2 p.
|
artikel
|
| 14 |
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups
|
Meng-Gérard, J.
|
|
2009
|
157 |
17 |
p. 3656-3664
9 p.
|
artikel
|
| 15 |
On minimally b-imperfect graphs
|
Hoàng, Chính T.
|
|
2009
|
157 |
17 |
p. 3519-3530
12 p.
|
artikel
|
| 16 |
On the approximability of the Simplified Partial Digest Problem
|
Blazewicz, Jacek
|
|
2009
|
157 |
17 |
p. 3586-3592
7 p.
|
artikel
|
| 17 |
On the complexity of some subgraph problems
|
Scozzari, Andrea
|
|
2009
|
157 |
17 |
p. 3531-3539
9 p.
|
artikel
|
| 18 |
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs
|
Bonomo, Flavia
|
|
2009
|
157 |
17 |
p. 3511-3518
8 p.
|
artikel
|
| 19 |
The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm
|
Carlier, Jacques
|
|
2009
|
157 |
17 |
p. 3631-3642
12 p.
|
artikel
|
| 20 |
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
|
Aouchiche, Mustapha
|
|
2009
|
157 |
17 |
p. 3497-3510
14 p.
|
artikel
|
Tijdschrift beschrijving