nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Communication and location discovery in geometric ring networks
|
Gąsieniec, Leszek |
|
2019 |
266 |
C |
p. 19-48 |
artikel |
2 |
Counting hypergraph matchings up to uniqueness threshold
|
Song, Renjie |
|
2019 |
266 |
C |
p. 75-96 |
artikel |
3 |
Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
|
Bresolin, D. |
|
2019 |
266 |
C |
p. 97-125 |
artikel |
4 |
Editorial Board
|
|
|
2019 |
266 |
C |
p. ii |
artikel |
5 |
Finding maximal 2-dimensional palindromes
|
Geizhals, Sara H. |
|
2019 |
266 |
C |
p. 161-172 |
artikel |
6 |
Hardest languages for conjunctive and Boolean grammars
|
Okhotin, Alexander |
|
2019 |
266 |
C |
p. 1-18 |
artikel |
7 |
Limited automata and unary languages
|
Pighizzini, Giovanni |
|
2019 |
266 |
C |
p. 60-74 |
artikel |
8 |
On-line weighted pattern matching
|
Charalampopoulos, Panagiotis |
|
2019 |
266 |
C |
p. 49-59 |
artikel |
9 |
Sublogics of a branching time logic of robustness
|
McCabe-Dansted, John |
|
2019 |
266 |
C |
p. 126-160 |
artikel |