@article{Muthukrishnan/00,
AUTHOR = {Muthukrishnan, S.},
TITLE = {Simple optimal parallel multiple pattern matching},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {1-13},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hofting-Wanke/00,
AUTHOR = {H{\"o}fting, F. and Wanke, E.},
TITLE = {Polynomial-time analysis of toroidal periodic graphs},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {14-39},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Shahrokhi-Shi/00,
AUTHOR = {Shahrokhi, Farhad and Shi, Weiping},
TITLE = {On crossing sets, disjoint sets, and pagenumber},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {40-53},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Jansen/00,
AUTHOR = {Jansen, Klaus},
TITLE = {Approximation results for the optimum cost chromatic partition problem},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {54-89},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Wang/00b,
AUTHOR = {Wang, Biing-Feng},
TITLE = {Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {90-108},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Attiya/00,
AUTHOR = {Attiya, Hagit},
TITLE = {Efficient and robust sharing of memory in message-passing systems},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {109-127},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Berthome-Hagerup-Newman-Schuster/00,
AUTHOR = {Berthom{\'{e}}, Pascal and Hagerup, Torben and Newman, Ilan and Schuster, Assaf},
TITLE = {Self-simulation for the passive optical star},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {128-147},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Galli/00,
AUTHOR = {Galli, Nicola},
TITLE = {Average costs of a graph exploration: Upper and lower bounds},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {148-176},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ahuja-Orlin/00,
AUTHOR = {Ahuja, Ravindra K. and Orlin, James B.},
TITLE = {A faster algorithm for the inverse spanning tree problem},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {177-193},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Jiang-Kearney-Li/00,
AUTHOR = {Jiang, Tao and Kearney, Paul and Li, Ming},
TITLE = {Some open problems in computational molecular biology},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {1},
PAGES = {194-201},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Asahiro-Iwama-Tamaki-Tokuyama/00,
AUTHOR = {Asahiro, Yuichi and Iwama, Kazuo and Tamaki, Hisao and Tokuyama, Takeshi},
TITLE = {Greedily finding a dense subgraph},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {2},
PAGES = {203-221},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Henzinger-Rao-Gabow/00,
AUTHOR = {Henzinger, Monika R. and Rao, Satish and Gabow, Harold N.},
TITLE = {Computing vertex connectivity: New bounds from old techniques},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {2},
PAGES = {222-250},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Frigioni-Marchetti-Spaccamela-Nanni/00,
AUTHOR = {Frigioni, Daniele and Marchetti-Spaccamela, Alberto and Nanni, Umberto},
TITLE = {Fully dynamic algorithms for maintaining shortest paths trees},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {2},
PAGES = {251-281},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chrobak-Noga/00,
AUTHOR = {Chrobak, Marek and Noga, John},
TITLE = {Competitive algorithms for relaxed list update and multilevel caching},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {2},
PAGES = {282-308},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Korsh-LaFollette/00,
AUTHOR = {Korsh, James F. and LaFollette, Paul},
TITLE = {Multiset permutations and loopless generation of ordered trees with specified degree sequence},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {2},
PAGES = {309-336},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chan-Chin/00,
AUTHOR = {Chan, Wun-Tat and Chin, Francis Y.L.},
TITLE = {Efficient algorithms for finding the maximum number of disjoint paths in grids},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {2},
PAGES = {337-369},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Goldman-Parwatikar-Suri/00,
AUTHOR = {Goldman, Sally A. and Parwatikar, Jyoti and Suri, Subhash},
TITLE = {Online scheduling with hard deadlines},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {2},
PAGES = {370-389},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kapoor-Rizzi/00,
AUTHOR = {Kapoor, Ajai and Rizzi, Romeo},
TITLE = {Edge-coloring bipartite graphs},
JOURNAL = {J. Algorithms},
VOLUME = {34},
NUMBER = {2},
PAGES = {390-396},
YEAR = {2000},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}