nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A 3-approximation algorithm for the subtree distance between phylogenies
|
Bordewich, Magnus |
|
2008 |
6 |
3 |
p. 458-471 14 p. |
artikel |
2 |
An approximation algorithm for sorting by reversals and transpositions
|
Rahman, Atif |
|
2008 |
6 |
3 |
p. 449-457 9 p. |
artikel |
3 |
A note on two source location problems
|
Kortsarz, Guy |
|
2008 |
6 |
3 |
p. 520-525 6 p. |
artikel |
4 |
A parallel extended GCD algorithm
|
Sedjelmaci, Sidi Mohamed |
|
2008 |
6 |
3 |
p. 526-538 13 p. |
artikel |
5 |
Approximate colored range and point enclosure queries
|
Lai, Ying Kit |
|
2008 |
6 |
3 |
p. 420-432 13 p. |
artikel |
6 |
Approximate labelled subtree homeomorphism
|
Pinter, Ron Y. |
|
2008 |
6 |
3 |
p. 480-496 17 p. |
artikel |
7 |
Approximating the traffic grooming problem
|
Flammini, Michele |
|
2008 |
6 |
3 |
p. 472-479 8 p. |
artikel |
8 |
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
|
Bazgan, Cristina |
|
2008 |
6 |
3 |
p. 510-519 10 p. |
artikel |
9 |
Editorial Board
|
|
|
2008 |
6 |
3 |
p. iii-iv nvt p. |
artikel |
10 |
Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
|
Nitin, |
|
2008 |
6 |
3 |
p. 353-380 28 p. |
artikel |
11 |
Fast equation automaton computation
|
Khorsi, Ahmed |
|
2008 |
6 |
3 |
p. 433-448 16 p. |
artikel |
12 |
Fast parameterized matching with q-grams
|
Salmela, Leena |
|
2008 |
6 |
3 |
p. 408-419 12 p. |
artikel |
13 |
Lossless filter for multiple repetitions with Hamming distance
|
Peterlongo, Pierre |
|
2008 |
6 |
3 |
p. 497-509 13 p. |
artikel |
14 |
On minimum k-modal partitions of permutations
|
Di Stefano, Gabriele |
|
2008 |
6 |
3 |
p. 381-392 12 p. |
artikel |
15 |
Red-blue covering problems and the consecutive ones property
|
Dom, Michael |
|
2008 |
6 |
3 |
p. 393-407 15 p. |
artikel |