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.