Pages that link to "Item:Q3446814"
From MaRDI portal
The following pages link to On the Number of Crossing‐Free Matchings, Cycles, and Partitions (Q3446814):
Displayed 35 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- On the number of crossing-free partitions (Q359753) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- Flips in planar graphs (Q950400) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Point sets with many non-crossing perfect matchings (Q1699275) (← links)
- Linear transformation distance for bichromatic matchings (Q1699281) (← links)
- Colored ray configurations (Q1699300) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem (Q2090221) (← links)
- Perfect matchings with crossings (Q2169938) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- On the number of plane geometric graphs (Q2373434) (← links)
- Trapezoidal diagrams, upward triangulations, and prime Catalan numbers (Q2411817) (← links)
- Counting Plane Graphs with Exponential Speed-Up (Q3003469) (← links)
- Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
- Convex Polygons in Geometric Triangulations (Q3449827) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals (Q5024637) (← links)
- On Compatible Matchings (Q5049995) (← links)
- Packing 1-plane Hamiltonian cycles in complete geometric graphs (Q5080782) (← 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)
- Perfect matchings with crossings (Q6119827) (← links)