论文列表及评分结果

On Problem Transformability in VLSI.

电商所评分:9

点击查看评分详情!

Global Wire Routing in Two-Dimensional Arrays.

电商所评分:5

点击查看评分详情!

Some Problems in Computational Geometry.

电商所评分:8

点击查看评分详情!

Editor's Foreword.

电商所评分:5

点击查看评分详情!

A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations.

电商所评分:1

点击查看评分详情!

A Sweepline Algorithm for Voronoi Diagrams.

电商所评分:8

点击查看评分详情!

On Approximation Behavior of the Greedy Triangulation for Convex Polygons.

电商所评分:8

点击查看评分详情!

Geometric Applications of a Matrix-Searching Algorithm.

电商所评分:6

点击查看评分详情!

Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.

电商所评分:4

点击查看评分详情!

An Improved Algorithm for Finding the Median Distributively.

电商所评分:3

点击查看评分详情!

A Minimum-Area Circuit for l-Selection.

电商所评分:2

点击查看评分详情!

Minimizing Channel Density in Standard Cell Layout.

电商所评分:10

点击查看评分详情!

Algorithms for the Compilation of Regular Expressions into PLAs.

电商所评分:6

点击查看评分详情!

The Longest Common Subsequence Problem Revisited.

电商所评分:7

点击查看评分详情!

Computing on a Free Tree via Complexity-Preserving Mappings.

电商所评分:6

点击查看评分详情!

Preface Special Issue on Robotics.

电商所评分:10

点击查看评分详情!

A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space.

电商所评分:1

点击查看评分详情!

Path-Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape.

电商所评分:5

点击查看评分详情!

Motion Planning with Inertial Constraints.

电商所评分:10

点击查看评分详情!

On Multiple Moving Objects.

电商所评分:7

点击查看评分详情!

Optimal Piecewise Linear Motion of an Object Among Obstacles.

电商所评分:5

点击查看评分详情!

On the Existence and Synthesis of Multifinger Positive Grips.

电商所评分:3

点击查看评分详情!

An Improved Parallel Algorithm for Integer GCD.

电商所评分:8

点击查看评分详情!

Approximation Algorithms for Partitioning a Rectangle with Interior Points.

电商所评分:2

点击查看评分详情!

Efficient Parallel Algorithms for Graph Problems.

电商所评分:7

点击查看评分详情!

A New Algorithm for the Largest Empty Rectangle Problem.

电商所评分:5

点击查看评分详情!

Improved Sorting Networks with O(log N) Depth.

电商所评分:6

点击查看评分详情!

On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.

电商所评分:6

点击查看评分详情!

On Heuristics for Minimum Length Rectilinear Partitions.

电商所评分:9

点击查看评分详情!

Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees.

电商所评分:6

点击查看评分详情!