Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Analytic combinatorics of non-crossing configurations
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Lower bounds on the number of crossing-free subgraphs of KN
Computational Geometry: Theory and Applications
An efficient algorithm for enumeration of triangulations
Computational Geometry: Theory and Applications
Convexity minimizes pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
On the Number of Crossing-Free Matchings, Cycles, and Partitions
SIAM Journal on Computing
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
On the Number of Plane Geometric Graphs
Graphs and Combinatorics
On triangulations of a set of points in the plane
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Fast Enumeration Algorithms for Non-crossing Geometric Graphs
Discrete & Computational Geometry - Special Issue: 24th Annual Symposium on Computational Geometry
On the number of spanning trees a planar graph can have
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Triangulations: Structures for Algorithms and Applications
Triangulations: Structures for Algorithms and Applications
On degrees in random triangulations of point sets
Journal of Combinatorial Theory Series A
Counting plane graphs with exponential speed-up
Rainbow of computer science
Counting plane graphs: flippability and its applications
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
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
On the number of cycles in planar graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |