论文列表及评分结果
Constructing Optimal Trees from Quartets.
电商所评分：10
Compact Routing with Minimum Stretch.
电商所评分：4
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees.
电商所评分：10
Cut Tree Algorithms: An Experimental Study.
电商所评分：8
Wavelength Conversion in Optical Networks.
电商所评分：10
Median Bounds and Their Application.
电商所评分：7
Foreword.
电商所评分：2
An Almost-Greedy Search on Random Binary Vectors and Random Graphs.
电商所评分：9
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
电商所评分：7
On Markov Chains for Randomly H-Coloring a Graph.
电商所评分：9
On Minimum Edge Ranking Spanning Trees.
电商所评分：5
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.
电商所评分：5
Approximation Algorithms for Dispersion Problems.
电商所评分：9
Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests.
电商所评分：1
Fault-Tolerant Broadcasting in Radio Networks.
电商所评分：9
A Simple Algorithm for the Planar Multiway Cut Problem.
电商所评分：1
Approximating Layout Problems on Random Geometric Graphs.
电商所评分：7
Using Homogeneous Weights for Approximating the Partial Cover Problem.
电商所评分：1
Space Efficient Suffix Trees.
电商所评分：3
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes.
电商所评分：2
A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p.
电商所评分：10
Greedy Local Improvement and Weighted Set Packing Approximation.
电商所评分：3
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields.
电商所评分：7
Digital Access to Comparison-Based Tree Data Structures and Algorithms.
电商所评分：2
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs.
电商所评分：2
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.
电商所评分：1
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings.
电商所评分：9
Unique Maximum Matching Algorithms.
电商所评分：2
Efficient Merging and Construction of Evolutionary Trees.
电商所评分：10
How Helpers Hasten h-Relations.
电商所评分：7