| Publication | Date of Publication | Type |
|---|
An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence
Theoretical Computer Science | 2024-11-07 | Paper |
A construction for enumerating k-coloured Motzkin paths
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Structure and complexity of 2-intersection graphs of 3-hypergraphs
Algorithmica | 2023-03-09 | Paper |
On doubly symmetric Dyck words
Theoretical Computer Science | 2021-11-18 | Paper |
| Burrows-Wheeler transform of words defined by morphisms | 2020-02-25 | Paper |
| A study on the fixed points of the $\gamma$ function | 2019-11-12 | Paper |
Recurrence relations, succession rules and the positivity problem
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Pattern avoiding languages and recurrence relations interpretation
Fundamenta Informaticae | 2018-03-02 | Paper |
A New Approach to Cross-Bifix-Free Sets
IEEE Transactions on Information Theory | 2017-07-12 | 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 generation via Motzkin paths
RAIRO - Theoretical Informatics and Applications | 2016-08-12 | 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 |
Pattern \(1^j0^i\) avoiding binary words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
| scientific article; zbMATH DE number 6521429 (Why is no real title available?) | 2015-12-16 | Paper |
| Counting binary words avoiding alternating patterns | 2014-03-24 | Paper |
| A construction for a class of binary words avoiding \(1^j0^i\) | 2013-08-06 | Paper |
Six bijections between deco polyominoes and permutations
(available as arXiv preprint) | 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 |
| 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 |
A Gray code for permutations of size \(2d\) with \(d\) descents
PU.M.A. Pure Mathematics and Applications | 2012-09-18 | Paper |
Some properties of non minimal permutations
PU.M.A. Pure Mathematics and Applications | 2012-09-18 | Paper |
Pattern \(1^{j+1}0^{j}\) avoiding binary words
Fundamenta Informaticae | 2012-07-11 | Paper |
On the exhaustive generation of convex permutominoes
(available as arXiv preprint) | 2011-02-22 | Paper |
| Posets and permutations in the duplication-loss model | 2011-02-22 | Paper |
Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
Theoretical Computer Science | 2010-06-07 | Paper |
| Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns | 2008-05-13 | Paper |
Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns
(available as arXiv preprint) | 2008-05-13 | Paper |
| Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns | 2008-05-13 | Paper |
A general exhaustive generation algorithm for Gray structures
Acta Informatica | 2007-09-10 | Paper |
Non-uniform random generation of generalized Motzkin paths
Acta Informatica | 2006-05-26 | Paper |
In memoriam: Alberto Del Lungo (1965--2003)
Theoretical Computer Science | 2006-01-10 | Paper |
On the equivalence problem for succession rules
Discrete Mathematics | 2005-09-22 | Paper |
Exhaustive generation of combinatorial objects by ECO
Acta Informatica | 2004-12-13 | Paper |
Some bijective results about the area of Schröder paths
Theoretical Computer Science | 2004-10-27 | 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 |
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 |
Two bijections for the area of Dyck paths
Discrete Mathematics | 2002-08-14 | Paper |
An algebraic characterization of the set of succession rules
Theoretical Computer Science | 2002-07-15 | Paper |
Vexillary involutions are enumerated by Motzkin numbers
Annals of Combinatorics | 2002-06-16 | 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 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 |
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 |
Enumeration of vexillary involutions which are equal to their mirror/complement
Discrete Mathematics | 2000-11-20 | Paper |
| scientific article; zbMATH DE number 1447312 (Why is no real title available?) | 2000-05-18 | 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 |
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 |
Random generation of trees and other combinatorial objects
Theoretical Computer Science | 1999-06-21 | Paper |
A methodology for plane tree enumeration
Discrete Mathematics | 1999-01-11 | Paper |
| scientific article; zbMATH DE number 1196088 (Why is no real title available?) | 1998-10-11 | Paper |
