Crossmark

Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings

Published Online: 2026-05-23

Published Print: 2026-06

Authors

Baumann, Jakob

Rutter, Ignaz

Sudholt, Dirk
Funding

Funding for this research was provided by:

Universität Passau
License Information

Text and Data Mining valid from 2026-05-23

Version of Record valid from 2026-05-23
More Information

Article History

Received: 20 December 2024

Accepted: 24 November 2025

First Online: 23 May 2026

Declarations

:

: The authors declare no Conflict of interest.

Document is current