Alberto Del Lungo

Claudio Marini

Elisa Mori

Discret. Math., 2009

2008

On the reconstruction of binary and permutation matrices under (binary) tomographic constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2005

The Guessing Secrets problem: a probabilistic approach.

[BibT_eX]

[DOI]

J. Algorithms, 2005

2004

A bijection for the total area of parallelogram polyominoes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

On the Generation and Enumeration of some Classes of Convex Polyominoes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

On the polynomial 1[n]qnkq.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2003

Text sparsification via local maxima.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

9th International Workshop on Combinatorial Image Analysis: Volume 12 Palermo (Italy), May 14-16, 2003.

[BibT_eX]

[DOI]

Vito Di Gesù

Attila Kuba

Electron. Notes Discret. Math., 2003

ECO Method and the Exhaustive Generation of Convex Polyominoes.

[BibT_eX]

[DOI]

Andrea Frosini

Simone Rinaldi

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Enumeration of convex polyominoes using the ECO method.

[BibT_eX]

[DOI]

Proceedings of the Discrete Models for Complex Systems, 2003

2002

Reconstructing permutation matrices from diagonal sums.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

A cycle lemma for permutation inversions.

[BibT_eX]

[DOI]

Discret. Math., 2002

Discrete Tomography: Reconstruction under Periodicity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Reconstruction of Binary Matrices from Absorbed Projections.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 10th International Conference, 2002

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

An Equipartition Property for the Distribution of Multiset Permutation Inversions.

[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

A Bijection for Directed-Convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000

Left ternary trees and non-separable rooted planar maps.

[BibT_eX]

[DOI]

Jean-Guy Penaud

Theor. Comput. Sci., 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

Medians of Discrete Sets according to a Linear Distance.

[BibT_eX]

[DOI]

Alain Daurat

Maurice Nivat

Discret. Comput. Geom., 2000

An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays.

[BibT_eX]

[DOI]

Alain Daurat

Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 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]

Elena Barcucci

Elisa Pergola

Theor. Comput. Sci., 1999

Directed animals, forests and permutations.

[BibT_eX]

[DOI]

Discret. Math., 1999

A Fast H.261 Software Codec for High Quality Videoconferencing on PCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

1998

The Medians of Discrete Sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 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]

Elena Barcucci

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]

Elena Barcucci

Renzo Pinzani

Theor. Comput. Sci., 1996

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

The number of convex polyominoes reconstructible from their orthogonal projections.

[BibT_eX]

[DOI]

Maurice Nivat

Renzo Pinzani

Discret. Math., 1996

Reconstruction convex polyominoes from horizontal and vertical projections II.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 1996

1995

A Construction for Enumerating k-coloured Motzkin Paths.

[BibT_eX]

[DOI]

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

1994

Polyominoes Defined by Two Vectors.

[BibT_eX]

[DOI]