Seminar 236801 Winter 2008/9
Professor Barequet
(Information provided by Olga, CS library)

1.\bibitem[AB06]{AB06}
{\sc G. Aleksandrowicz and G. Barequet},
Counting $d$-dimensional polycubes and nonrectangular planar polyominoes,
{\it Proc.\ 12th Ann.\ Int.\ Computing and Combinatorics Conf.},
Taipei, Taiwan,
{\em Lecture Notes in Computer Science}, 4112,
Springer-Verlag, 418--427, August 2006.
Full version to appear in
{\it Int.\ J. of Computational Geometry and Applications}.
Available online at the Technion (on campus)

2.\bibitem[AB08]{AB08}
{\sc G. Aleksandrowicz and G. Barequet},
Counting polycubes without the dimensionality curse,
{\it Proc.\ 14th Ann.\ Int.\ Computing and Combinatorics Conf.},
Dalian, China,
{\it Lecture Notes in Computer Science}, 5092,
Springer-Verlag, pp.~100--109, June 2008.
Available online at the Technion (on campus)

3.\bibitem[BMRR06]{BMRR06}
{\sc G. Barequet, M. Moffie, A. Rib\'{o}, and G. Rote},
Counting polyominoes on twisted cylinders,
{\em Integers} (electronic journal),
6~(2006), \#A22.
Open access 

4.\bibitem[DDFR04]{DDFR04}
{\sc A. Del Lungo, E. Duchi, A. Frosini, and S. Rinaldi},
On the generation and enumeration of some classes of convex polyominoes,
\emph{The Electronic J. of Combinatorics},
11~(2004), 46~pp.
Open access 

5.\bibitem[Ed61]{Ed61}
{\sc M. Eden},
A two-dimensional growth process,
{\em Proc.\ 4th Berkeley Symp.\ on Mathematical Statistics and
     Probability}, IV,
Berkeley, CA,
223--239, 1961.
Open access 

6.\bibitem[Je01]{Je01}
{\sc I. Jensen},
Enumerations of lattice animals and trees,
{\em J. of Statistical Physics},
102~(2001), 865--881.
Available online at the Technion (on campus)

7.\bibitem[Je03]{Je03}
{\sc I. Jensen},
Counting polyominoes: A parallel implementation for cluster computing,
{\em Proc.\ Int.\ Conf.\ on Computational Science}, part III,
Melbourne, Australia and St.~Petersburg, Russia,
{\em Lecture Notes in Computer Science}, 2659, Springer,
203--212, June 2003.
Available online at the Technion (on campus)

8.\bibitem[Kl67]{Kl67}
{\sc D.A. Klarner},
Cell growth problems,
{\em Canadian J. of Mathematics},
19~(1967), 851--863.
Printed version at the MTH library, system number 1608427

9.\bibitem[KR73]{KR73}
{\sc D.A. Klarner and R.L. Rivest},
A procedure for improving the upper bound for the number of $n$-ominoes,
{\em Canadian J. of Mathematics},
25 (1973), 585--602.
Printed version at the MTH library, system number 1608427

10.\bibitem[Lu72a]{Lu72a}
{\sc W.F. Lunnon},
Counting hexagonal and triangular polyominoes,
in: \emph{Graph Theory and Computing} (R.C. Read, ed.),
Academic Press, New York, 1972, 87--100.
Book available at the CS library, system number 2019174

11.\bibitem[Lu72b]{Lu72b}
{\sc W.F. Lunnon},
Symmetry of cubical and general polyominoes,
in: \emph{Graph Theory and Computing} (R.C. Read, ed.),
Academic Press, New York, 1972, 101--108.
Book available at the CS library, system number 2019174

12.\bibitem[Lu75]{Lu75}
{\sc W.F. Lunnon},
Counting multidimensional polyominoes,
{\em The Computer Journal},
18~(1975), 366--367.
Available online at the Technion (on campus)

13.\bibitem[Ma99]{Ma99}
{\sc N. Madras},
A pattern theorem for lattice clusters,
{\em Annals of Combinatorics},
3~(1999), 357--384.
Available online at the Technion (on campus)

14.\bibitem[ML92]{ML92}
{\sc S. Mertens and M.E. Lautenbacher},
Counting lattice animals: A parallel attack,
\emph{J. of Statistical Physics},
66~(1992), 669--678.
Printed version at the Physics library, system number 1622977

15.\bibitem[Re81]{Re81}
{\sc D.H. Redelmeier},
Counting polyominoes: Yet another attack,
{\em Discrete Mathematics},
36~(1981), 191--203.
Printed version at the CS library, system number 1612340

16. \bibitem[SGG76]{SGG76}
{\sc M.F. Sykes, D.S. Gaunt, and M. Glen},
Percolation processes in three dimensions,
{\em J. of Physics, A: Mathematical and General},
10~(1976), 1705--1712.
Available online at the Technion (on campus)

17. \bibitem{VG03}
{\sc M. V\"{o}ge and A.J. Guttmann},
On the number of hexagonal polyominoes,
{\em Theoretical Computer Science},
307~(2003), 433--453.
Available online at the Technion (on campus)