nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Characterizing graphs of maximum matching width at most 2
|
Jeong, Jisu |
|
2018 |
248 |
C |
p. 102-113 |
artikel |
2 |
Computing square roots of graphs with low maximum degree
|
Cochefert, Manfred |
|
2018 |
248 |
C |
p. 93-101 |
artikel |
3 |
Editorial Board
|
|
|
2018 |
248 |
C |
p. ii |
artikel |
4 |
Exact algorithms for weak Roman domination
|
Chapelle, Mathieu |
|
2018 |
248 |
C |
p. 79-92 |
artikel |
5 |
From tree-decompositions to clique-width terms
|
Courcelle, Bruno |
|
2018 |
248 |
C |
p. 125-144 |
artikel |
6 |
Infinitely many minimal classes of graphs of unbounded clique-width
|
Collins, A. |
|
2018 |
248 |
C |
p. 145-152 |
artikel |
7 |
Lower bounds on the mim-width of some graph classes
|
Mengel, Stefan |
|
2018 |
248 |
C |
p. 28-32 |
artikel |
8 |
Maximum matching width: New characterizations and a fast algorithm for dominating set
|
Jeong, Jisu |
|
2018 |
248 |
C |
p. 114-124 |
artikel |
9 |
Meta-kernelization using well-structured modulators
|
Eiben, Eduard |
|
2018 |
248 |
C |
p. 153-167 |
artikel |
10 |
On polygon numbers of circle graphs and distance hereditary graphs
|
Stewart, Lorna |
|
2018 |
248 |
C |
p. 3-17 |
artikel |
11 |
Parameterized complexity of distance labeling and uniform channel assignment problems
|
Fiala, Jiří |
|
2018 |
248 |
C |
p. 46-55 |
artikel |
12 |
Parameterized Edge Hamiltonicity
|
Lampis, Michael |
|
2018 |
248 |
C |
p. 68-78 |
artikel |
13 |
Parameterized extension complexity of independent set and related problems
|
Gajarský, Jakub |
|
2018 |
248 |
C |
p. 56-67 |
artikel |
14 |
1 -perfectly orientable K 4 -minor-free and outerplanar graphs
|
Brešar, Boštjan |
|
2018 |
248 |
C |
p. 33-45 |
artikel |
15 |
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015
|
Corneil, Derek |
|
2018 |
248 |
C |
p. 1-2 |
artikel |
16 |
Well-quasi-ordering H -contraction-free graphs
|
Kamiński, Marcin |
|
2018 |
248 |
C |
p. 18-27 |
artikel |