nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An extension of the Moran process using type-specific connection graphs
|
Melissourgos, Themistoklis |
|
|
124 |
C |
p. 77-96 |
artikel |
2 |
Approximate CVP p in time 20.802n
|
Eisenbrand, Friedrich |
|
|
124 |
C |
p. 129-139 |
artikel |
3 |
Editorial Board
|
|
|
|
124 |
C |
p. ii |
artikel |
4 |
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
|
Bläsius, Thomas |
|
|
124 |
C |
p. 192-213 |
artikel |
5 |
Fine-grained complexity of rainbow coloring and its variants
|
Agrawal, Akanksha |
|
|
124 |
C |
p. 140-158 |
artikel |
6 |
(In)approximability of maximum minimal FVS
|
Dublois, Louis |
|
|
124 |
C |
p. 26-40 |
artikel |
7 |
Induced Disjoint Paths in AT-free graphs
|
Golovach, Petr A. |
|
|
124 |
C |
p. 170-191 |
artikel |
8 |
Intersection joins under updates
|
Tao, Yufei |
|
|
124 |
C |
p. 41-64 |
artikel |
9 |
Many-visits TSP revisited
|
Kowalik, Łukasz |
|
|
124 |
C |
p. 112-128 |
artikel |
10 |
More on change-making and related problems
|
Chan, Timothy M. |
|
|
124 |
C |
p. 159-169 |
artikel |
11 |
Normalized information distance and the oscillation hierarchy
|
Ambos-Spies, Klaus |
|
|
124 |
C |
p. 65-76 |
artikel |
12 |
On the threshold of intractability
|
Drange, Pål Grønås |
|
|
124 |
C |
p. 1-25 |
artikel |
13 |
Single-source shortest paths and strong connectivity in dynamic planar graphs
|
Charalampopoulos, Panagiotis |
|
|
124 |
C |
p. 97-111 |
artikel |
14 |
The tree-generative capacity of combinatory categorial grammars
|
Kuhlmann, Marco |
|
|
124 |
C |
p. 214-233 |
artikel |