nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
|
Björklund, Henrik |
|
2007 |
155 |
2 |
p. 210-229 20 p. |
artikel |
2 |
Agent-based randomized broadcasting in large networks
|
Elsässer, Robert |
|
2007 |
155 |
2 |
p. 150-160 11 p. |
artikel |
3 |
Approximating Boolean functions by OBDDs
|
Gronemeier, Andre |
|
2007 |
155 |
2 |
p. 194-209 16 p. |
artikel |
4 |
Approximating earliest arrival flows with flow-dependent transit times
|
Baumann, Nadine |
|
2007 |
155 |
2 |
p. 161-171 11 p. |
artikel |
5 |
Complexity results in graph reconstruction
|
Hemaspaandra, Edith |
|
2007 |
155 |
2 |
p. 103-118 16 p. |
artikel |
6 |
Contents
|
|
|
2007 |
155 |
2 |
p. vii-viii nvt p. |
artikel |
7 |
Editorial
|
Kratochvíl, Jan |
|
2007 |
155 |
2 |
p. 79-80 2 p. |
artikel |
8 |
Editorial Board
|
|
|
2007 |
155 |
2 |
p. v-vi nvt p. |
artikel |
9 |
Eliminating graphs by means of parallel knock-out schemes
|
Broersma, Hajo |
|
2007 |
155 |
2 |
p. 92-102 11 p. |
artikel |
10 |
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
|
Khachiyan, Leonid |
|
2007 |
155 |
2 |
p. 137-149 13 p. |
artikel |
11 |
Guest editors
|
|
|
2007 |
155 |
2 |
p. 81- 1 p. |
artikel |
12 |
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
|
Chlebík, Miroslav |
|
2007 |
155 |
2 |
p. 172-179 8 p. |
artikel |
13 |
Packing directed cycles efficiently
|
Nutov, Zeev |
|
2007 |
155 |
2 |
p. 82-91 10 p. |
artikel |
14 |
Polynomial time approximation schemes and parameterized complexity
|
Chen, Jianer |
|
2007 |
155 |
2 |
p. 180-193 14 p. |
artikel |
15 |
Protein folding in the HP model on grid lattices with diagonals
|
Böckenhauer, Hans-Joachim |
|
2007 |
155 |
2 |
p. 230-256 27 p. |
artikel |
16 |
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
|
Caragiannis, Ioannis |
|
2007 |
155 |
2 |
p. 119-136 18 p. |
artikel |