The following pages link to Graph Drawing (Q5193163):
Displaying 13 items.
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- An evolutionary formulation of the crossing number problem (Q1040098) (← links)
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
- Crossing Minimisation Heuristics for 2-page Drawings (Q3439393) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- A Geometric Heuristic for Rectilinear Crossing Minimization (Q5232732) (← links)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
- Advances in the Planarization Method: Effective Multiple Edge Insertions (Q5895513) (← links)
