k-Level Crossing Minimization is NP-Hard for Trees

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)
Original languageEnglish
Title of host publicationThe International Conference and Workshops on Algorithms and Computation (WALCOM)
DOIs
Publication statusPublished - 2011

Cite this