Q5088963 (Q5088963): Difference between revisions

@@ Property / cites work @@
+An improved lower bound on the minimum number of triangulations
+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 @@
+A lower bound on the number of triangulations of planar point sets
+Normal rank
@@ Property / cites work @@
+On the number of pseudo-triangulations of certain point sets
+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 @@
+A simple aggregative algorithm for counting triangulations of planar point sets and related problems
+Normal rank
@@ Property / cites work @@
+An upper bound for the number of planar lattice triangulations
+Normal rank
@@ Property / cites work @@
+Point sets with many non-crossing perfect matchings
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for enumeration of triangulations
+Normal rank
@@ Property / cites work @@
+Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
+Normal rank
@@ Property / cites work @@
+Every planar graph is the intersection graph of segments in the plane
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
+Normal rank
@@ Property / cites work @@
+On counting homomorphisms to directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Generating triangulations at random
@@ Property / cites work: Generating triangulations at random / rank @@
+Normal rank
@@ Property / cites work @@
+Analytic combinatorics of non-crossing configurations
+Normal rank
@@ Property / cites work @@
+Lower bounds on the number of crossing-free subgraphs of \(K_N\)
+Normal rank
@@ Property / cites work @@
+Flipping edges in triangulations
@@ Property / cites work: Flipping edges in triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the Jones and Tutte polynomials
+Normal rank
@@ Property / cites work @@
+Q4432212
@@ Property / cites work: Q4432212 / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic Minimum Spanning Trees and Related Problems
+Normal rank
@@ Property / cites work @@
+Triangulating planar graphs while minimizing the maximum degree
+Normal rank
@@ Property / cites work @@
+A QPTAS for the base of the number of crossing-free structures on a planar point set
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
+Normal rank
@@ Property / cites work @@
+A better upper bound on the number of triangulations of a planar point set
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on the number of triangulations of planar point sets
+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 @@
+Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
+Normal rank
@@ Property / cites work @@
+On the Number of Crossing‐Free Matchings, Cycles, and Partitions
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Counting and enumerating crossing-free geometric graphs
+Normal rank
@@ Property / cites work @@
+Computational complexity of counting problems on 3-regular planar graphs
+Normal rank