@article{Fortune/00,
AUTHOR = {Fortune, S.},
TITLE = {Introduction},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {1-4},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sugihara-Iri-Inagaki-Imai/00,
AUTHOR = {Sugihara, K. and Iri, M. and Inagaki, H. and Imai, T.},
TITLE = {Topology-oriented implementation --- An approach to robust geometric algorithms},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {5-20},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bronnimann-Yvinec/00,
AUTHOR = {Br{\"o}nnimann, H. and Yvinec, M.},
TITLE = {Efficient exact evaluation of signs of determinants},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {21-56},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Milenkovic/00,
AUTHOR = {Milenkovic, V.J.},
TITLE = {Shortest path geometric rounding},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {57-86},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Burnikel-Fleischer-Mehlhorn-Schirra/00,
AUTHOR = {Burnikel, C. and Fleischer, R. and Mehlhorn, K. and Schirra, S.},
TITLE = {A strong and easily computable separation bound for arithmetic expressions involving radicals},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {87-99},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bajaj-Royappa/00,
AUTHOR = {Bajaj, C.L. and Royappa, A.V.},
TITLE = {Parameterization in finite precision},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {1},
PAGES = {100-114},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kapoor-Ramesh/00,
AUTHOR = {Kapoor, S. and Ramesh, H.},
TITLE = {An algorithm for enumerating all spanning trees of a directed graph},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {120-130},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bar-Yehuda/00,
AUTHOR = {Bar-Yehuda, R.},
TITLE = {One for the price of two: A unified approach for approximating covering problems},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {131-144},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Navarro-Barbosa-Baeza-Yates-Cunto-Ziviani/00,
AUTHOR = {Navarro, G. and Barbosa, E.F. and Baeza-Yates, R. and Cunto, W. and Ziviani, N.},
TITLE = {Binary searching with nonuniform costs and its application to text retrieval},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {145-169},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Schomer-Sellen-Teichmann-Yap/00,
AUTHOR = {Sch{\"o}mer, E. and Sellen, J. and Teichmann, M. and Yap, Chee},
TITLE = {Smallest enclosing cylinders},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {170-186},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sajith-Saxena/00,
AUTHOR = {Sajith, G. and Saxena, S.},
TITLE = {Optimal sublogarithmic time parallel algorithms on rooted forests},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {187-197},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guttman-Beck-Hassin/00,
AUTHOR = {Guttman-Beck, N. and Hassin, R.},
TITLE = {Approximation algorithms for minimum $K$-cut},
JOURNAL = {Algorithmica},
VOLUME = {27},
NUMBER = {2},
PAGES = {198-207},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bodlaender/00,
AUTHOR = {Bodlaender, H.L.},
TITLE = {Introduction},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {209-211},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chaudhuri-Zaroliagis/00,
AUTHOR = {Chaudhuri, S. and Zaroliagis, C.D.},
TITLE = {Shortest paths in digraphs of small treewidth --- Part I: Sequential algorithms},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {212-226},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zhou-Fuse-Nishizeki/00,
AUTHOR = {Zhou, X. and Fuse, K. and Nishizeki, T.},
TITLE = {A linear algorithm for finding $[g,f]$-colorings of partial $k$-trees},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {227-243},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alstrup-Lauridsen-Thorup/00,
AUTHOR = {Alstrup, S. and Lauridsen, P.W. and Thorup, M.},
TITLE = {Generalized dominators for structured programs},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {244-253},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gupta-Kaller-Shermer/00,
AUTHOR = {Gupta, A. and Kaller, D. and Shermer, T.},
TITLE = {Linear-time algorithms for partial $k$-tree complements},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {254-274},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eppstein/00a,
AUTHOR = {Eppstein, D.},
TITLE = {Diameter and treewidth in minor-closed graph families},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {275-291},
YEAR = {2000},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=27&spage=275},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hagerup/00,
AUTHOR = {Hagerup, T.},
TITLE = {Dynamic algorithms for graphs of bounded treewidth},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {292-315},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lucet-Manouvrier-Carlier/00,
AUTHOR = {Lucet, C. and Manouvrier, J.-F. and Carlier, J.},
TITLE = {Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {316-336},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dessmark-Lingas-Proskurowski/00,
AUTHOR = {Dessmark, A. and Lingas, A. and Proskurowski, A.},
TITLE = {Faster algorithms for subgraph isomorphism of $k$-connected partial $k$-trees},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {337-347},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kaller/00,
AUTHOR = {Kaller, D.},
TITLE = {Definability equals recognizability of partial 3-trees and $k$-connected partial $k$-trees},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {348-381},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Aspvall-Proskurowski-Telle/00,
AUTHOR = {Aspvall, B. and Proskurowski, A. and Telle, J.A.},
TITLE = {Memory requirements for table computations in partial $k$-tree algorithms},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {382-394},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Peng-Ko-Ho-Hsu-Tang/00,
AUTHOR = {Peng, S.-L. and Ko, M.-T. and Ho, C.-W. and Hsu, T.-s. and Tang, C.Y.},
TITLE = {Graph searching on some subclasses of chordal graphs},
JOURNAL = {Algorithmica},
VOLUME = {27},
PAGES = {395-426},
YEAR = {2000},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}