@article{Jain-Mandoiu-Vazirani-Williamson/02,
AUTHOR = {Jain, Kamal and M{\u{a}}ndoiu, Ion and Vazirani, Vijay V. and Williamson, David P.},
TITLE = {A primal-dual schema based approximation algorithm for the element connectivity problem},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {1-15},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Aspnes/02,
AUTHOR = {Aspnes, James},
TITLE = {Fast deterministic consensus in a noisy environment},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {16-39},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kratovil-Tuza/02,
AUTHOR = {Kratov{\'{i}}l, Jan and Tuza, Zsolt},
TITLE = {On the complexity of bicoloring clique hypergraphs of graphs},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {40-54},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hsu/02a,
AUTHOR = {Hsu, Tsan-sheng},
TITLE = {Simpler and faster biconnectivity augmentation},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {55-71},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Halperin-Nathaniel-Zwick/02,
AUTHOR = {Halperin, Eran and Nathaniel, Ram and Zwick, Uri},
TITLE = {Coloring $k$-colorable graphs using relatively small palettes},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {72-90},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Caprara-Italiano-Mohan-Panconesi-Srinivasan/02,
AUTHOR = {Caprara, Alberto and Italiano, Giuseppe F. and Mohan, G. and Panconesi, Alessandro and Srinivasan, Aravind},
TITLE = {Wavelength rerouting in optical networks, or the Venetian routing problem},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {93-125},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Caruso-Chessa-Maestrini-Santi/02,
AUTHOR = {Caruso, Antonio and Chessa, Stefano and Maestrini, Piero and Santi, Paolo},
TITLE = {Diagnosability of regular systems},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {126-143},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Wood/02,
AUTHOR = {Wood, David R.},
TITLE = {Degree constrained book embeddings},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {144-154},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Brinkmann-Caporossi-Hansen/02,
AUTHOR = {Brinkmann, Gunnar and Caporossi, Gilles and Hansen, Pierre},
TITLE = {A constructive enumeration of fusenes and benzenoids},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {155-166},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Jansen-Porkolab/02a,
AUTHOR = {Jansen, Klaus and Porkolab, Lorant},
TITLE = {Polynomial time approximation schemes for general multiprocessor job shop scheduling},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {167-191},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Feder-Motwani/02,
AUTHOR = {Feder, Tom{\'{a}}s and Motwani, Rajeev},
TITLE = {Worst-case time bounds for coloring and satisfiability problems},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {192-201},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Queyranne-Sviridenko/02,
AUTHOR = {Queyranne, Maurice and Sviridenko, Maxim},
TITLE = {A $(2 + \varepsilon)$-approximation algorithm for the generalized preemptive open shop problem with minsum objective},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {202-212},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}