Michael Kaufmann

This study examines methods to minimize crossings in ordered graphs using efficient algorithms.

Learn about the construction and significance of monotone arc diagrams in graph representation.

New methods improve estimates of edge crossings in dense graphs.