论文列表及评分结果
Finding and Counting Given Length Cycles.
电商所评分：2
Randomized Multipacket Routing and Sorting on Meshes.
电商所评分：6
Decomposing the Boundary of a Nonconvex Polyhedron.
电商所评分：4
Efficient Parallel Recognition of Some Circular Arc Graphs, II.
电商所评分：2
Proximity Problems for Points on a Rectilinear Plane with Rectangular Obstacles.
电商所评分：5
The Complexity of Almost-Optimal Simultaneous Coordination.
电商所评分：1
Randomized Quickhull.
电商所评分：10
An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling.
电商所评分：5
Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time.
电商所评分：4
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams.
电商所评分：6
Efficient Construction of a Bounded-Degree Spanner with Low Weight.
电商所评分：5
Fast Integer Merging on the EREW PRAM.
电商所评分：8
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.
电商所评分：6
Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems.
电商所评分：3
Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For?
电商所评分：8
On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching.
电商所评分：1
Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs.
电商所评分：1
An O(n³) Recognition Algorithm for Bithreshold Graphs.
电商所评分：2
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction.
电商所评分：7
Improved Parallel Approximation of a Class of Integer Programming Problems.
电商所评分：7
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees.
电商所评分：3
An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
电商所评分：3
Randomized Approximation of Bounded Multicovering Problems.
电商所评分：8
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.
电商所评分：10
On Approximating the Longest Path in a Graph.
电商所评分：4
A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem.
电商所评分：1
An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane.
电商所评分：1
An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.
电商所评分：1
Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs.
电商所评分：1
Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints.
电商所评分：4