A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel rectilinear shortest paths with rectangular obstacles
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Bottleneck Steiner Trees in the Plane
IEEE Transactions on Computers
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
Computing the Shortest Network under a Fixed Topology
IEEE Transactions on Computers
The Steiner Tree Problem in Lambda4-geometry Plane
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On Some Optimization Problems in Obnoxious Facility Location
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
A new paradigm for general architecture routing
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Rotationally optimal spanning and Steiner trees in uniform orientation metrics
Computational Geometry: Theory and Applications
Comment on "Computing the Shortest Network under a Fixed Topology'
IEEE Transactions on Computers
Robustness of k-gon Voronoi diagram construction
Information Processing Letters
Locally minimal uniformly oriented shortest networks
Discrete Applied Mathematics
Pareto envelopes in R3 under l1 and l∞ distance functions
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Zero skew clock routing in X-architecture based on an improved greedy matching algorithm
Integration, the VLSI Journal
Steiner trees for fixed orientation metrics
Journal of Global Optimization
Robustness of k-gon Voronoi diagram construction
Information Processing Letters
Rotational steiner ratio problem under uniform orientation metrics
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Faster algorithms for minimum-link paths with restricted orientations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A nearly optimal algorithm for finding L1shortest paths among polygonal obstacles in the plane
ESA'11 Proceedings of the 19th European conference on Algorithms
Flexibility of steiner trees in uniform orientation metrics
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane
Information Sciences: an International Journal
Computational Geometry: Theory and Applications
Hi-index | 0.01 |