Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

65

Voted

COMBINATORICS
2004

favoriteEmaildiscussreport

55views more COMBINATORICS 2004»

On the Generation and Enumeration of some Classes of Convex Polyominoes

15 years 12 days ago

On the Generation and Enumeration of some Classes of Convex Polyominoes

Download www.univie.ac.at

Alberto Del Lungo, Enrica Duchi, Andrea Frosini, S

Real-time Traffic

COMBINATORICS 2004 |

claim paper

Related Content

» Tilings by Translation Enumeration by a Rational Language Approach

» Steep polyominoes qMotzkin numbers and qBessel functions

» Enumeration Construction and Random Generation of Block Codes

» Dyck paths with coloured ascents

» Enumeration by kernel positions for strongly Bernoulli type truncation games on words

» Convexity and decomposition of meanrisk stochastic programs

» Identifying Clusters from Positive Data

» A Convex Programming Approach to the Trace Quotient Problem

» Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMBINATORICS
Authors	Alberto Del Lungo, Enrica Duchi, Andrea Frosini, Simone Rinaldi

Comments (0)