Pages that link to "Item:Q1943651"
From MaRDI portal
The following pages link to Hardness of approximation for crossing number (Q1943651):
Displayed 11 items.
- Crossing numbers and stress of random graphs (Q1725756) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Exact crossing number parameterized by vertex cover (Q2206863) (← links)
- Inapproximability ratios for crossing number (Q2413159) (← links)
- The Bundled Crossing Number (Q2961534) (← links)
- Deciding Parity of Graph Crossing Number (Q4578013) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- (Q5136229) (← links)
- Crossing minimization in perturbed drawings (Q5896138) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)