论文列表及评分结果

On Triangulating Planar Graphs Under the Four-Connectivity Constraint.

电商所评分:8

点击查看评分详情!

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.

电商所评分:6

点击查看评分详情!

Upper and Lower Bounds for Selection in the Mesh.

电商所评分:6

点击查看评分详情!

Minimizing Mean Flow Time with Error Constraint.

电商所评分:1

点击查看评分详情!

Average-Case Analysis of Dynamic Graph Algorithms.

电商所评分:7

点击查看评分详情!

Minkowski-Type Theorems and Least-Squares Clustering.

电商所评分:10

点击查看评分详情!

On Learning Decision Trees with Large Output Domains.

电商所评分:1

点击查看评分详情!

An Algorithm for Straight-Line Drawing of Planar Graphs.

电商所评分:2

点击查看评分详情!

Efficient Randomized Algorithms for the Repeated Median Line Estimator.

电商所评分:6

点击查看评分详情!

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.

电商所评分:6

点击查看评分详情!

A Unified Analysis of Paging and Caching.

电商所评分:2

点击查看评分详情!

Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space.

电商所评分:10

点击查看评分详情!

Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source.

电商所评分:3

点击查看评分详情!

Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line.

电商所评分:7

点击查看评分详情!

On Coloring Unit Disk Graphs.

电商所评分:5

点击查看评分详情!

Minimum Dominating Sets of Intervals on Lines.

电商所评分:3

点击查看评分详情!

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem.

电商所评分:8

点击查看评分详情!

A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains.

电商所评分:2

点击查看评分详情!

Two-Dimensional Prefix String Matching and Covering on Square Matrices.

电商所评分:6

点击查看评分详情!

Approximation Algorithms for Connected Dominating Sets.

电商所评分:2

点击查看评分详情!

String Matching in Lempel-Ziv Compressed Strings.

电商所评分:1

点击查看评分详情!

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.

电商所评分:8

点击查看评分详情!

On Minimum-Area Hulls.

电商所评分:7

点击查看评分详情!

Lempel-Ziv Index for q-Grams.

电商所评分:1

点击查看评分详情!

Fast Generation of Random Permutations Via Networks Simulation.

电商所评分:4

点击查看评分详情!

Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal.

电商所评分:6

点击查看评分详情!

The Analysis of Linear Probing Hashing with Buckets.

电商所评分:9

点击查看评分详情!

Parallel Approximation Algorithms by Positive Linear Programming.

电商所评分:3

点击查看评分详情!

Matching Convex Shapes with Respect to the Symmetric Difference.

电商所评分:1

点击查看评分详情!

Interval Routing Schemes.

电商所评分:4

点击查看评分详情!