Volume 65, Issue 3, March 2013

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

In this issue (10 articles)

  1. No Access

    OriginalPaper

    Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon

    A. García, P. Jodrá, J. Tejel Pages 481-497
    Look Inside Get Access

  2. No Access

    OriginalPaper

    Improved Approximation Algorithms for the Spanning Star Forest Problem

    Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra… Pages 498-516
    Look Inside Get Access

  3. No Access

    OriginalPaper

    The Parameterized Complexity of Unique Coverage and Its Variants

    Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh… Pages 517-544
    Look Inside Get Access

  4. No Access

    OriginalPaper

    Approximation Algorithms for the Directed k-Tour and k-Stroll Problems

    MohammadHossein Bateni, Julia Chuzhoy Pages 545-561
    Look Inside Get Access

  5. No Access

    OriginalPaper

    Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

    Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro Pages 562-583
    Look Inside Get Access

  6. No Access

    OriginalPaper

    Computing Optimal Steiner Trees in Polynomial Space

    Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov… Pages 584-604
    Look Inside Get Access

  7. No Access

    OriginalPaper

    Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy

    Tak-Wah Lam, Lap-Kei Lee, Isaac K. K. To, Prudence W. H. Wong Pages 605-633
    Look Inside Get Access

  8. No Access

    OriginalPaper

    Stochastic Budget Optimization in Internet Advertising

    Bhaskar DasGupta, S. Muthukrishnan Pages 634-661
    Look Inside Get Access

  9. OriginalPaper

    Succinct 2D Dictionary Matching

    Shoshana Neuburger, Dina Sokol Pages 662-684
    Download PDF (977KB) View Article

  10. No Access

    OriginalPaper

    Sublinear Algorithms for Approximating String Compressibility

    Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith Pages 685-709
    Look Inside Get Access