2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Petr Hliněný, Marek Derňár
The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult,…