Computing Unrestricted Synopses Under Maximum Error Bound Chaoyi PangQing ZhangAnthony Maeder OriginalPaper 05 October 2011 Pages: 1 - 42
Mapping Simple Polygons: How Robots Benefit from Looking Back Jérémie ChalopinShantanu DasPeter Widmayer OriginalPaper 14 October 2011 Pages: 43 - 59
Collecting Weighted Items from a Dynamic Queue Marcin BienkowskiMarek ChrobakGrzegorz Stachowiak OriginalPaper Open access 04 October 2011 Pages: 60 - 94
Exact and Parameterized Algorithms for Max Internal Spanning Tree Daniel Binkele-RaibleHenning FernauMathieu Liedloff OriginalPaper 30 September 2011 Pages: 95 - 128
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs Hajo BroersmaFedor V. FominDaniël Paulusma OriginalPaper 26 September 2011 Pages: 129 - 145
Relaxed Spanners for Directed Disk Graphs D. PelegL. Roditty OriginalPaper 20 October 2011 Pages: 146 - 158
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix Ali ÇivrilMalik Magdon-Ismail OriginalPaper 27 October 2011 Pages: 159 - 176
The Longest Path Problem Is Polynomial on Cocomparability Graphs Kyriaki IoannidouStavros D. Nikolopoulos OriginalPaper 27 October 2011 Pages: 177 - 205
Optimal Tracking of Distributed Heavy Hitters and Quantiles Ke YiQin Zhang OriginalPaper 21 October 2011 Pages: 206 - 223
Adaptive Drift Analysis Benjamin DoerrLeslie Ann Goldberg OriginalPaper 27 October 2011 Pages: 224 - 250