nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A decomposition theorem and two algorithms for reticulation-visible networks
|
Gunawan, Andreas D.M. |
|
2017 |
252 |
C |
p. 161-175 15 p. |
artikel |
2 |
A new pumping lemma for indexed languages, with an application to infinite words
|
Smith, Tim |
|
2017 |
252 |
C |
p. 176-186 11 p. |
artikel |
3 |
Counting branches in trees using games
|
Carayol, Arnaud |
|
2017 |
252 |
C |
p. 221-242 22 p. |
artikel |
4 |
Deadlock analysis of unbounded process networks
|
Kobayashi, Naoki |
|
2017 |
252 |
C |
p. 48-70 23 p. |
artikel |
5 |
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
|
Li, Wenjun |
|
2017 |
252 |
C |
p. 187-200 14 p. |
artikel |
6 |
Editorial Board
|
|
|
2017 |
252 |
C |
p. i- 1 p. |
artikel |
7 |
Editorial Board
|
|
|
2017 |
252 |
C |
p. IFC- 1 p. |
artikel |
8 |
Exclusive graph searching vs. pathwidth
|
Markou, Euripides |
|
2017 |
252 |
C |
p. 243-260 18 p. |
artikel |
9 |
Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
|
Greco, Gianluigi |
|
2017 |
252 |
C |
p. 201-220 20 p. |
artikel |
10 |
Lost in abstraction: Monotonicity in multi-threaded programs
|
Kaiser, Alexander |
|
2017 |
252 |
C |
p. 30-47 18 p. |
artikel |
11 |
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability
|
Konnov, Igor |
|
2017 |
252 |
C |
p. 95-109 15 p. |
artikel |
12 |
Preface
|
Baldan, Paolo |
|
2017 |
252 |
C |
p. 1- 1 p. |
artikel |
13 |
Quantitative simulations by matrices
|
Urabe, Natsuki |
|
2017 |
252 |
C |
p. 110-137 28 p. |
artikel |
14 |
The Calculus of Signal Flow Diagrams I: Linear relations on streams
|
Bonchi, Filippo |
|
2017 |
252 |
C |
p. 2-29 28 p. |
artikel |
15 |
The parameterized complexity of k-edge induced subgraphs
|
Lin, Bingkai |
|
2017 |
252 |
C |
p. 138-160 23 p. |
artikel |
16 |
Well-structured graph transformation systems
|
König, Barbara |
|
2017 |
252 |
C |
p. 71-94 24 p. |
artikel |