Pages that link to "Item:Q3132888"
From MaRDI portal
The following pages link to Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems (Q3132888):
Displayed 9 items.
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- (Q5088963) (← links)
- Convex Polygons in Geometric Triangulations (Q5366966) (← links)
- An upper bound for the number of rectangulations of a planar point set (Q6117435) (← links)