论文列表及评分结果
The Rectilinear Steiner Arborescence Problem.
电商所评分：10
Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems.
电商所评分：2
A Note on Bounding k-Terminal Reliability.
电商所评分：9
Path-Distance Heuristics for the Steiner Problem in Undirected Networks.
电商所评分：10
Steiner Tree Problems.
电商所评分：3
Problems with Generalized Steiner Problems.
电商所评分：4
A Paradigm for Robust Geometric Algorithms.
电商所评分：2
Randomized Incremental Construction of Delaunay and Voronoi Diagrams.
电商所评分：6
Three Priority Queue Applications Revisited.
电商所评分：6
Editor's Foreword Special Issue on Graph Algorithms.
电商所评分：9
Maintaining Bridge-Connected and Biconnected Components On-Line.
电商所评分：7
Forests, Frames, and Games: Algorithms for Matroid Sums and Applications.
电商所评分：9
A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications.
电商所评分：2
A Linear-Time Algorithm for Finding an Ambitus.
电商所评分：4
Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families.
电商所评分：5
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.
电商所评分：9
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems.
电商所评分：2
Efficient Parallel Algorithms for Path Problems in Directed Graphs.
电商所评分：2
Finding Effective "Force Targets" for Two-Dimensional Multifinger Frictional Grips.
电商所评分：2
Optimal Routing Algorithms for Mesh-Connected Processor Arrays.
电商所评分：4
Linear-Time Border-Tracing Algorithms for Quadtrees.
电商所评分：5
L_1 Shortest Paths Among Polygonal Obstacles in the Plane.
电商所评分：3
Path-Matching Problems.
电商所评分：8
A Bounded Approximation for the Minimum Cost 2-Sat Problem.
电商所评分：10
Line-Segment Intersection Reporting in Parallel.
电商所评分：4
Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem.
电商所评分：2
A Geometric View of Parametric Linear Programming.
电商所评分：6
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs.
电商所评分：3
An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty.
电商所评分：6
On the Parallel-Decomposability of Geometric Problems.
电商所评分：2