52 citations · 118 across the 27 of their papers we have counts for
1 paper · 1 filter
Michael J. Bannister, Sergio Cabello, David Eppstein
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this…