| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms for optimal outlier removal
|
Atanassov, Rossen
|
|
2009
|
7 |
2 |
p. 239-248
10 p.
|
artikel
|
| 2 |
Boolean circuit programming: A new paradigm to design parallel algorithms
|
Park, Kunsoo
|
|
2009
|
7 |
2 |
p. 267-277
11 p.
|
artikel
|
| 3 |
Discovering subword associations in strings in time linear in the output size
|
Apostolico, Alberto
|
|
2009
|
7 |
2 |
p. 227-238
12 p.
|
artikel
|
| 4 |
Editorial
|
Broersma, Hajo
|
|
2009
|
7 |
2 |
p. 147-
1 p.
|
artikel
|
| 5 |
Editorial Board
|
|
|
2009
|
7 |
2 |
p. iii-iv
nvt p.
|
artikel
|
| 6 |
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
|
Razgon, Igor
|
|
2009
|
7 |
2 |
p. 191-212
22 p.
|
artikel
|
| 7 |
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
|
Jothi, Raja
|
|
2009
|
7 |
2 |
p. 249-255
7 p.
|
artikel
|
| 8 |
On the guessing number of shift graphs
|
Wu, Taoyang
|
|
2009
|
7 |
2 |
p. 220-226
7 p.
|
artikel
|
| 9 |
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
|
Spoerhase, J.
|
|
2009
|
7 |
2 |
p. 256-266
11 p.
|
artikel
|
| 10 |
Parameterized complexity of finding regular induced subgraphs
|
Moser, Hannes
|
|
2009
|
7 |
2 |
p. 181-190
10 p.
|
artikel
|
| 11 |
Sampling Eulerian orientations of triangular lattice graphs
|
Creed, Páidí
|
|
2009
|
7 |
2 |
p. 168-180
13 p.
|
artikel
|
| 12 |
Stable marriage with ties and bounded length preference lists
|
Irving, Robert W.
|
|
2009
|
7 |
2 |
p. 213-219
7 p.
|
artikel
|
| 13 |
Vertex and edge covers with clustering properties: Complexity and algorithms
|
Fernau, Henning
|
|
2009
|
7 |
2 |
p. 149-167
19 p.
|
artikel
|
Tijdschrift beschrijving