16 citations · 106 across the 45 of their papers we have counts for
1 paper · 2 filters
Alexander Ravsky, Oleg Verbitsky
We consider straight line drawings of a planar graph G with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as…