nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Approximating the treewidth of AT-free graphs
|
Bouchitté, Vincent |
|
2003 |
131 |
1 |
p. 11-37 27 p. |
artikel |
2 |
Characterization of optimal key set protocols
|
Mizuki, Takaaki |
|
2003 |
131 |
1 |
p. 213-236 24 p. |
artikel |
3 |
Contents
|
|
|
2003 |
131 |
1 |
p. ix-x nvt p. |
artikel |
4 |
Editorial Board
|
|
|
2003 |
131 |
1 |
p. v-vii nvt p. |
artikel |
5 |
Fast recognition algorithms for classes of partial cubes
|
Brešar, Boštjan |
|
2003 |
131 |
1 |
p. 51-61 11 p. |
artikel |
6 |
Finding a central vertex in an HHD-free graph
|
Chepoi, Victor |
|
2003 |
131 |
1 |
p. 93-111 19 p. |
artikel |
7 |
Finding a Δ-regular supergraph of minimum order
|
Bodlaender, Hans L |
|
2003 |
131 |
1 |
p. 3-9 7 p. |
artikel |
8 |
Graph coloring on coarse grained multicomputers
|
Gebremedhin, Assefaw Hadish |
|
2003 |
131 |
1 |
p. 179-198 20 p. |
artikel |
9 |
Guide for authors
|
|
|
2003 |
131 |
1 |
p. I-IV nvt p. |
artikel |
10 |
MAD trees and distance-hereditary graphs
|
Dahlhaus, E. |
|
2003 |
131 |
1 |
p. 151-167 17 p. |
artikel |
11 |
Maximum independent set and maximum clique algorithms for overlap graphs
|
Čenek, Eowyn |
|
2003 |
131 |
1 |
p. 77-91 15 p. |
artikel |
12 |
On the approximability of average completion time scheduling under precedence constraints
|
Woeginger, Gerhard J |
|
2003 |
131 |
1 |
p. 237-252 16 p. |
artikel |
13 |
Preface
|
Kratsch, D |
|
2003 |
131 |
1 |
p. 1- 1 p. |
artikel |
14 |
Query efficient implementation of graphs of bounded clique-width
|
Courcelle, B. |
|
2003 |
131 |
1 |
p. 129-150 22 p. |
artikel |
15 |
Splitting a graph into disjoint induced paths or cycles
|
Le, Hoàng-Oanh |
|
2003 |
131 |
1 |
p. 199-212 14 p. |
artikel |
16 |
Stability number of bull- and chair-free graphs revisited
|
Brandstädt, Andreas |
|
2003 |
131 |
1 |
p. 39-50 12 p. |
artikel |
17 |
The complexity of minimizing certain cost metrics for k-source spanning trees
|
Connamacher, Harold S. |
|
2003 |
131 |
1 |
p. 113-127 15 p. |
artikel |
18 |
The complexity of the locally connected spanning tree problem
|
Cai, Leizhen |
|
2003 |
131 |
1 |
p. 63-75 13 p. |
artikel |
19 |
The task allocation problem with constant communication
|
Fernandez de la Vega, W. |
|
2003 |
131 |
1 |
p. 169-177 9 p. |
artikel |