Counting triangulations and other crossing-free structures via onion layers (Q2351010): Difference between revisions

@@ Property / arXiv ID @@
+.4628
@@ Property / arXiv ID: 1312.4628 / rank @@
+Normal rank
@@ Property / cites work @@
+A better upper bound on the number of triangulations of a planar point set
+Normal rank
@@ Property / cites work @@
+A lower bound on the number of triangulations of planar point sets
+Normal rank
@@ Property / cites work @@
+Gray code enumeration of plane straight-line graphs
+Normal rank
@@ Property / cites work @@
+On the number of plane geometric graphs
@@ Property / cites work: On the number of plane geometric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing-Free Subgraphs
@@ Property / cites work: Crossing-Free Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A simple aggregative algorithm for counting triangulations of planar point sets and related problems
+Normal rank
@@ Property / cites work @@
+Counting crossing-free structures
@@ Property / cites work: Counting crossing-free structures / rank @@
+Normal rank
@@ Property / cites work @@
+Counting triangulations and other crossing-free structures via onion layers
+Normal rank
@@ Property / cites work @@
+Counting triangulations and other crossing-free structures approximately
+Normal rank
@@ Property / cites work @@
+Polynomial-time instances of the minimum weight triangulation problem
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for enumeration of triangulations
+Normal rank
@@ Property / cites work @@
+Constrained Delaunay triangulations
@@ Property / cites work: Constrained Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Counting the onion
@@ Property / cites work: Counting the onion / rank @@
+Normal rank
@@ Property / cites work @@
+Generating random polygons with given vertices
@@ Property / cites work: Generating random polygons with given vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Analytic combinatorics of non-crossing configurations
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the number of crossing-free subgraphs of \(K_N\)
+Normal rank
@@ Property / cites work @@
+Triangulations and applications
@@ Property / cites work: Triangulations and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Plane Graphs: Flippability and Its Applications
+Normal rank
@@ Property / cites work @@
+Q5419979
@@ Property / cites work: Q5419979 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast enumeration algorithms for non-crossing geometric graphs
+Normal rank
@@ Property / cites work @@
+Counting Plane Graphs with Exponential Speed-Up
@@ Property / cites work: Counting Plane Graphs with Exponential Speed-Up / rank @@
+Normal rank
@@ Property / cites work @@
+On the Number of Crossing‐Free Matchings, Cycles, and Partitions
+Normal rank
@@ Property / cites work @@
+Counting triangulations of planar point sets
@@ Property / cites work: Counting triangulations of planar point sets / rank @@
+Normal rank
@@ Property / cites work @@
+On degrees in random triangulations of point sets
@@ Property / cites work: On degrees in random triangulations of point sets / rank @@
+Normal rank
@@ Property / cites work @@
+Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
+Normal rank
@@ Property / cites work @@
+Counting and Enumerating Crossing-free Geometric Graphs
+Normal rank