| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
|
Bateni, MohammadHossein
|
|
2011
|
65 |
3 |
p. 545-561
|
artikel
|
| 2 |
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon
|
García, A.
|
|
2011
|
65 |
3 |
p. 481-497
|
artikel
|
| 3 |
Computing Optimal Steiner Trees in Polynomial Space
|
Fomin, Fedor V.
|
|
2012
|
65 |
3 |
p. 584-604
|
artikel
|
| 4 |
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
|
Flocchini, Paola
|
|
2012
|
65 |
3 |
p. 562-583
|
artikel
|
| 5 |
Improved Approximation Algorithms for the Spanning Star Forest Problem
|
Chen, Ning
|
|
2011
|
65 |
3 |
p. 498-516
|
artikel
|
| 6 |
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy
|
Lam, Tak-Wah
|
|
2012
|
65 |
3 |
p. 605-633
|
artikel
|
| 7 |
Stochastic Budget Optimization in Internet Advertising
|
DasGupta, Bhaskar
|
|
2012
|
65 |
3 |
p. 634-661
|
artikel
|
| 8 |
Sublinear Algorithms for Approximating String Compressibility
|
Raskhodnikova, Sofya
|
|
2012
|
65 |
3 |
p. 685-709
|
artikel
|
| 9 |
Succinct 2D Dictionary Matching
|
Neuburger, Shoshana
|
|
2012
|
65 |
3 |
p. 662-684
|
artikel
|
| 10 |
The Parameterized Complexity of Unique Coverage and Its Variants
|
Misra, Neeldhara
|
|
2011
|
65 |
3 |
p. 517-544
|
artikel
|
Tijdschrift beschrijving