| Strings from Linear Recurrences - A Gray Code. | 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 |
| Generalized Schröder permutations | 0 | 0.34 | 2013 |
| Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge | 5 | 0.43 | 2013 |
| Solving the two color problem: an heuristic algorithm | 4 | 0.43 | 2011 |
| BCIF: another algorithm for lossless true color image compression | 1 | 0.36 | 2011 |
| PCIF: An Algorithm for Lossless True Color Image Compression | 2 | 0.40 | 2009 |
| An algorithm for the reconstruction of discrete sets from two projections in presence of absorption | 3 | 0.46 | 2005 |
| A Distributive Lattice Structure Connecting Dyck Paths, Noncrossing Partitions and 312-avoiding Permutations | 6 | 0.54 | 2005 |
| On directed-convex polyominoes in a rectangle | 11 | 0.80 | 2005 |
| Exhaustive generation of combinatorial objects by ECO | 17 | 0.98 | 2004 |
| Reconstruction of discrete sets from two absorbed projections: an algorithm | 2 | 0.64 | 2003 |
| A Bijection for Some Paths on the Slit Plane | 4 | 0.73 | 2001 |
| Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays | 8 | 0.89 | 2001 |
| Reconstruction of Discrete Sets from Three or More X-Rays | 3 | 0.70 | 2000 |
| Succession rules and deco polyominoes | 1 | 0.45 | 2000 |
| From Motzkin to Catalan permutations | 13 | 1.14 | 2000 |
| Permutations avoiding an increasing number of length-increasing forbidden subsequences | 9 | 1.39 | 2000 |
| Random generation of trees and other combinatorial objects | 19 | 1.28 | 1999 |
| A methodology for plane tree enumeration | 11 | 1.60 | 1998 |
| 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 |
| 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 |
| Some more properties of Catalan numbers | 6 | 0.74 | 1992 |
| A Characterization of Binary Search Networks | 4 | 1.70 | 1991 |
| Optimal Selection of Secondary Indexes | 13 | 3.13 | 1990 |
| Index Selection in Relational Databases | 17 | 19.82 | 1989 |
| On Some Properties of (a, b)-Trees | 0 | 0.34 | 1989 |
| Index Selection in a Distributed Data Base | 3 | 1.73 | 1984 |
| A Software Development System Based on a Macroprocessor | 0 | 0.34 | 1984 |
