Pages that link to "Item:Q2351010"
From MaRDI portal
The following pages link to Counting triangulations and other crossing-free structures via onion layers (Q2351010):
Displaying 10 items.
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- New estimates for convex layer numbers (Q2032744) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Bijective counting of Kreweras walks and loopless triangulations (Q2371300) (← links)
- Counting crossing-free structures (Q2874565) (← links)
- Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems (Q3132888) (← links)
- (Q5088963) (← links)
- Non-crossing Hamiltonian paths and cycles in output-polynomial time (Q6614115) (← links)