| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree
|
Iyer, K. Viswanathan
|
|
2009
|
109 |
11 |
p. 560-562
3 p.
|
artikel
|
| 2 |
An aggressive algorithm for multiple string matching
|
Dai, Liuling
|
|
2009
|
109 |
11 |
p. 553-559
7 p.
|
artikel
|
| 3 |
Analyzing scheduling with transient failures
|
Saule, Erik
|
|
2009
|
109 |
11 |
p. 539-542
4 p.
|
artikel
|
| 4 |
A note on some collapse results of valued constraints
|
Zanuttini, Bruno
|
|
2009
|
109 |
11 |
p. 534-538
5 p.
|
artikel
|
| 5 |
A polynomial algorithm for the multiple knapsack problem with divisible item sizes
|
Detti, Paolo
|
|
2009
|
109 |
11 |
p. 582-584
3 p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
2009
|
109 |
11 |
p. IFC-
1 p.
|
artikel
|
| 7 |
Flaws in some self-healing key distribution schemes with revocation
|
Daza, Vanesa
|
|
2009
|
109 |
11 |
p. 523-526
4 p.
|
artikel
|
| 8 |
Fully CCA2 secure identity based broadcast encryption without random oracles
|
Ren, Yanli
|
|
2009
|
109 |
11 |
p. 527-533
7 p.
|
artikel
|
| 9 |
Integer programming with 2-variable equations and 1-variable inequalities
|
Bodirsky, Manuel
|
|
2009
|
109 |
11 |
p. 572-575
4 p.
|
artikel
|
| 10 |
New lower bounds for online k-server routing problems
|
Fink, Irene
|
|
2009
|
109 |
11 |
p. 563-567
5 p.
|
artikel
|
| 11 |
On the two-dimensional cow search problem
|
Jeż, Artur
|
|
2009
|
109 |
11 |
p. 543-547
5 p.
|
artikel
|
| 12 |
Strong equivalence of logic programs under the infinite-valued semantics
|
Nomikos, Christos
|
|
2009
|
109 |
11 |
p. 576-581
6 p.
|
artikel
|
| 13 |
The Fermat star of binary trees
|
Luccio, Fabrizio
|
|
2009
|
109 |
11 |
p. 568-571
4 p.
|
artikel
|
| 14 |
Time-varying PSO – convergence analysis, convergence-related parameterization and new parameter adjustment schemes
|
Rapaić, Milan R.
|
|
2009
|
109 |
11 |
p. 548-552
5 p.
|
artikel
|
Tijdschrift beschrijving