Skip to main navigation Skip to search Skip to main content

Algorithms for graphs embeddable with few crossings per edge

  • H.L. Bodlaender
  • , A. Grigoriev*
    • *Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Fingerprint

Dive into the research topics of 'Algorithms for graphs embeddable with few crossings per edge'. Together they form a unique fingerprint.
Sort by

Keyphrases

INIS

Mathematics