On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons

Chris Worman, Boting Yang. On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. In Xiaotie Deng, Ding-Zhu Du, editors, Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings. Volume 3827 of Lecture Notes in Computer Science, pages 859-868, Springer, 2005. [doi]

@inproceedings{WormanY05:0,
  title = {On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons},
  author = {Chris Worman and Boting Yang},
  year = {2005},
  doi = {10.1007/11602613_86},
  url = {http://dx.doi.org/10.1007/11602613_86},
  researchr = {https://researchr.org/publication/WormanY05%3A0},
  cites = {0},
  citedby = {0},
  pages = {859-868},
  booktitle = {Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
  editor = {Xiaotie Deng and Ding-Zhu Du},
  volume = {3827},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-30935-7},
}