Journal of Algorithms, Volume 40

Volume 40, Number 1, July 2001

Salvador Roura: Digital Access to Comparison-Based Tree Data Structures and Algorithms. 1-23 BibTeX
Anupam Gupta: Improved Bandwidth Approximation for Trees and Chordal Graphs. 24-36 BibTeX
Philippe Flajolet, Xavier Gourdon, Daniel Panario: The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. 37-81 BibTeX
Xin He: A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. 82-101 BibTeX
Avner Dor, Eitan Greenshtein: An Almost-Greedy Search on Random Binary Vectors and Random Graphs. 102-133 BibTeX

Weimin Chen: New Algorithm for Ordered Tree-to-Tree Correction Problem. 135-158 BibTeX
Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan: Unique Maximum Matching Algorithms. 159-183 BibTeX
Eran Halperin, Uri Zwick: Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. 184-211 BibTeX
Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings. 212-233 BibTeX