@article{Blomer/00,
AUTHOR = {Bl{\"o}mer, J.},
TITLE = {Denesting by bounded degree radicals},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {2-15},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brandes-Wagner/00,
AUTHOR = {Brandes, U. and Wagner, D.},
TITLE = {A linear time algorithm for the arc disjoint Menger problem in planar directed graphs},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {16-36},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Diks-Pelc/00,
AUTHOR = {Diks, K. and Pelc, A.},
TITLE = {Optimal adaptive broadcasting with a bounded fraction of faulty nodes},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {37-50},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Djidjev/00,
AUTHOR = {Djidjev, H.N.},
TITLE = {Partitioning planar graphs with vertex costs: Algorithms and applications},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {51-75},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Frigioni-Italiano/00,
AUTHOR = {Frigioni, D. and Italiano, G.F.},
TITLE = {Dynamically switching vertices in planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {76-103},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Grebinski-Kucherov/00,
AUTHOR = {Grebinski, V. and Kucherov, G.},
TITLE = {Optimal reconstruction of graphs under the additive model},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {104-124},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kalyanasundaram-Pruhs/00,
AUTHOR = {Kalyanasundaram, B. and Pruhs, K.},
TITLE = {Fault-tolerant real-time scheduling},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {125-144},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Trevisan/00,
AUTHOR = {Trevisan, L.},
TITLE = {Approximating satisfiable satisfiability problems},
JOURNAL = {Algorithmica},
VOLUME = {28},
NUMBER = {1},
PAGES = {145-172},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Seiden/00,
AUTHOR = {Seiden, S.S.},
TITLE = {Online randomized multiprocessor scheduling},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {173-216},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Chen-Wada-Kawaguchi/00,
AUTHOR = {Chen, D.Z. and Chen, W. and Wada, K. and Kawaguchi, K.},
TITLE = {Parallel algorithms for partitioning sorted sets and related problems},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {217-241},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ruppert/00,
AUTHOR = {Ruppert, E.},
TITLE = {Finding the $k$ shortest paths in parallel},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {242-254},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gonzalez/00,
AUTHOR = {Gonzalez, T.F.},
TITLE = {Simple algorithms for the on-line multidimensional dictionary and related problems},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {255-267},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Reif-Tate/00,
AUTHOR = {Reif, J.H. and Tate, S.R.},
TITLE = {Fast spatial decomposition and closest pair computation for limited precision input},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {271-287},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ranjan-Pontelli-Gupta-Longpre/00,
AUTHOR = {Ranjan, D. and Pontelli, E. and Gupta, G. and Longpre, L.},
TITLE = {The temporal precedence problem},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {288-306},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Garcia-Lopez-Ramos/00,
AUTHOR = {Garc{\'{i}}a-L{\'{o}}pez, J. and Ramos, P.A.},
TITLE = {A unified approach to conic visibility},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {307-322},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Heath-Vergara/00,
AUTHOR = {Heath, L.S. and Vergara, J.P.C.},
TITLE = {Sorting by short block-moves},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {323-352},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{de_Berg/00,
AUTHOR = {de Berg, M.},
TITLE = {Linear size binary space partitions for uncluttered scenes},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {353-366},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Djidjev-Pantziou-Zaroliagis/00,
AUTHOR = {Djidjev, H.N. and Pantziou, G.E. and Zaroliagis, C.D.},
TITLE = {Improved algorithms for dynamic shortest paths},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {367-389},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Lee/00,
AUTHOR = {Chen, H. Steven and Lee, D.T.},
TITLE = {A faster one-dimensional topological compaction algorithm with jog insertion},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {390-421},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guttman-Beck-Hassin-Khuller-Raghavachari/00,
AUTHOR = {Guttman-Beck, N. and Hassin, R. and Khuller, S. and Raghavachari, B.},
TITLE = {Approximation algorithms with bounded performance guarantees for the clustered Traveling Salesman problem},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {422-437},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Maggs-Vocking/00,
AUTHOR = {Maggs, B.M. and V{\"o}cking, B.},
TITLE = {Improved routing and sorting on multibutterflies},
JOURNAL = {Algorithmica},
VOLUME = {28},
PAGES = {438-464},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}