Gill Barequet, Micha Moffie. On the complexity of Jensen s algorithm for counting fixed polyominoes. J. Discrete Algorithms, 5(2):348-355, 2007. [doi]
@article{BarequetM07,
title = {On the complexity of Jensen s algorithm for counting fixed polyominoes},
author = {Gill Barequet and Micha Moffie},
year = {2007},
doi = {10.1016/j.jda.2005.08.001},
url = {http://dx.doi.org/10.1016/j.jda.2005.08.001},
researchr = {https://researchr.org/publication/BarequetM07},
cites = {0},
citedby = {0},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {348-355},
}