NP-completeness of slope-constrained drawing of complete graphs

Cédric Pilatte. NP-completeness of slope-constrained drawing of complete graphs. JoCG, 11(1):371-396, 2020. [doi]

@article{Pilatte20-0,
  title = {NP-completeness of slope-constrained drawing of complete graphs},
  author = {Cédric Pilatte},
  year = {2020},
  url = {https://journals.carleton.ca/jocg/index.php/jocg/article/view/493},
  researchr = {https://researchr.org/publication/Pilatte20-0},
  cites = {0},
  citedby = {0},
  journal = {JoCG},
  volume = {11},
  number = {1},
  pages = {371-396},
}