New Sufficient Conditions On The Degree Sequences Of Uniform Hypergraphs | 0 | 0.34 | 2021 |
Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences. | 0 | 0.34 | 2019 |
A Generating Tree for Permutations Avoiding the Pattern 122+3. | 0 | 0.34 | 2018 |
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. | 0 | 0.34 | 2018 |
Permutation classes and polyomino classes with excluded submatrices. | 2 | 0.40 | 2017 |
Geometric properties of matrices induced by pattern avoidance | 0 | 0.34 | 2016 |
The Identity Transform of a Permutation and its Applications. | 0 | 0.34 | 2015 |
About Half Permutations. | 1 | 0.36 | 2014 |
Binary Pictures With Excluded Patterns | 1 | 0.36 | 2014 |
Polygons Drawn from Permutations | 0 | 0.34 | 2013 |
A tiling system for the class of L-convex polyominoes | 0 | 0.34 | 2013 |
Enumeration of 4-stack polyominoes | 0 | 0.34 | 2013 |
Generation and Enumeration of Some Classes of Interval Orders. | 1 | 0.35 | 2013 |
On the shape of permutomino tiles | 1 | 0.37 | 2013 |
A decomposition theorem for homogeneous sets with respect to diamond probes | 0 | 0.34 | 2013 |
A reconstruction algorithm for a subclass of instances of the 2-color problem | 4 | 0.44 | 2011 |
Tiling the plane with permutations | 1 | 0.37 | 2011 |
Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method. | 1 | 0.38 | 2011 |
Planar configurations induced by exact polyominoes | 0 | 0.34 | 2011 |
Catalan structures and Catalan pairs | 1 | 0.35 | 2010 |
Catalan pairs: A relational-theoretic approach to Catalan numbers | 3 | 0.45 | 2010 |
Combinatorial properties of Catalan pairs | 1 | 0.35 | 2009 |
Lattices of local two-dimensional languages | 0 | 0.34 | 2009 |
Solving some instances of the 2-color problem | 3 | 0.41 | 2009 |
The 1-color problem and the Brylawski model | 2 | 0.41 | 2009 |
Reconstructing words from a fixed palindromic length sequence | 5 | 0.48 | 2008 |
The number of Z-convex polyominoes | 12 | 0.90 | 2008 |
Scanning integer matrices by means of two rectangular windows | 2 | 0.49 | 2008 |
A Closed Formula for the Number of Convex Permutominoes | 6 | 0.91 | 2007 |
Combinatorial aspects of L-convex polyominoes | 12 | 0.82 | 2007 |
Tilings by Translation: Enumeration by a Rational Language Approach | 5 | 0.56 | 2006 |
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption | 3 | 0.46 | 2005 |
Enumeration of L-convex polyominoes by rows and columns | 13 | 1.05 | 2005 |
An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections | 1 | 0.37 | 2005 |
In memoriam: Alberto Del Lungo (1965–2003) | 0 | 0.34 | 2005 |
On the equivalence problem for succession rules | 3 | 0.41 | 2005 |
On directed-convex polyominoes in a rectangle | 11 | 0.80 | 2005 |
A tomographical characterization of l-convex polyominoes | 15 | 0.99 | 2005 |
From object grammars to ECO systems | 4 | 0.51 | 2004 |
A bijection for the total area of parallelogram polyominoes | 1 | 0.37 | 2004 |
On the Generation and Enumeration of some Classes of Convex Polyominoes | 14 | 1.01 | 2004 |
Lattice path moments by cut and paste | 1 | 0.43 | 2003 |
Jumping succession rules and their generating functions | 7 | 0.56 | 2003 |
Reconstruction of discrete sets from two absorbed projections: an algorithm | 2 | 0.64 | 2003 |
ECO method and the exhaustive generation of convex polyominoes | 4 | 0.49 | 2003 |
Some bijective results about the ares of Schröder paths | 0 | 0.34 | 2003 |
Approximating algebraic functions by means of rational ones | 4 | 0.54 | 2002 |
An algebraic characterization of the set of succession rules | 15 | 1.07 | 2002 |
Some linear recurrences and their combinatorial interpretation by means of regular languages | 2 | 0.53 | 2001 |
A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function | 10 | 0.81 | 2001 |