External Links

    Journal: J. Algorithms

    Volume 47, Issue 2

    63 -- 77Rolf Niedermeier, Peter Rossmanith. On efficient fixed-parameter algorithms for weighted vertex cover
    78 -- 86D. L. J. Alexander, D. W. Bulger, G. R. Wood. Expected search duration for finite backtracking adaptive search
    87 -- 103Noga Alon, Asaf Shapira. Testing satisfiability
    104 -- 121Boaz Tsaban. Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
    122 -- 134Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan. Approximation algorithms for MAX-MIN tiling

    Volume 47, Issue 1

    1 -- 13Xiaotie Deng, Guojun Li, Wenan Zang, Yi Zhou. A 2-approximation algorithm for path coloring on a restricted class of trees of rings
    14 -- 39Claudia Iturriaga, Anna Lubiw. Elastic labels around the perimeter of a map
    40 -- 59Konstantin Skodinis. Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
    60 -- 61Hatem M. Bahig, Ken Nakamula. Erratum to Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true : [J. Algorithms 42 (2002) 304-316]
    runs on