| 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 |
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 |
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 |
Ambiguity results in the characterization of \(hv\)-convex polyominoes from projections
| 2018-01-19 | 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 |
Generalized Schröder permutations
Theoretical Computer Science | 2014-01-10 | Paper |
Solving multicolor discrete tomography problems by using prior knowledge
Fundamenta Informaticae | 2013-08-29 | Paper |
Reconstructing convex permutominoes
PU.M.A. Pure Mathematics and Applications | 2012-09-18 | Paper |
Solving the two color problem: an heuristic algorithm
Lecture Notes in Computer Science | 2011-05-27 | Paper |
BCIF: Another Algorithm for Lossless True Color Image Compression
Lecture Notes in Computer Science | 2011-05-27 | Paper |
From Fibonacci to Catalan permutations
| 2011-02-22 | Paper |
The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
Mathematical and Computer Modelling | 2010-05-02 | Paper |
PCIF: an algorithm for lossless true color image compression
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Emission discrete tomography
| 2008-01-04 | Paper |
Reconstruction of discrete sets from two absorbed projections: an algorithm
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
Order | 2006-06-26 | Paper |
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption
Discrete Applied Mathematics | 2005-11-07 | Paper |
On directed-convex polyominoes in a rectangle
Discrete Mathematics | 2005-09-22 | Paper |
scientific article; zbMATH DE number 2152304 (Why is no real title available?)
| 2005-04-04 | Paper |
Exhaustive generation of combinatorial objects by ECO
Acta Informatica | 2004-12-13 | Paper |
X-rays characterizing some classes of discrete sets
Linear Algebra and its Applications | 2002-09-29 | Paper |
Some permutations with forbidden subsequences and their inversion number
Discrete Mathematics | 2002-09-11 | Paper |
A technology for reverse-engineering a combinatorial problem from a rational generating function
Advances in Applied Mathematics | 2002-05-07 | Paper |
A bijection for some paths on the slit plane
Advances in Applied Mathematics | 2002-05-07 | Paper |
Reconstruction of lattice sets from their horizontal, vertical and diagonal \(X\)-rays
Discrete Mathematics | 2002-01-08 | Paper |
ECO method and hill-free generalized Motzkin paths
Séminaire Lotharingien de Combinatoire | 2001-11-08 | Paper |
scientific article; zbMATH DE number 1629857 (Why is no real title available?)
| 2001-11-06 | 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 |
Some linear recurrences and their combinatorial interpretation by means of regular languages
Theoretical Computer Science | 2001-08-20 | Paper |
From Motzkin to Catalan permutations
Discrete Mathematics | 2001-08-02 | Paper |
Succession rules and Deco polyominoes
RAIRO - Theoretical Informatics and Applications | 2001-06-13 | Paper |
scientific article; zbMATH DE number 1504628 (Why is no real title available?)
| 2001-01-04 | Paper |
A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)
Discrete Mathematics | 2000-11-02 | 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 |
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 |
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 |
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 |
Some more properties of Catalan numbers
Discrete Mathematics | 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 |
