| Original language | Undefined/Unknown |
|---|---|
| Place of Publication | Utrecht |
| Publisher | Utrecht University: Information and Computing Sciences |
| Volume | 2003-031 |
| Edition | UU-CS |
| Publication status | Published - 2003 |
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
S. Cabello
Research output: Book/Report › Report › Academic