BibTeX record journals/jda/BarequetM07

download as .bib file

@article{DBLP:journals/jda/BarequetM07,
  author       = {Gill Barequet and
                  Micha Moffie},
  title        = {On the complexity of Jensen's algorithm for counting fixed polyominoes},
  journal      = {J. Discrete Algorithms},
  volume       = {5},
  number       = {2},
  pages        = {348--355},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.jda.2005.08.001},
  doi          = {10.1016/J.JDA.2005.08.001},
  timestamp    = {Tue, 16 Feb 2021 14:03:21 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BarequetM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.