| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings
|
Chen, Kuan-Yu
|
|
2011
|
65 |
2 |
p. 354-370
|
artikel
|
| 2 |
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
|
Wu, Bang Ye
|
|
2011
|
65 |
2 |
p. 467-479
|
artikel
|
| 3 |
Cleaning Interval Graphs
|
Marx, Dániel
|
|
2011
|
65 |
2 |
p. 275-316
|
artikel
|
| 4 |
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
|
Hershcovitch, Moshe
|
|
2011
|
65 |
2 |
p. 371-390
|
artikel
|
| 5 |
Online Clustering with Variable Sized Clusters
|
Csirik, János
|
|
2011
|
65 |
2 |
p. 251-274
|
artikel
|
| 6 |
Power Domination in Circular-Arc Graphs
|
Liao, Chung-Shou
|
|
2011
|
65 |
2 |
p. 443-466
|
artikel
|
| 7 |
Route-Enabling Graph Orientation Problems
|
Ito, Takehiro
|
|
2011
|
65 |
2 |
p. 317-338
|
artikel
|
| 8 |
Streaming Graph Computations with a Helpful Advisor
|
Cormode, Graham
|
|
2011
|
65 |
2 |
p. 409-442
|
artikel
|
| 9 |
Two-stage Robust Network Design with Exponential Scenarios
|
Khandekar, Rohit
|
|
2011
|
65 |
2 |
p. 391-408
|
artikel
|
| 10 |
Unified Compression-Based Acceleration of Edit-Distance Computation
|
Hermelin, Danny
|
|
2011
|
65 |
2 |
p. 339-353
|
artikel
|
Tijdschrift beschrijving