Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"One Sided Crossing Minimization Is NP-Hard for Sparse Graphs."

Xavier Muñoz, Walter Unger, Imrich Vrto (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-45848-4_10

access: closed

type: Conference or Workshop Paper

metadata version: 2022-11-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/gd/MunozUV01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/MunozUV01
Xavier Muñoz, Walter Unger, Imrich Vrto:
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. GD 2001: 115-123

a service of

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.