Minimizing crossings in constrained two-sided circular graph layouts

Martin Nöllenburg
Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.