Pages that link to "Item:Q1698728"
From MaRDI portal
The following pages link to A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728):
Displaying 5 items.
- Counting polygon triangulations is hard (Q2223620) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Counting crossing-free structures (Q2874565) (← links)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
- (Q5088963) (← links)