@InProceedings{l95-p245-256,
  AUTHOR    = {P. Eades and S. Whitesides},
  TITLE     = {Nearest Neighbor Graph Realizability is NP-hard},
  YEAR      = 1995,
  BOOKTITLE = {Proc.~of the 2nd Latin American Symposium on Theoretical Informatics (LATIN'95)},
  ADDRESS   = {Valparaiso, Chile},
  PAGES     = {245--256},
  KEYWORDS  = {}}