scientific article; zbMATH DE number 7559233
From MaRDI portal
Publication:5088963
DOI10.4230/LIPICS.SOCG.2019.33MaRDI QIDQ5088963
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Counting triangulations of planar point sets
- The complexity of computing the permanent
- How to draw a planar graph on a grid
- Note on the number of triangulations of planar point sets
- Analytic combinatorics of non-crossing configurations
- Triangulating planar graphs while minimizing the maximum degree
- An upper bound for the number of planar lattice triangulations
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- A QPTAS for the base of the number of crossing-free structures on a planar point set
- Point sets with many non-crossing perfect matchings
- Flipping edges in triangulations
- An efficient algorithm for enumeration of triangulations
- A better upper bound on the number of triangulations of a planar point set
- A lower bound on the number of triangulations of planar point sets
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Counting triangulations and other crossing-free structures approximately
- Counting triangulations and other crossing-free structures via onion layers
- On the number of plane geometric graphs
- Computational complexity of counting problems on 3-regular planar graphs
- On the number of pseudo-triangulations of certain point sets
- The Complexity of Counting in Sparse, Regular, and Planar Graphs
- Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
- An improved lower bound on the minimum number of triangulations
- Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
- On counting homomorphisms to directed acyclic graphs
- Hard Enumeration Problems in Geometry and Combinatorics
- On the computational complexity of the Jones and Tutte polynomials
- Generating triangulations at random
- Every planar graph is the intersection graph of segments in the plane
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems
- Stochastic Minimum Spanning Trees and Related Problems
- Computing and Combinatorics
- Counting and enumerating crossing-free geometric graphs
This page was built for publication:
