Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Which triangulations approximate the complete graph?
Proceedings of the international symposium on Optimal algorithms
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
Ears of triangulations and Catalan numbers
Discrete Mathematics
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
On computing edges that are in all minimum-weight triangulations
Proceedings of the twelfth annual symposium on Computational geometry
Triangulations, visibility graph and reflex vertices of a simple polygon
Computational Geometry: Theory and Applications
Implementations of the LMT heuristic for minimum weight triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
Analytic combinatorics of non-crossing configurations
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Diamonds Are Not a Minimum Weight Triangulation's Best Friend
Proceedings of the 8th Canadian Conference on Computational Geometry
Enumerating order types for small sets with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
An efficient algorithm for enumeration of triangulations
Computational Geometry: Theory and Applications
A lower bound on the number of triangulations of planar point sets
Computational Geometry: Theory and Applications
Random triangulations of planar point sets
Proceedings of the twenty-second annual symposium on Computational geometry
The minimum weight triangulation problem with few inner points
Computational Geometry: Theory and Applications
Abstract order type extension and new results on the rectilinear crossing number
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
The minimum weight triangulation problem with few inner points
Computational Geometry: Theory and Applications
The number of triangulations on planar point sets
GD'06 Proceedings of the 14th international conference on Graph drawing
Counting crossing-free structures
Proceedings of the twenty-eighth annual symposium on Computational geometry
A simple aggregative algorithm for counting triangulations of planar point sets and related problems
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |