Minimizing crossings in constrained two-sided circular graph layouts

Abstract

Full Citation:

Klute, Fabian, Nöllenburg, Martin. Minimizing crossings in constrained two-sided circular graph layouts. European Workshop on Computational Geometry (EuroCG'17), pages 265-268, April 2017.

Martin Nöllenburg
Martin Nöllenburg

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