Pages that link to "Item:Q2817887"
From MaRDI portal
The following pages link to Approximating the Maximum Rectilinear Crossing Number (Q2817887):
Displaying 13 items.
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042) (← links)
- The maximum number of intersections between two plane rectangular paths (Q1904987) (← links)
- Weighted Turán problems with applications (Q2319696) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- On the Maximum Crossing Number (Q4600737) (← links)
- Counting Maximal Points in a Query Orthogonal Rectangle (Q4914436) (← links)
- An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants (Q5119386) (← links)
- (Q5224722) (← links)
- A Geometric Heuristic for Rectilinear Crossing Minimization (Q5232732) (← links)
- Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees (Q5237063) (← links)
- Computational search of small point sets with small rectilinear crossing number (Q5494864) (← links)
- (Q5864863) (← links)
- Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← links)