nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new characterization of P 6 -free graphs
|
van ’t Hof, Pim |
|
2010 |
158 |
7 |
p. 731-740 10 p. |
artikel |
2 |
Characterizing and computing minimal cograph completions
|
Lokshtanov, Daniel |
|
2010 |
158 |
7 |
p. 755-764 10 p. |
artikel |
3 |
Complexity of the packing coloring problem for trees
|
Fiala, Jiří |
|
2010 |
158 |
7 |
p. 771-778 8 p. |
artikel |
4 |
Contents
|
|
|
2010 |
158 |
7 |
p. v-vi nvt p. |
artikel |
5 |
Dynamic programming and planarity: Improved tree-decomposition based algorithms
|
Dorn, Frederic |
|
2010 |
158 |
7 |
p. 800-808 9 p. |
artikel |
6 |
Finding a maximum-weight induced k -partite subgraph of an i -triangulated graph
|
Addario-Berry, Louigi |
|
2010 |
158 |
7 |
p. 765-770 6 p. |
artikel |
7 |
Guest Editors’ Foreword
|
Heggernes, Pinar |
|
2010 |
158 |
7 |
p. 729-730 2 p. |
artikel |
8 |
H -join decomposable graphs and algorithms with runtime single exponential in rankwidth
|
Bui-Xuan, Binh-Minh |
|
2010 |
158 |
7 |
p. 809-819 11 p. |
artikel |
9 |
Minimum fill-in and treewidth of split + k e and split + k v graphs
|
Mancini, Federico |
|
2010 |
158 |
7 |
p. 747-754 8 p. |
artikel |
10 |
O ( m log n ) split decomposition of strongly-connected graphs
|
Joeris, Benson L. |
|
2010 |
158 |
7 |
p. 779-799 21 p. |
artikel |
11 |
On a disparity between relative cliquewidth and relative NLC-width
|
Müller, Haiko |
|
2010 |
158 |
7 |
p. 828-840 13 p. |
artikel |
12 |
On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width
|
Ganian, Robert |
|
2010 |
158 |
7 |
p. 851-867 17 p. |
artikel |
13 |
On the complexity of computing treelength
|
Lokshtanov, Daniel |
|
2010 |
158 |
7 |
p. 820-827 8 p. |
artikel |
14 |
Recognizing digraphs of Kelly-width 2
|
Meister, Daniel |
|
2010 |
158 |
7 |
p. 741-746 6 p. |
artikel |
15 |
The rank-width of the square grid
|
Jelínek, Vít |
|
2010 |
158 |
7 |
p. 841-850 10 p. |
artikel |