Minimizing crossings in constrained two-sided circular graph layouts

Abstract

Full Citation:

Fabian Klute, Martin Nöllenburg. Minimizing crossings in constrained two-sided circular graph layouts. J. Computational Geometry, volume 10, number 2, pages 45–69, 2019.

Martin Nöllenburg

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