A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728): Difference between revisions

@@ Property / cites work @@
+A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
+Normal rank
@@ Property / cites work @@
+Counting triangulations and other crossing-free structures approximately
+Normal rank
@@ Property / cites work @@
+Counting crossing-free structures
@@ Property / cites work: Counting crossing-free structures / 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 @@
+Lower bounds on the number of crossing-free subgraphs of \(K_N\)
+Normal rank
@@ Property / cites work @@
+Analytic combinatorics of non-crossing configurations
+Normal rank
@@ Property / cites work @@
+Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
+Normal rank
@@ Property / cites work @@
+Counting Plane Graphs: Flippability and Its Applications
+Normal rank
@@ Property / cites work @@
+Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
+Normal rank
@@ Property / cites work @@
+Finding small simple cycle separators for 2-connected planar graphs
+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 @@
+On the Number of Crossing‐Free Matchings, Cycles, and Partitions
+Normal rank
@@ Property / cites work @@
+Counting and Enumerating Crossing-free Geometric Graphs
+Normal rank