| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression
|
Sakai, Takayuki
|
|
2019
|
105 |
C |
p. 87-103
|
artikel
|
| 2 |
Calculi for symmetric queries
|
Gyssens, Marc
|
|
2019
|
105 |
C |
p. 54-86
|
artikel
|
| 3 |
Deterministic regular expressions with back-references
|
Freydenberger, Dominik D.
|
|
2019
|
105 |
C |
p. 1-39
|
artikel
|
| 4 |
Editorial Board
|
|
|
2019
|
105 |
C |
p. ii
|
artikel
|
| 5 |
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
|
Park, Jung-Heum
|
|
2019
|
105 |
C |
p. 104-115
|
artikel
|
| 6 |
Generalized satisfiability problems via operator assignments
|
Atserias, Albert
|
|
2019
|
105 |
C |
p. 171-198
|
artikel
|
| 7 |
k-Majority digraphs and the hardness of voting with a constant number of voters
|
Bachmeier, Georg
|
|
2019
|
105 |
C |
p. 130-157
|
artikel
|
| 8 |
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
|
Eiben, Eduard
|
|
2019
|
105 |
C |
p. 158-170
|
artikel
|
| 9 |
On notions of distortion and an almost minimum spanning tree with constant average distortion
|
Bartal, Yair
|
|
2019
|
105 |
C |
p. 116-129
|
artikel
|
| 10 |
Space complexity of reachability testing in labelled graphs
|
Ramaswamy, Vidhya
|
|
2019
|
105 |
C |
p. 40-53
|
artikel
|
| 11 |
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs
|
Demaine, Erik D.
|
|
2019
|
105 |
C |
p. 199-241
|
artikel
|
Tijdschrift beschrijving