| Publication | Date of Publication | Type |
|---|
Exhaustive generation of positive lattice paths
| 2024-10-31 | Paper |
A Gray code for a regular language
| 2024-10-31 | Paper |
Reconstructing convex polyominoes from horizontal and vertical projections. II
| 2024-07-05 | Paper |
Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths
RAIRO - Theoretical Informatics and Applications | 2024-04-16 | Paper |
A Construction for Variable Dimension Strong Non-Overlapping Matrices
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
A construction for enumerating k-coloured Motzkin paths
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Restricting Dyck paths and 312-avoiding permutations
| 2023-10-23 | Paper |
Classes of Dyck paths associated with numerical semigroups
Pure Mathematics and Applications | 2023-01-23 | Paper |
Non-overlapping matrices via Dyck words
Enumerative Combinatorics and Applications | 2022-12-07 | Paper |
From the Fibonacci to Pell numbers and beyond via Dyck paths
Pure Mathematics and Applications | 2022-11-09 | Paper |
Directed column-convex polyominoes by recurrence relations
Lecture Notes in Computer Science | 2022-11-02 | Paper |
Strings from linear recurrences and permutations: a gray code
Theoretical Computer Science | 2022-10-24 | Paper |
Strings from linear recurrences: a Gray code
| 2022-05-20 | Paper |
Strings from linear recurrences and permutations: a Gray code
| 2022-04-21 | Paper |
A strong non-overlapping Dyck code
| 2022-03-25 | Paper |
Exhaustive generation of some lattice paths and their prefixes
Theoretical Computer Science | 2021-07-22 | Paper |
Variable dimension non-overlapping matrices
| 2020-06-10 | Paper |
Recurrence relations, succession rules and the positivity problem
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Non-overlapping Dyck matrices
| 2018-11-27 | Paper |
A 2D non-overlapping code over a \(q\)-ary alphabet
Cryptography and Communications | 2018-03-09 | Paper |
A New Approach to Cross-Bifix-Free Sets
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A Gray code for cross-bifix-free sets
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
A generating function for bit strings with no Grand Dyck pattern matching
Pure Mathematics and Applications | 2017-03-31 | Paper |
Cross-bifix-free sets in two dimensions
Theoretical Computer Science | 2017-03-16 | Paper |
Non-overlapping matrices
Theoretical Computer Science | 2016-12-19 | Paper |
Cross-bifix-free sets generation via Motzkin paths
RAIRO - Theoretical Informatics and Applications | 2016-08-12 | Paper |
The medians of discrete sets
Information Processing Letters | 2016-06-09 | Paper |
Recurrence relations, succession rules, and the positivity problem
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Pattern \(1^j0^i\) avoiding binary words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Prefix partitioned Gray codes for particular cross-bifix-free sets
Cryptography and Communications | 2014-10-08 | Paper |
Pattern-avoiding Dyck paths
| 2014-02-18 | Paper |
The Dyck pattern poset
Discrete Mathematics | 2014-01-27 | Paper |
Catalan structures and Catalan pairs
Theoretical Computer Science | 2014-01-10 | Paper |
Combinatorial properties of Catalan pairs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
A construction for a class of binary words avoiding \(1^j0^i\)
| 2013-08-06 | Paper |
Six bijections between deco polyominoes and permutations
| 2013-08-06 | Paper |
Avoiding cross-bifix-free binary words
Acta Informatica | 2013-06-28 | Paper |
Generation and enumeration of some classes of interval orders
Order | 2013-06-26 | Paper |
Catalan lattices on series parallel interval orders
Associahedra, Tamari Lattices and Related Structures | 2013-03-25 | Paper |
A tiling system for the class of \(L\)-convex polyominoes
Theoretical Computer Science | 2013-03-04 | Paper |
Recurrence relations versus succession rules
| 2013-01-14 | Paper |
Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method.
Ars Combinatoria | 2012-10-08 | Paper |
Pattern \(1^{j+1}0^{j}\) avoiding binary words
Fundamenta Informaticae | 2012-07-11 | Paper |
Polyominoes determined by permutations: enumeration via bijections
Annals of Combinatorics | 2012-07-10 | Paper |
Characterization and enumeration of some classes of permutominoes
| 2011-02-22 | Paper |
Catalan pairs: a relational-theoretic approach to Catalan numbers
Advances in Applied Mathematics | 2010-09-30 | Paper |
Enumeration of some classes of words avoiding two generalized patterns of length three
| 2010-09-20 | Paper |
Polyominoes determined by permutations
| 2010-07-05 | Paper |
The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
Mathematical and Computer Modelling | 2010-05-02 | Paper |
Mixed succession rules: the commutative case
Journal of Combinatorial Theory. Series A | 2010-04-21 | Paper |
The combinatorics of convex permutominoes
Southeast Asian Bulletin of Mathematics | 2009-11-11 | Paper |
A closed formula for the number of convex permutominoes
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Permutations defining convex permutominoes
| 2008-05-13 | Paper |
A general exhaustive generation algorithm for Gray structures
Acta Informatica | 2007-09-10 | Paper |
Catalan-like numbers and succession rules
| 2007-03-29 | Paper |
Enumerating permutations avoiding three Babson-Steingrímsson patterns
Annals of Combinatorics | 2005-12-13 | Paper |
Lattices of lattice paths
Journal of Statistical Planning and Inference | 2005-10-10 | Paper |
A bijection for the total area of parallelogram polyominoes
Discrete Applied Mathematics | 2005-02-23 | Paper |
scientific article; zbMATH DE number 2127714 (Why is no real title available?)
| 2005-01-14 | Paper |
Jumping succession rules and their generating functions
Discrete Mathematics | 2003-09-25 | Paper |
scientific article; zbMATH DE number 1984536 (Why is no real title available?)
| 2003-09-22 | Paper |
Lattice path moments by cut and paste
Advances in Applied Mathematics | 2003-07-29 | Paper |
scientific article; zbMATH DE number 1919535 (Why is no real title available?)
| 2003-05-27 | Paper |
X-rays characterizing some classes of discrete sets
Linear Algebra and its Applications | 2002-09-29 | Paper |
A bijective approach to the area of generalized Motzkin paths
Advances in Applied Mathematics | 2002-09-12 | Paper |
Some permutations with forbidden subsequences and their inversion number
Discrete Mathematics | 2002-09-11 | Paper |
An algebraic characterization of the set of succession rules
Theoretical Computer Science | 2002-07-15 | Paper |
A linear operator approach to succession rules
Linear Algebra and its Applications | 2002-06-27 | Paper |
Vexillary involutions are enumerated by Motzkin numbers
Annals of Combinatorics | 2002-06-16 | Paper |
scientific article; zbMATH DE number 1741019 (Why is no real title available?)
| 2002-06-10 | Paper |
Stirling numbers interpolation using permutations with forbidden subsequences
Discrete Mathematics | 2002-05-15 | Paper |
A bijection for some paths on the slit plane
Advances in Applied Mathematics | 2002-05-07 | Paper |
Approximating algebraic functions by means of rational ones
Theoretical Computer Science | 2002-03-03 | Paper |
ECO method and hill-free generalized Motzkin paths
Séminaire Lotharingien de Combinatoire | 2001-11-08 | Paper |
ECO-systems for Dyck and Schröder paths
PU.M.A. Pure Mathematics and Applications | 2001-11-05 | Paper |
The height of directed column-convex polyominoes
Séminaire Lotharingien de Combinatoire | 2001-11-05 | Paper |
About half the middle binomial coefficient
PU.M.A. Pure Mathematics and Applications | 2001-11-05 | Paper |
Schröder's paths and random hierarchies
Theoretical Computer Science | 2001-08-20 | Paper |
From Motzkin to Catalan permutations
Discrete Mathematics | 2001-08-02 | Paper |
scientific article; zbMATH DE number 1504637 (Why is no real title available?)
| 2001-06-28 | Paper |
scientific article; zbMATH DE number 1552332 (Why is no real title available?)
| 2001-03-19 | Paper |
Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
Discrete Mathematics | 2000-11-02 | Paper |
scientific article; zbMATH DE number 1447312 (Why is no real title available?)
| 2000-05-18 | Paper |
Some combinatorial interpretations of \(q\)-analogs of Schröder numbers
Annals of Combinatorics | 2000-04-10 | Paper |
ECO:a methodology for the enumeration of combinatorial objects
Journal of Difference Equations and Applications | 1999-12-02 | Paper |
A combinatorial interpretation of the area of Schröder paths
The Electronic Journal of Combinatorics | 1999-11-24 | Paper |
Directed animals, forests and permutations
Discrete Mathematics | 1999-09-02 | Paper |
A methodology for plane tree enumeration
Discrete Mathematics | 1999-01-11 | Paper |
Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
Discrete Mathematics | 1998-05-04 | Paper |
``Deco polyominoes, permutations and random generation
Theoretical Computer Science | 1997-02-27 | Paper |
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science | 1997-02-27 | Paper |
Polyominoes defined by their vertical and horizontal projections
Theoretical Computer Science | 1997-02-27 | Paper |
The number of convex polyominoes reconstructible from their orthogonal projections
Discrete Mathematics | 1997-02-24 | Paper |
scientific article; zbMATH DE number 841833 (Why is no real title available?)
| 1996-02-15 | Paper |
The random generation of underdiagonal walks
Discrete Mathematics | 1995-09-27 | Paper |
The random generation of directed animals
Theoretical Computer Science | 1995-02-09 | Paper |
scientific article; zbMATH DE number 64155 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 4213430 (Why is no real title available?)
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 4155928 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4001511 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3887116 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3754070 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3586482 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3596216 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3506174 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3466536 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3413802 (Why is no real title available?)
| 1973-01-01 | Paper |
scientific article; zbMATH DE number 3436600 (Why is no real title available?)
| 1973-01-01 | Paper |
scientific article; zbMATH DE number 3428504 (Why is no real title available?)
| 1973-01-01 | Paper |
