The following pages link to (Q3132864):
Displaying 14 items.
- Crossing numbers and stress of random graphs (Q1725756) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- (Q5075824) (← links)
- (Q5136229) (← links)
- Inserting an edge into a geometric embedding (Q5915946) (← links)
- Inserting an edge into a geometric embedding (Q5918441) (← links)
- Inserting one edge into a simple drawing is hard (Q5925627) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- (Q6065397) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
