Finding smooth maps is NP-complete

Jan Poland. Finding smooth maps is NP-complete. Inf. Process. Lett., 85(5):249-253, 2003. [doi]

@article{Poland03,
  title = {Finding smooth maps is NP-complete},
  author = {Jan Poland},
  year = {2003},
  doi = {10.1016/S0020-0190(02)00429-5},
  url = {http://dx.doi.org/10.1016/S0020-0190(02)00429-5},
  tags = {completeness},
  researchr = {https://researchr.org/publication/Poland03},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {85},
  number = {5},
  pages = {249-253},
}