| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A subexponential-time algorithm for the Maximum Independent Set Problem in P t -free graphs
|
Brause, Christoph
|
|
2017
|
231 |
C |
p. 113-118
6 p.
|
artikel
|
| 2 |
A tight lower bound for Vertex Planarization on graphs of bounded treewidth
|
Pilipczuk, Marcin
|
|
2017
|
231 |
C |
p. 211-216
6 p.
|
artikel
|
| 3 |
Characterizations of ( 4 K 1 , C 4 , C 5 )-free graphs
|
Fraser, Dallas J.
|
|
2017
|
231 |
C |
p. 166-174
9 p.
|
artikel
|
| 4 |
Colorful edge decomposition of graphs: Some polynomial cases
|
Dehghan, Ali
|
|
2017
|
231 |
C |
p. 155-165
11 p.
|
artikel
|
| 5 |
4-coloring ( P 6 , bull ) -free graphs
|
Maffray, Frédéric
|
|
2017
|
231 |
C |
p. 198-210
13 p.
|
artikel
|
| 6 |
Contents
|
|
|
2017
|
231 |
C |
p. v-vi
nvt p.
|
artikel
|
| 7 |
From matchings to independent sets
|
Lozin, Vadim
|
|
2017
|
231 |
C |
p. 4-14
11 p.
|
artikel
|
| 8 |
F -WORM colorings: Results for 2 -connected graphs
|
Bujtás, Csilla
|
|
2017
|
231 |
C |
p. 131-138
8 p.
|
artikel
|
| 9 |
Good characterizations and linear time recognition for 2-probe block graphs
|
Le, Van Bang
|
|
2017
|
231 |
C |
p. 181-189
9 p.
|
artikel
|
| 10 |
Linear kernels for k -tuple and liar’s domination in bounded genus graphs
|
Bishnu, Arijit
|
|
2017
|
231 |
C |
p. 67-77
11 p.
|
artikel
|
| 11 |
On bounding the difference between the maximum degree and the chromatic number by a constant
|
Weil, Vera
|
|
2017
|
231 |
C |
p. 228-234
7 p.
|
artikel
|
| 12 |
On the strong Roman domination number of graphs
|
Álvarez-Ruiz, M.P.
|
|
2017
|
231 |
C |
p. 44-59
16 p.
|
artikel
|
| 13 |
Preface: Algorithmic Graph Theory on the Adriatic Coast
|
Brešar, Boštjan
|
|
2017
|
231 |
C |
p. 1-3
3 p.
|
artikel
|
| 14 |
Pseudoachromatic and connected-pseudoachromatic indices of the complete graph
|
Araujo-Pardo, M. Gabriela
|
|
2017
|
231 |
C |
p. 60-66
7 p.
|
artikel
|
| 15 |
Rank-width: Algorithmic and structural results
|
Oum, Sang-il
|
|
2017
|
231 |
C |
p. 15-24
10 p.
|
artikel
|
| 16 |
Recent techniques and results on the Erdős–Pósa property
|
Raymond, Jean-Florent
|
|
2017
|
231 |
C |
p. 25-43
19 p.
|
artikel
|
| 17 |
Regular coronoids and 4-tilings
|
Vesel, Aleksander
|
|
2017
|
231 |
C |
p. 217-227
11 p.
|
artikel
|
| 18 |
Rerouting shortest paths in planar graphs
|
Bonsma, Paul
|
|
2017
|
231 |
C |
p. 95-112
18 p.
|
artikel
|
| 19 |
Solving all-pairs shortest path by single-source computations: Theory and practice
|
Brodnik, Andrej
|
|
2017
|
231 |
C |
p. 119-130
12 p.
|
artikel
|
| 20 |
The Degree/Diameter Problem for mixed abelian Cayley graphs
|
López, Nacho
|
|
2017
|
231 |
C |
p. 190-197
8 p.
|
artikel
|
| 21 |
The Graph Motif problem parameterized by the structure of the input graph
|
Bonnet, Édouard
|
|
2017
|
231 |
C |
p. 78-94
17 p.
|
artikel
|
| 22 |
The shortest connection game
|
Darmann, Andreas
|
|
2017
|
231 |
C |
p. 139-154
16 p.
|
artikel
|
| 23 |
Two more characterizations of König–Egerváry graphs
|
Jarden, Adi
|
|
2017
|
231 |
C |
p. 175-180
6 p.
|
artikel
|
Tijdschrift beschrijving