| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Θ ( log n ) -approximation for the set cover problem with set ownership
|
Gonen, Mira
|
|
2009
|
109 |
3 |
p. 183-186
4 p.
|
artikel
|
| 2 |
A note on on-line broadcast scheduling with deadlines
|
Han, Xin
|
|
2009
|
109 |
3 |
p. 204-207
4 p.
|
artikel
|
| 3 |
Approximating optimum branchings in linear time
|
Ziegler, Valentin
|
|
2009
|
109 |
3 |
p. 175-178
4 p.
|
artikel
|
| 4 |
Deterministically testing sparse polynomial identities of unbounded degree
|
Bläser, Markus
|
|
2009
|
109 |
3 |
p. 187-192
6 p.
|
artikel
|
| 5 |
Editorial Board
|
|
|
2009
|
109 |
3 |
p. IFC-
1 p.
|
artikel
|
| 6 |
Minimal k-rankings and the rank number of P n 2
|
Novotny, Sarah
|
|
2009
|
109 |
3 |
p. 193-198
6 p.
|
artikel
|
| 7 |
On some open problems in reflective inductive inference
|
Jain, Sanjay
|
|
2009
|
109 |
3 |
p. 208-211
4 p.
|
artikel
|
| 8 |
Optimal algorithms for the average-constrained maximum-sum segment problem
|
Cheng, Chih-Huai
|
|
2009
|
109 |
3 |
p. 171-174
4 p.
|
artikel
|
| 9 |
The Mailman algorithm: A note on matrix–vector multiplication
|
Liberty, Edo
|
|
2009
|
109 |
3 |
p. 179-182
4 p.
|
artikel
|
| 10 |
( 2 , 1 ) -Total labelling of trees with sparse vertices of maximum degree
|
Huang, Jing
|
|
2009
|
109 |
3 |
p. 199-203
5 p.
|
artikel
|
Tijdschrift beschrijving