1. Adding one edge to planar graphs makes crossing number hard;Cabello,2010
2. Crossing number and weighted crossing number of near-planar graphs;Cabello;Algorithmica,2011
3. Inserting a vertex into a planar graph;Chimani,2009
4. Approximating the crossing number of graphs embeddable in any orientable surface;Chimani,2010
5. A tighter insertion-based approximation of the crossing number;Chimani,2011