Triangulating a non-convex polytype
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On minimal rectilinear Steiner trees in all dimensions
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Quasi-greedy triangulations approximating the minimum weight triangulation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A near-optimal heuristic for minimum weight triangulation of convex polygons
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The power-pSteiner tree problem
Nordic Journal of Computing
A better upper bound on the number of triangulations of a planar point set
Journal of Combinatorial Theory Series A
On the number of crossing-free matchings, (cycles, and partitions)
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Random triangulations of planar point sets
Proceedings of the twenty-second annual symposium on Computational geometry
Open problems around exact algorithms
Discrete Applied Mathematics
Incremental Neighborhood Graphs Construction for Multidimensional Databases Indexing
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Digital Watermarking and Steganography
Digital Watermarking and Steganography
Neighborhood graphs for indexing and retrieving multi-dimensional data
Journal of Intelligent Information Systems
The number of triangulations on planar point sets
GD'06 Proceedings of the 14th international conference on Graph drawing
On degrees in random triangulations of point sets
Proceedings of the twenty-sixth annual symposium on Computational geometry
On degrees in random triangulations of point sets
Journal of Combinatorial Theory Series A
Neighborhood graphs for semi-automatic annotation of large image databases
MMM'07 Proceedings of the 13th international conference on Multimedia Modeling - Volume Part I
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An upper bound on the number of rectangulations of a point set
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An effective method for locally neighborhood graphs updating
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters
| Hi-index | 0.00 |