Elena Barcucci

According to our database1, Elena Barcucci
  • authored at least 48 papers between 1984 and 2018.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 


On csauthors.net:


A 2D non-overlapping code over a q-ary alphabet.
Cryptography and Communications, 2018

Cross-bifix-free sets in two dimensions.
Theor. Comput. Sci., 2017

Non-overlapping matrices.
Theor. Comput. Sci., 2017

Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections.
Proceedings of the Discrete Geometry for Computer Imagery, 2017

Cross-bifix-free sets generation via Motzkin paths.
RAIRO - Theor. Inf. and Applic., 2016

Non-overlapping matrices.
CoRR, 2016

Cross-bifix-free sets in two dimensions.
CoRR, 2015

Generalized Schröder permutations.
Theor. Comput. Sci., 2013

Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge.
Fundam. Inform., 2013

BCIF: Another Algorithm for Lossless True Color Image Compression.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Solving the Two Color Problem: An Heuristic Algorithm.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

PCIF: An Algorithm for Lossless True Color Image Compression.
Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

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

An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections.
Electronic Notes in Discrete Mathematics, 2005

On directed-convex polyominoes in a rectangle.
Discrete Mathematics, 2005

An algorithm for the reconstruction of discrete sets from two projections in presence of absorption.
Discrete Applied Mathematics, 2005

Exhaustive generation of combinatorial objects by ECO.
Acta Inf., 2004

Reconstruction of discrete sets from two absorbed projections: an algorithm.
Electronic Notes in Discrete Mathematics, 2003

Some linear recurrences and their combinatorial interpretation by means of regular languages.
Theor. Comput. Sci., 2001

Some permutations with forbidden subsequences and their inversion number.
Discrete Mathematics, 2001

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

Succession rules and deco polyominoes.
ITA, 2000

Permutations avoiding an increasing number of length-increasing forbidden subsequences.
Discrete Mathematics & Theoretical Computer Science, 2000

From Motzkin to Catalan permutations.
Discrete Mathematics, 2000

Reconstruction of Discrete Sets from Three or More X-Rays.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

Random Generation of Trees and Other Combinatorial Objects.
Theor. Comput. Sci., 1999

Directed animals, forests and permutations.
Discrete Mathematics, 1999

Medians of polyominoes: A property for reconstruction.
Int. J. Imaging Systems and Technology, 1998

A methodology for plane tree enumeration.
Discrete Mathematics, 1998

Steep polyominoes, q-Motzkin numbers and q-Bessel functions.
Discrete Mathematics, 1998

A combinatorial interpretation of the recurrence fn+1 = 6fn - fn-1.
Discrete Mathematics, 1998

Nondecreasing Dyck paths and q-Fibonacci numbers.
Discrete Mathematics, 1997

Reconstructing Digital Sets from X-Rays.
Proceedings of the Image Analysis and Processing, 9th International Conference, 1997

Polyominoes Defined by Their Vertical and Horizontal Projections.
Theor. Comput. Sci., 1996

"Deco" Polyominoes, Permutations and Random Generation.
Theor. Comput. Sci., 1996

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections.
Theor. Comput. Sci., 1996

Reconstruction convex polyominoes from horizontal and vertical projections II.
Proceedings of the Discrete Geometry for Computer Imagery, 1996

The random generation of underdiagonal walks.
Discrete Mathematics, 1995

A Construction for Enumerating k-coloured Motzkin Paths.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

The Random Generation of Directed Animals.
Theor. Comput. Sci., 1994

Directed Column-Convex Polyominoes by Recurrence Relations.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Some more properties of Catalan numbers.
Discrete Mathematics, 1992

A Characterization of Binary Search Networks.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Optimal Selection of Secondary Indexes.
IEEE Trans. Software Eng., 1990

On Some Properties of (a, b)-Trees.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Index Selection in Relational Databases.
Proceedings of the MFDBS 89, 1989

A Software Development System Based on a Macroprocessor.
Softw., Pract. Exper., 1984

Index Selection in a Distributed Data Base.
DDSS, 1984