The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
SCG '86 Proceedings of the second annual symposium on Computational geometry
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
A new approach to the rectilinear Steiner tree problem
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
A multi-layer router utilizing over-cell areas
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Bottleneck Steiner Trees in the Plane
IEEE Transactions on Computers
A new generalized row-based global router
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A practical algorithm for computing the Delaunay triangulation for convex distance functions
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Two-Dimensional Voronoi Diagrams in the Lp-Metric
Journal of the ACM (JACM)
Distance problems in computational geometry with fixed orientations
SCG '85 Proceedings of the first annual symposium on Computational geometry
Voronoi diagrams based on convex distance functions
SCG '85 Proceedings of the first annual symposium on Computational geometry
The rectilinear Steiner arborescence problem is NP-complete
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Practical approximation algorithms for zero- and bounded-skew trees
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient minimum spanning tree construction without Delaunay triangulation
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Efficient Steiner tree construction based on spanning graphs
Proceedings of the 2003 international symposium on Physical design
Geodesic Voronoi diagrams in the presence of rectilinear barriers
Nordic Journal of Computing
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Probabilistic Analysis of Rectilinear Steiner Trees
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Efficient octilinear Steiner tree construction based on spanning graphs
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A Scheme for Computing Minimum Covers within Simple Regions
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection
Proceedings of the 2009 International Conference on Computer-Aided Design
| Hi-index | 0.01 |