| A Strong Non-overlapping Dyck Code. | 1 | 0.36 | 2021 |
| Strings from Linear Recurrences - A Gray Code. | 0 | 0.34 | 2021 |
| Exhaustive Generation Of Some Lattice Paths And Their Prefixes | 0 | 0.34 | 2021 |
| Exhaustive generation of positive lattice paths. | 0 | 0.34 | 2018 |
| A Gray code for a regular language. | 0 | 0.34 | 2018 |
| A 2D non-overlapping code over a q-ary alphabet | 2 | 0.38 | 2018 |
| Cross-bifix-free sets in two dimensions. | 2 | 0.37 | 2017 |
| Non-overlapping matrices. | 1 | 0.36 | 2017 |
| Cross-bifix-free sets generation. | 0 | 0.34 | 2016 |
| Recurrence Relations, Succession Rules, and the Positivity Problem. | 0 | 0.34 | 2015 |
| Gray code orders for $$q$$q-ary words avoiding a given factor | 2 | 0.50 | 2015 |
| The Dyck pattern poset. | 3 | 0.52 | 2014 |
| Prefix partitioned gray codes for particular cross-bifix-free sets | 2 | 0.38 | 2014 |
| A Gray code for cross-bifix-free sets. | 2 | 0.38 | 2014 |
| Gray code orders for $q$-ary words avoiding a given factor. | 1 | 0.36 | 2014 |
| Avoiding cross-bifix-free binary words | 4 | 0.55 | 2013 |
| Recurrence relations versus succession rules | 0 | 0.34 | 2013 |
| Generation and Enumeration of Some Classes of Interval Orders. | 1 | 0.35 | 2013 |
| Pattern 1^j0^i avoiding binary words | 0 | 0.34 | 2012 |
| Generation of binary words avoiding alternating patterns | 0 | 0.34 | 2012 |
| A New Approach to Cross-Bifix-Free Sets | 10 | 0.76 | 2012 |
| Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method. | 1 | 0.38 | 2011 |
| Binary words avoiding a pattern and marked succession rule | 1 | 0.43 | 2011 |
| Mixed succession rules: The commutative case | 1 | 0.40 | 2010 |
| Catalan pairs: A relational-theoretic approach to Catalan numbers | 3 | 0.45 | 2010 |
| Combinatorial properties of Catalan pairs | 1 | 0.35 | 2009 |
| Enumeration of some classes of words avoiding two generalized patterns of length three | 2 | 0.42 | 2009 |
| A general exhaustive generation algorithm for Gray structures | 7 | 0.58 | 2007 |
| A Closed Formula for the Number of Convex Permutominoes | 6 | 0.91 | 2007 |
| A bijection for the total area of parallelogram polyominoes | 1 | 0.37 | 2004 |
| Jumping succession rules and their generating functions | 7 | 0.56 | 2003 |
| An algebraic characterization of the set of succession rules | 15 | 1.07 | 2002 |
| A Bijection for Some Paths on the Slit Plane | 4 | 0.73 | 2001 |
| A Bijection for Directed-Convex Polyominoes | 3 | 0.56 | 2001 |
| Chemins de Schröder et hiérarchies aléatoires | 3 | 0.48 | 2001 |
| From Motzkin to Catalan permutations | 13 | 1.14 | 2000 |
| Permutations avoiding an increasing number of length-increasing forbidden subsequences | 9 | 1.39 | 2000 |
| A Combinatorial Interpretation of the Area of Schröder Paths | 5 | 0.84 | 1999 |
| Medians Of Polyominoes: A Property For Reconstruction | 23 | 2.11 | 1998 |
| A methodology for plane tree enumeration | 11 | 1.60 | 1998 |
| Reconstructing Digital Sets from X-Rays | 0 | 0.34 | 1997 |
| Reconstruction convex polyominoes from horizontal and vertical projections II | 15 | 2.19 | 1996 |
| Reconstructing convex polyominoes from horizontal and vertical projections | 95 | 8.71 | 1996 |
| “Deco” polyominoes, permutations and random generation | 2 | 0.56 | 1996 |
| The number of convex polyominoes reconstructible from their orthogonal projections | 26 | 1.90 | 1996 |
| Polyominoes defined by their vertical and horizontal projections | 0 | 0.34 | 1996 |
| A Construction for Enumerating k-coloured Motzkin Paths | 17 | 2.08 | 1995 |
| Directed Column-Convex Polyominoes by Recurrence Relations | 10 | 1.97 | 1993 |
| A Characterization of Binary Search Networks | 4 | 1.70 | 1991 |
| Index Selection in Relational Databases | 17 | 19.82 | 1989 |
