Unit disk graph recognition is NP-hard

This publication has 10 references indexed in Scilit:

• On the complexity of recognizing intersection and touching graphs of disks
  Published by Springer Nature ,1996
• Coin graphs, Polyhedra, and conformal mapping
  Discrete Mathematics, 1994
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
  Operations Research, 1991
• Unit disk graphs
  Discrete Mathematics, 1990
• On the sphericity and cubicity of graphs
  Journal of Combinatorial Theory, Series B, 1983
• The combinatorial distance geometry method for the calculation of molecular conformation. I. A new approach to an old problem
  Journal of Theoretical Biology, 1983
• Frequency assignment: Theory and applications
  Proceedings of the IEEE, 1980
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• Incidence matrices and interval graphs
  Pacific Journal of Mathematics, 1965