"Complexity Results for Three-Dimensional Orthogonal Graph Drawing."

Maurizio Patrignani (2005)

> Home

Details and statistics

DOI: 10.1007/11618058_33

access: open

type: Conference or Workshop Paper

metadata version: 2022-11-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/gd/Patrignani05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/Patrignani05
Maurizio Patrignani:
Complexity Results for Three-Dimensional Orthogonal Graph Drawing. GD 2005: 368-379

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.