default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 40
Volume 40, Number 1, July 2001
- Salvador Roura:
Digital Access to Comparison-Based Tree Data Structures and Algorithms. 1-23 - Anupam Gupta:
Improved Bandwidth Approximation for Trees and Chordal Graphs. 24-36 - Philippe Flajolet, Xavier Gourdon, Daniel Panario
:
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. 37-81 - Xin He:
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. 82-101 - Avner Dor, Eitan Greenshtein:
An Almost-Greedy Search on Random Binary Vectors and Random Graphs. 102-133
Volume 40, Number 2, August 2001
- Weimin Chen:
New Algorithm for Ordered Tree-to-Tree Correction Problem. 135-158 - Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan:
Unique Maximum Matching Algorithms. 159-183 - Eran Halperin, Uri Zwick:
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. 184-211 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-14 22:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
