Volume 65, Issue 1, January 2013

ISSN: 0178-4617 (Print) 1432-0541 (Online)

In this issue (10 articles)

  1. No Access

    OriginalPaper

    Computing Unrestricted Synopses Under Maximum Error Bound

    Chaoyi Pang, Qing Zhang, Xiaofang Zhou, David Hansen, Sen Wang… Pages 1-42
    Look Inside Get Access

  2. No Access

    OriginalPaper

    Mapping Simple Polygons: How Robots Benefit from Looking Back

    Jérémie Chalopin, Shantanu Das, Yann Disser, Matúš Mihalák, Peter Widmayer Pages 43-59
    Look Inside Get Access

  3. OriginalPaper

    Collecting Weighted Items from a Dynamic Queue

    Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand… Pages 60-94
    Download PDF (1062KB)

  4. No Access

    OriginalPaper

    Exact and Parameterized Algorithms for Max Internal Spanning Tree

    Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff Pages 95-128
    Look Inside Get Access

  5. No Access

    OriginalPaper

    Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs

    Hajo Broersma, Fedor V. Fomin, Pim van ’t Hof, Daniël Paulusma Pages 129-145
    Look Inside Get Access

  6. No Access

    OriginalPaper

    Relaxed Spanners for Directed Disk Graphs

    D. Peleg, L. Roditty Pages 146-158
    Look Inside Get Access

  7. No Access

    OriginalPaper

    Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix

    Ali Çivril, Malik Magdon-Ismail Pages 159-176
    Look Inside Get Access

  8. No Access

    OriginalPaper

    The Longest Path Problem Is Polynomial on Cocomparability Graphs

    Kyriaki Ioannidou, Stavros D. Nikolopoulos Pages 177-205
    Look Inside Get Access

  9. No Access

    OriginalPaper

    Optimal Tracking of Distributed Heavy Hitters and Quantiles

    Ke Yi, Qin Zhang Pages 206-223
    Look Inside Get Access

  10. No Access

    OriginalPaper

    Adaptive Drift Analysis

    Benjamin Doerr, Leslie Ann Goldberg Pages 224-250
    Look Inside Get Access