nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
|
Ibarra, Louis |
|
2009 |
58 |
3 |
p. 637-678 |
artikel |
2 |
Algorithmic Aspects of Proportional Symbol Maps
|
Cabello, Sergio |
|
2009 |
58 |
3 |
p. 543-565 |
artikel |
3 |
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
|
Fill, James Allen |
|
2009 |
58 |
3 |
p. 730-769 |
artikel |
4 |
Approximate Boyer-Moore String Matching for Small Alphabets
|
Salmela, Leena |
|
2009 |
58 |
3 |
p. 591-609 |
artikel |
5 |
Computing the Greedy Spanner in Near-Quadratic Time
|
Bose, Prosenjit |
|
2009 |
58 |
3 |
p. 711-729 |
artikel |
6 |
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions
|
Dorn, Frederic |
|
2009 |
58 |
3 |
p. 790-810 |
artikel |
7 |
Fast 3-coloring Triangle-Free Planar Graphs
|
Kowalik, Lukasz |
|
2009 |
58 |
3 |
p. 770-789 |
artikel |
8 |
In Memoriam: Ingo Wegener
|
Doerr, Benjamin |
|
2009 |
58 |
3 |
p. 541-542 |
artikel |
9 |
Multi-Color Pebble Motion on Graphs
|
Goraly, Gilad |
|
2009 |
58 |
3 |
p. 610-636 |
artikel |
10 |
On the Fastest Vickrey Algorithm
|
Grigorieva, Elena |
|
2009 |
58 |
3 |
p. 566-590 |
artikel |
11 |
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
|
Asdre, Katerina |
|
2009 |
58 |
3 |
p. 679-710 |
artikel |