@article{Kalyanasundaram-Pruhs/01,
AUTHOR = {Kalyanasundaram, Bala and Pruhs, Kirk R.},
TITLE = {Eliminating migration in multi-processor scheduling},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {2-24},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kleinberg-Kumar/01,
AUTHOR = {Kleinberg, Jon and Kumar, Amit},
TITLE = {Wavelength conversion in optical networks},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {25-50},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Goldberg-Tsioutsiouliklis/01,
AUTHOR = {Goldberg, Andrew V. and Tsioutsiouliklis, Kostas},
TITLE = {Cut tree algorithms: An experimental study},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {51-83},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Indyk/01,
AUTHOR = {Indyk, Piotr},
TITLE = {A small approximately min-wise independent family of hash functions},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {84-90},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Barequet-Har-Peled/01,
AUTHOR = {Barequet, Gill and Har-Peled, Sariel},
TITLE = {Efficiently approximating the minimum-volume bounding box of a point set in three dimensions},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {91-109},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Biedl-Bose-Demaine-Lubiw/01,
AUTHOR = {Biedl, Therese C. and Bose, Prosenjit and Demaine, Erik D. and Lubiw, Anna},
TITLE = {Efficient algorithms for Petersen's matching theorem},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {110-134},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Oldham/01,
AUTHOR = {Oldham, Jeffrey D.},
TITLE = {Combinatorial approximation algorithms for generalized flow problems},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {135-169},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cowen/01,
AUTHOR = {Cowen, Lenore J.},
TITLE = {Compact routing with minimum stretch},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {170-183},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Siegel/01,
AUTHOR = {Siegel, Alan},
TITLE = {Median bounds and their application},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {184-236},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bryant-Steel/01,
AUTHOR = {Bryant, David and Steel, Mike},
TITLE = {Constructing optimal trees from quartets},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {237-259},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Korupolu-Plaxton-Rajaraman/01,
AUTHOR = {Korupolu, Madhukar R. and Plaxton, C. Greg and Rajaraman, Rajmohan},
TITLE = {Placement algorithms for hierarchical cooperative caching},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {260-302},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Duncan-Goodrich-Kobourov/01,
AUTHOR = {Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen},
TITLE = {Balanced aspect ratio trees: Combining the advantages of $k-d$ trees and octrees},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {1},
PAGES = {303-333},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cohen-Zwick/01,
AUTHOR = {Cohen, Edith and Zwick, Uri},
TITLE = {All-pairs small-stretch paths},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {2},
PAGES = {335-353},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Nagamochi-Hasunuma/01,
AUTHOR = {Nagamochi, Hiroshi and Hasunuma, Toru},
TITLE = {An efficient $NC$ algorithm for a sparse $k$-edge-connectivity certificate},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {2},
PAGES = {354-373},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Fernau-Niedermeier/01,
AUTHOR = {Fernau, Henning and Niedermeier, Rolf},
TITLE = {En efficient exact algorithm for constraint bipartite vertex cover},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {2},
PAGES = {374-410},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Makino-Uno-Ibaraki/01,
AUTHOR = {Makino, Kazuhisa and Uno, Yushi and Ibaraki, Toshihide},
TITLE = {On minimum edge ranking spanning trees},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {2},
PAGES = {411-437},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chandra-Halldorsson/01,
AUTHOR = {Chandra, Barun and Halld{\'{o}}rsson, Magn{\'{u}}s M.},
TITLE = {Approximation algorithms for dispersion problems},
JOURNAL = {J. Algorithms},
VOLUME = {38},
NUMBER = {2},
PAGES = {438-465},
YEAR = {2001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}