"Algorithms for Graphs Embeddable with Few Crossings per Edge."

Alexander Grigoriev, Hans L. Bodlaender (2007)

> Home

Details and statistics

DOI: 10.1007/S00453-007-0010-X

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GrigorievB07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GrigorievB07
Alexander Grigoriev, Hans L. Bodlaender:
Algorithms for Graphs Embeddable with Few Crossings per Edge. Algorithmica 49(1): 1-11 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.