| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Turing kernelization dichotomy for structural parameterizations of F -Minor-Free Deletion
|
Donkers, Huib
|
|
|
119 |
C |
p. 164-182
|
artikel
|
| 2 |
Bidding mechanisms in graph games
|
Avni, Guy
|
|
|
119 |
C |
p. 133-144
|
artikel
|
| 3 |
Bisection of bounded treewidth graphs by convolutions
|
Eiben, Eduard
|
|
|
119 |
C |
p. 125-132
|
artikel
|
| 4 |
Deleting edges to restrict the size of an epidemic in temporal networks
|
Enright, Jessica
|
|
|
119 |
C |
p. 60-77
|
artikel
|
| 5 |
Descriptive complexity of deterministic polylogarithmic time and space
|
Ferrarotti, Flavio
|
|
|
119 |
C |
p. 145-163
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
119 |
C |
p. ii
|
artikel
|
| 7 |
Editorial – Special issue on Concurrency Theory (CONCUR 2018)
|
Schewe, Sven
|
|
|
119 |
C |
p. 19-20
|
artikel
|
| 8 |
Nominal syntax with atom substitutions
|
Domínguez, Jesús
|
|
|
119 |
C |
p. 34-59
|
artikel
|
| 9 |
On relevant equilibria in reachability games
|
Brihaye, Thomas
|
|
|
119 |
C |
p. 211-230
|
artikel
|
| 10 |
On temporal graph exploration
|
Erlebach, Thomas
|
|
|
119 |
C |
p. 1-18
|
artikel
|
| 11 |
Optimal channel utilization with limited feedback
|
De Marco, Gianluca
|
|
|
119 |
C |
p. 21-33
|
artikel
|
| 12 |
Regularizing conjunctive features for classification
|
Barceló, Pablo
|
|
|
119 |
C |
p. 97-124
|
artikel
|
| 13 |
The complexity of reachability in parametric Markov decision processes
|
Junges, Sebastian
|
|
|
119 |
C |
p. 183-210
|
artikel
|
| 14 |
When are emptiness and containment decidable for probabilistic automata?
|
Daviaud, Laure
|
|
|
119 |
C |
p. 78-96
|
artikel
|
Tijdschrift beschrijving