Algorithms for graphs embeddable with few crossings per edge

A. Grigoriev, H.L. Bodlaender

Research output: Book/ReportReportAcademic

Original languageUndefined/Unknown
Place of PublicationUtrecht, the Netherlands
PublisherInstitute of Information and Computing Sciences
Volume2004-058
EditionUU-CS
Publication statusPublished - 2004

Keywords

  • Wiskunde en Informatica (WIIN)

Cite this