| Publication | Date of Publication | Type |
|---|
Pattern avoiding and q-decreasing binary words
RAIRO. Theoretical Informatics and Applications | 2025-10-31 | Paper |
| Dyck paths enumerated by the \(\mathbb{Q}\)-bonacci numbers | 2025-09-03 | Paper |
Rational Dyck paths
Journal of Integer Sequences | 2025-07-14 | Paper |
| Exhaustive generation of positive lattice paths | 2024-10-31 | Paper |
| A Gray code for a regular language | 2024-10-31 | Paper |
Sequences from Fibonacci to Catalan: A combinatorial interpretation <i>via</i> 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 |
Restricting Dyck paths and 312-avoiding permutations
(available as arXiv preprint) | 2023-10-23 | Paper |
| Restricting Dyck paths and 312-avoiding permutations | 2023-10-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 |
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 |
On the generating functions of pattern-avoiding Motzkin paths
Journal of Symbolic Computation | 2022-05-05 | Paper |
Strings from linear recurrences and permutations: a Gray code
(available as arXiv preprint) | 2022-04-21 | Paper |
| A strong non-overlapping Dyck code | 2022-03-25 | Paper |
Enumerative combinatorics of intervals in the Dyck pattern poset
Order | 2021-11-19 | 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 |
| 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 |
| Restricted binary strings and generalized Fibonacci numbers | 2018-03-08 | Paper |
Vincular pattern posets and the Möbius function of the quasi-consecutive pattern poset
Annals of Combinatorics | 2017-11-30 | 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 |
Prefix partitioned Gray codes for particular cross-bifix-free sets
Cryptography and Communications | 2014-10-08 | Paper |
The Dyck pattern poset
Discrete Mathematics | 2014-01-27 | Paper |
The Möbius function of the consecutive pattern poset
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
The Möbius function of the consecutive pattern poset
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
The Möbius function of the consecutive pattern poset
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Some statistics on permutations avoiding generalized patterns
(available as arXiv preprint) | 2011-02-22 | Paper |
An exhaustive generation algorithm for Catalan objects and others
(available as arXiv preprint) | 2011-02-22 | Paper |
From Fibonacci to Catalan permutations
(available as arXiv preprint) | 2011-02-22 | Paper |
Enumeration of some classes of words avoiding two generalized patterns of length three
(available as arXiv preprint) | 2010-09-20 | Paper |
| Permutations defining convex permutominoes | 2008-05-13 | Paper |
Permutations defining convex permutominoes
(available as arXiv preprint) | 2008-05-13 | Paper |
| Permutations defining convex permutominoes | 2008-05-13 | 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 |
| Order properties of the Motzkin and Schröder families | 2008-02-22 | Paper |
A general exhaustive generation algorithm for Gray structures
Acta Informatica | 2007-09-10 | Paper |
A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
Order | 2006-06-26 | Paper |
Enumerating permutations avoiding three Babson-Steingrímsson patterns
Annals of Combinatorics | 2005-12-13 | Paper |
