<?xml version="1.0"?>
<dblp>
<article key="journals/jda/BarequetM07" mdate="2007-05-10">
<author>Gill Barequet</author>
<author>Micha Moffie</author>
<title>On the complexity of Jensen's algorithm for counting fixed polyominoes.</title>
<pages>348-355</pages>
<year>2007</year>
<volume>5</volume>
<journal>J. Discrete Algorithms</journal>
<number>2</number>
<ee>http://dx.doi.org/10.1016/j.jda.2005.08.001</ee>
<url>db/journals/jda/jda5.html#BarequetM07</url>
</article>
</dblp>
