Elena Barcucci

RAIRO Theor. Informatics Appl., 2024

Dyck Paths Enumerated by the Q-bonacci Numbers.

[BibT_eX]

[DOI]

Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024

2023

A Construction for Variable Dimension Strong Non-Overlapping Matrices.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

2022

Strings from linear recurrences and permutations: A Gray code.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

2021

Exhaustive generation of some lattice paths and their prefixes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A Strong Non-overlapping Dyck Code.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

Strings from Linear Recurrences: A Gray Code.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2018

A 2D non-overlapping code over a q-ary alphabet.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

A Gray code for a regular language.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Exhaustive generation of positive lattice paths.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2017

Cross-bifix-free sets in two dimensions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Non-overlapping matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2017

2016

Cross-bifix-free sets generation via Motzkin paths.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2016

2013

Generalized Schröder permutations.

[BibT_eX]

[DOI]

Vincent Vajnovszki

Theor. Comput. Sci., 2013

Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

2011

BCIF: Another Algorithm for Lossless True Color Image Compression.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Solving the Two Color Problem: An Heuristic Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

2009

PCIF: An Algorithm for Lossless True Color Image Compression.

[BibT_eX]

[DOI]

Srecko Brlek

Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

2005

A Distributive Lattice Structure Connecting Dyck Paths, Noncrossing Partitions and 312-avoiding Permutations.

[BibT_eX]

[DOI]

Order, 2005

An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On directed-convex polyominoes in a rectangle.

[BibT_eX]

[DOI]

Discret. Math., 2005

An algorithm for the reconstruction of discrete sets from two projections in presence of absorption.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Exhaustive generation of combinatorial objects by ECO.

[BibT_eX]

[DOI]

Acta Informatica, 2004

2003

Reconstruction of discrete sets from two absorbed projections: an algorithm.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

2001

Some linear recurrences and their combinatorial interpretation by means of regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Some permutations with forbidden subsequences and their inversion number.

[BibT_eX]

[DOI]

Discret. Math., 2001

Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays.

[BibT_eX]

[DOI]

Discret. Math., 2001

A Bijection for Some Paths on the Slit Plane.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2001

A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2001

2000

Succession rules and deco polyominoes.

[BibT_eX]

[DOI]

Sara Brunetti

Francesco Del Ristoro

RAIRO Theor. Informatics Appl., 2000

Permutations avoiding an increasing number of length-increasing forbidden subsequences.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2000

From Motzkin to Catalan permutations.

[BibT_eX]

[DOI]

Discret. Math., 2000

Reconstruction of Discrete Sets from Three or More X-Rays.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

Random Generation of Trees and Other Combinatorial Objects.

[BibT_eX]

[DOI]

Alberto Del Lungo

Elisa Pergola

Theor. Comput. Sci., 1999

Directed animals, forests and permutations.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Medians of polyominoes: A property for reconstruction.

[BibT_eX]

[DOI]

Int. J. Imaging Syst. Technol., 1998

A methodology for plane tree enumeration.

[BibT_eX]

[DOI]

Discret. Math., 1998

Steep polyominoes, q-Motzkin numbers and q-Bessel functions.

[BibT_eX]

[DOI]

Discret. Math., 1998

A combinatorial interpretation of the recurrence fn+1 = 6fn - fn-1.

[BibT_eX]

[DOI]

Sara Brunetti

Alberto Del Lungo

Francesco Del Ristoro

Discret. Math., 1998

1997

Nondecreasing Dyck paths and q-Fibonacci numbers.

[BibT_eX]

[DOI]

Discret. Math., 1997

Reconstructing Digital Sets from X-Rays.

[BibT_eX]

[DOI]

Proceedings of the Image Analysis and Processing, 9th International Conference, 1997

1996

Polyominoes Defined by Their Vertical and Horizontal Projections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

"Deco" Polyominoes, Permutations and Random Generation.

[BibT_eX]

[DOI]

Alberto Del Lungo

Theor. Comput. Sci., 1996

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Reconstruction convex polyominoes from horizontal and vertical projections II.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 1996

1995

The random generation of underdiagonal walks.

[BibT_eX]

[DOI]

Discret. Math., 1995

A Construction for Enumerating k-coloured Motzkin Paths.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

The Random Generation of Directed Animals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

1993

Directed Column-Convex Polyominoes by Recurrence Relations.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

1992

Some more properties of Catalan numbers.

[BibT_eX]

[DOI]

M. Cecilia Verri

Discret. Math., 1992

1991

A Characterization of Binary Search Networks.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Optimal Selection of Secondary Indexes.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1990

1989

On Some Properties of (a, b)-Trees.

[BibT_eX]

[DOI]

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Index Selection in Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the MFDBS 89, 1989

1984

A Software Development System Based on a Macroprocessor.

[BibT_eX]

[DOI]

Gianluca Pelacani

Softw. Pract. Exp., 1984

Index Selection in a Distributed Data Base.

[BibT_eX]

Elisabetta Grazzini