nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Aiding exploratory testing with pruned GUI models
|
Reis, Jacinto |
|
2018 |
133 |
C |
p. 49-55 |
artikel |
2 |
A note on hardness of diameter approximation
|
Bringmann, Karl |
|
2018 |
133 |
C |
p. 10-15 |
artikel |
3 |
A short note on the complexity of computing strong pathbreadth
|
Ducoffe, Guillaume |
|
2018 |
133 |
C |
p. 56-58 |
artikel |
4 |
Balancedness of MSO transductions in polynomial time
|
Maneth, S. |
|
2018 |
133 |
C |
p. 26-32 |
artikel |
5 |
Compositional and local livelock analysis for CSP
|
Conserva Filho, M.S. |
|
2018 |
133 |
C |
p. 21-25 |
artikel |
6 |
Editorial Board
|
|
|
2018 |
133 |
C |
p. ii |
artikel |
7 |
Enumerating maximal cliques in link streams with durations
|
Viard, Tiphaine |
|
2018 |
133 |
C |
p. 44-48 |
artikel |
8 |
On deterministic rendezvous at a node of agents with arbitrary velocities
|
Bouchard, Sébastien |
|
2018 |
133 |
C |
p. 39-43 |
artikel |
9 |
Path multicoloring in spider graphs with even color multiplicity
|
Bampas, Evangelos |
|
2018 |
133 |
C |
p. 1-4 |
artikel |
10 |
rDAN: Toward robust demand-aware network designs
|
Avin, Chen |
|
2018 |
133 |
C |
p. 5-9 |
artikel |
11 |
The choice and agreement problems of a random function
|
Meir, Or |
|
2018 |
133 |
C |
p. 16-20 |
artikel |
12 |
Upper bounds for minimum dilation triangulation in two special cases
|
Sattari, Sattar |
|
2018 |
133 |
C |
p. 33-38 |
artikel |