nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Approximate search strategies for weighted trees
|
Dereniowski, Dariusz |
|
2012 |
463 |
C |
p. 96-113 18 p. |
artikel |
2 |
Chordal digraphs
|
Meister, Daniel |
|
2012 |
463 |
C |
p. 73-83 11 p. |
artikel |
3 |
Continuous monitoring in the dynamic sensor field model
|
Àlvarez, C. |
|
2012 |
463 |
C |
p. 114-122 9 p. |
artikel |
4 |
Editorial Board
|
|
|
2012 |
463 |
C |
p. iii-viii nvt p. |
artikel |
5 |
Entanglement and the complexity of directed graphs
|
Berwanger, Dietmar |
|
2012 |
463 |
C |
p. 2-25 24 p. |
artikel |
6 |
Foreword: Special Issue on Theory and Applications of Graph Searching Problems
|
Fomin, Fedor V. |
|
2012 |
463 |
C |
p. 1- 1 p. |
artikel |
7 |
Hypertree-depth and minors in hypergraphs
|
Adler, Isolde |
|
2012 |
463 |
C |
p. 84-95 12 p. |
artikel |
8 |
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
|
Safari, MohammadAli |
|
2012 |
463 |
C |
p. 26-34 9 p. |
artikel |
9 |
Locating a robber on a graph via distance queries
|
Carraher, James |
|
2012 |
463 |
C |
p. 54-61 8 p. |
artikel |
10 |
Online graph exploration: New results on old and new algorithms
|
Megow, Nicole |
|
2012 |
463 |
C |
p. 62-72 11 p. |
artikel |
11 |
polish—Let us play the cleaning game
|
Gordinowicz, Przemysław |
|
2012 |
463 |
C |
p. 123-132 10 p. |
artikel |
12 |
Revolutionaries and spies: Spy-good and spy-bad graphs
|
Butterfield, Jane V. |
|
2012 |
463 |
C |
p. 35-53 19 p. |
artikel |
13 |
Some remarks on cops and drunk robbers
|
Kehagias, Athanasios |
|
2012 |
463 |
C |
p. 133-147 15 p. |
artikel |