@article{Deng-Li-Zang-Zhou/03,
AUTHOR = {Deng, Xiaotie and Li, Guojun and Zang, Wenan and Zhou, Yi},
TITLE = {A 2-approximation algorithm for path coloring on a restricted class of trees of rings},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {1},
PAGES = {1-13},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Iturriaga-Lubiw/03,
AUTHOR = {Iturriaga, Claudia and Lubiw, Anna},
TITLE = {Elastic labels around the perimeter of a map},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {1},
PAGES = {14-39},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Skodinis/03,
AUTHOR = {Skodinis, Konstantin},
TITLE = {Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {1},
PAGES = {40-59},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Bahig-Nakamula/03,
AUTHOR = {Bahig, Hatem M. and Nakamula, Ken},
TITLE = {Erratum to ''Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true''},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {1},
PAGES = {60-61},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
NOTE = {Originally in J. Algorithms, Vol. 42, 2002, No. 2, 304-316},
TYPE = {proceeding},
}
@article{Niedermeier-Rossmanith/03,
AUTHOR = {Niedermeier, Rolf and Rossmanith, Peter},
TITLE = {On efficient fixed-parameter algorithms for weighted vertex cover},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {2},
PAGES = {63-77},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Alexander-Bulger-Wood/03,
AUTHOR = {Alexander, D.L.J. and Bulger, D.W. and Wood, G.R.},
TITLE = {Expected search duration for finite backtracking adaptive search},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {2},
PAGES = {78-86},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Alon-Shapira/03,
AUTHOR = {Alon, Noga and Shapira, Asaf},
TITLE = {Testing satisfiability},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {2},
PAGES = {87-103},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Tsaban/03,
AUTHOR = {Tsaban, Boaz},
TITLE = {Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {2},
PAGES = {104-121},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Berman-DasGupta-Muthukrishnan/03,
AUTHOR = {Berman, Piotr and DasGupta, Bhaskar and Muthukrishnan, S.},
TITLE = {Approximation algorithms for MAX-MIN tiling},
JOURNAL = {J. Algorithms},
VOLUME = {47},
NUMBER = {2},
PAGES = {122-134},
YEAR = {2003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}