论文列表及评分结果

Maximum Concurrent Flows and Minimum Cuts.

电商所评分:10

点击查看评分详情!

There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees.

电商所评分:3

点击查看评分详情!

Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.

电商所评分:6

点击查看评分详情!

Optimal Parallel Detection of Squares in Strings.

电商所评分:2

点击查看评分详情!

Probing a Scene of Nonconvex Polyhedra.

电商所评分:10

点击查看评分详情!

Editor's Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry.

电商所评分:4

点击查看评分详情!

Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic.

电商所评分:7

点击查看评分详情!

Simultaneous Inner and Outer Approximation of Shapes.

电商所评分:6

点击查看评分详情!

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.

电商所评分:6

点击查看评分详情!

Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems.

电商所评分:4

点击查看评分详情!

Minimum-Link Paths Among Obstacles in the Plan.

电商所评分:10

点击查看评分详情!

Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons.

电商所评分:6

点击查看评分详情!

Editors' Introduction.

电商所评分:3

点击查看评分详情!

Retiming Synchronous Circuitry.

电商所评分:3

点击查看评分详情!

Partitioning Circuits for Improved Testability.

电商所评分:8

点击查看评分详情!

Optimal Tradeoffs for Addition on Systolic Arrays.

电商所评分:8

点击查看评分详情!

Multiterminal Global Routing: A Deterministic Approximation Scheme.

电商所评分:9

点击查看评分详情!

Optimal Multilayer Channel Routing with Overlap.

电商所评分:8

点击查看评分详情!

A Generic Algorithm for One-Dimensional Homotopic Compaction.

电商所评分:3

点击查看评分详情!

Multilayer Grid Embeddings for VLSI.

电商所评分:10

点击查看评分详情!

Search Directions for Interior Linear-Programming Methods.

电商所评分:2

点击查看评分详情!

Moving a Disc Between Polygons.

电商所评分:9

点击查看评分详情!

Probabilistic Analysis of a Grouping Algorithm.

电商所评分:10

点击查看评分详情!

An O(n log n) Plane-Sweep Algorithm for L_1 and L_\infty Delaunay Triangulations.

电商所评分:10

点击查看评分详情!

FFD Bin Packing for Item Sizes with Uniform Distributions on [0, 1/2].

电商所评分:2

点击查看评分详情!

A Lower Bound on the Area of Permutation Layouts.

电商所评分:9

点击查看评分详情!

On the Height of Digital Trees and Related Problems.

电商所评分:8

点击查看评分详情!

Stochastic Rearrangement Rules for Self-Organizing Data Structures.

电商所评分:2

点击查看评分详情!

An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum.

电商所评分:6

点击查看评分详情!

Editor's Foreword.

电商所评分:2

点击查看评分详情!