Enumerating order types for small sets with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Sequences of spanning trees and a fixed tree theorem
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
A better upper bound on the number of triangulations of a planar point set
Journal of Combinatorial Theory Series A
The polytope of non-crossing graphs on a planar point set
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A lower bound on the number of triangulations of planar point sets
Computational Geometry: Theory and Applications
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
On the number of pseudo-triangulations of certain point sets
Journal of Combinatorial Theory Series A
Fast enumeration algorithms for non-crossing geometric graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Planar tree transformation: Results and counterexample
Information Processing Letters
Hamiltonian Alternating Paths on Bicolored Double-Chains
Graph Drawing
On the diameter of geometric path graphs of points in convex position
Information Processing Letters
Transforming spanning trees: A lower bound
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 plane graphs: flippability and its applications
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A fixed parameter algorithm for the minimum number convex partition problem
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Counting crossing-free structures
Proceedings of the twenty-eighth annual symposium on Computational geometry
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Proceedings of the twenty-eighth annual symposium on Computational geometry
Computational geometry column 54
ACM SIGACT News
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique
Journal of Combinatorial Theory Series A
Counting plane graphs: cross-graph charging schemes
GD'12 Proceedings of the 20th international conference on Graph Drawing
On numbers of pseudo-triangulations
Computational Geometry: Theory and Applications
A simple aggregative algorithm for counting triangulations of planar point sets and related problems
Proceedings of the twenty-ninth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Hi-index | 0.00 |