nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Approximating the path-distance-width for AT-free graphs and graphs in related classes
|
Otachi, Yota |
|
2014 |
168 |
C |
p. 69-77 9 p. |
artikel |
2 |
Contents
|
|
|
2014 |
168 |
C |
p. v-vi nvt p. |
artikel |
3 |
Digraphs of bounded elimination width
|
Fernau, Henning |
|
2014 |
168 |
C |
p. 78-87 10 p. |
artikel |
4 |
Digraph width measures in parameterized algorithmics
|
Ganian, Robert |
|
2014 |
168 |
C |
p. 88-107 20 p. |
artikel |
5 |
Graphs of small rank-width are pivot-minors of graphs of small tree-width
|
Kwon, O-joung |
|
2014 |
168 |
C |
p. 108-118 11 p. |
artikel |
6 |
Guest editors’ foreword
|
Heggernes, Pinar |
|
2014 |
168 |
C |
p. 1-2 2 p. |
artikel |
7 |
Obstructions for linear rank-width at most 1
|
Adler, Isolde |
|
2014 |
168 |
C |
p. 3-13 11 p. |
artikel |
8 |
On opposition graphs, coalition graphs, and bipartite permutation graphs
|
Le, Van Bang |
|
2014 |
168 |
C |
p. 26-33 8 p. |
artikel |
9 |
On the tree-depth of random graphs
|
Perarnau, G. |
|
2014 |
168 |
C |
p. 119-126 8 p. |
artikel |
10 |
Packing bipartite graphs with covers of complete bipartite graphs
|
Chalopin, Jérémie |
|
2014 |
168 |
C |
p. 40-50 11 p. |
artikel |
11 |
Solving Capacitated Dominating Set by using covering by subsets and maximum matching
|
Liedloff, Mathieu |
|
2014 |
168 |
C |
p. 60-68 9 p. |
artikel |
12 |
Square roots of minor closed graph classes
|
Nestoridis, Nestor V. |
|
2014 |
168 |
C |
p. 34-39 6 p. |
artikel |
13 |
The complexity of register allocation
|
Krause, Philipp Klaus |
|
2014 |
168 |
C |
p. 51-59 9 p. |
artikel |
14 |
The vertex leafage of chordal graphs
|
Chaplick, Steven |
|
2014 |
168 |
C |
p. 14-25 12 p. |
artikel |