| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms for hierarchical and semi-partitioned parallel scheduling
|
Bonifaci, Vincenzo
|
|
|
120 |
C |
p. 116-136
|
artikel
|
| 2 |
Analytic methods for reachability problems
|
Protasov, Vladimir Yu.
|
|
|
120 |
C |
p. 1-13
|
artikel
|
| 3 |
Bivariate B-splines from convex configurations
|
Schmitt, Dominique
|
|
|
120 |
C |
p. 42-61
|
artikel
|
| 4 |
Closure and nonclosure properties of the classes of compressible and rankable sets
|
Abascal, Jackson
|
|
|
120 |
C |
p. 162-176
|
artikel
|
| 5 |
Editorial Board
|
|
|
|
120 |
C |
p. ii
|
artikel
|
| 6 |
Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019)
|
Gąsieniec, Leszek
|
|
|
120 |
C |
p. 177-178
|
artikel
|
| 7 |
Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key
|
Chen, Wenbin
|
|
|
120 |
C |
p. 137-148
|
artikel
|
| 8 |
On the termination and structural termination problems for counter machines with incrementing errors
|
Hampson, Christopher
|
|
|
120 |
C |
p. 149-161
|
artikel
|
| 9 |
Reducing graph transversals via edge contractions
|
Lima, Paloma T.
|
|
|
120 |
C |
p. 62-74
|
artikel
|
| 10 |
Sliding window temporal graph coloring
|
Mertzios, George B.
|
|
|
120 |
C |
p. 97-115
|
artikel
|
| 11 |
The complexity of the parity argument with potential
|
Ishizuka, Takashi
|
|
|
120 |
C |
p. 14-41
|
artikel
|
| 12 |
The temporal explorer who returns to the base
|
Akrida, Eleni C.
|
|
|
120 |
C |
p. 179-193
|
artikel
|
| 13 |
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors
|
Bulteau, Laurent
|
|
|
120 |
C |
p. 75-96
|
artikel
|
Tijdschrift beschrijving