nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Adaptive Drift Analysis
|
Doerr, Benjamin |
|
2011 |
65 |
1 |
p. 224-250 |
artikel |
2 |
Collecting Weighted Items from a Dynamic Queue
|
Bienkowski, Marcin |
|
2011 |
65 |
1 |
p. 60-94 |
artikel |
3 |
Computing Unrestricted Synopses Under Maximum Error Bound
|
Pang, Chaoyi |
|
2011 |
65 |
1 |
p. 1-42 |
artikel |
4 |
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
|
Broersma, Hajo |
|
2011 |
65 |
1 |
p. 129-145 |
artikel |
5 |
Exact and Parameterized Algorithms for Max Internal Spanning Tree
|
Binkele-Raible, Daniel |
|
2011 |
65 |
1 |
p. 95-128 |
artikel |
6 |
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix
|
Çivril, Ali |
|
2011 |
65 |
1 |
p. 159-176 |
artikel |
7 |
Mapping Simple Polygons: How Robots Benefit from Looking Back
|
Chalopin, Jérémie |
|
2011 |
65 |
1 |
p. 43-59 |
artikel |
8 |
Optimal Tracking of Distributed Heavy Hitters and Quantiles
|
Yi, Ke |
|
2011 |
65 |
1 |
p. 206-223 |
artikel |
9 |
Relaxed Spanners for Directed Disk Graphs
|
Peleg, D. |
|
2011 |
65 |
1 |
p. 146-158 |
artikel |
10 |
The Longest Path Problem Is Polynomial on Cocomparability Graphs
|
Ioannidou, Kyriaki |
|
2011 |
65 |
1 |
p. 177-205 |
artikel |