Pages that link to "Item:Q2849795"
From MaRDI portal
The following pages link to The Rectilinear Crossing Number of K n : Closing in (or Are We?) (Q2849795):
Displaying 14 items.
- A lower bound on the crossing number of uniform hypergraphs (Q298946) (← links)
- A Ramsey-type result for geometric \(\ell\)-hypergraphs (Q740277) (← links)
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Stress-Plus-X (SPX) graph layout (Q2206862) (← links)
- On compatible matchings (Q2232249) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
- Graph Drawing via Gradient Descent, $$(GD)^2$$ (Q5014098) (← links)
- On Compatible Matchings (Q5049995) (← links)
- A survey of mass partitions (Q5067418) (← links)
- An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants (Q5119386) (← links)
- Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← links)
