A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC)

Rolf Backofen. A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC). J. Discrete Algorithms, 2(2):161-206, 2004. [doi]

@article{Backofen04,
  title = {A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC)},
  author = {Rolf Backofen},
  year = {2004},
  doi = {10.1016/S1570-8667(03)00076-5},
  url = {http://dx.doi.org/10.1016/S1570-8667(03)00076-5},
  researchr = {https://researchr.org/publication/Backofen04},
  cites = {0},
  citedby = {0},
  journal = {J. Discrete Algorithms},
  volume = {2},
  number = {2},
  pages = {161-206},
}