Simone Rinaldi

Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

2023

A Heuristic for the P-time Reconstruction of Unique 3-Uniform Hypergraphs from their Degree Sequences.

[BibT_eX]

[DOI]

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022

On the Reconstruction of 3-Uniform Hypergraphs from Degree Sequences of Span-Two.

[BibT_eX]

[DOI]

Giulia Palma

J. Math. Imaging Vis., 2022

Further steps on the reconstruction of convex polyominoes from orthogonal projections.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

Burrows-Wheeler Transform on Purely Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2022

2021

New sufficient conditions on the degree sequences of uniform hypergraphs.

[BibT_eX]

[DOI]

Christophe Picouleau

Theor. Comput. Sci., 2021

On doubly symmetric Dyck words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the Reconstruction of 3-Uniform Hypergraphs from Step-Two Degree Sequences.

[BibT_eX]

[DOI]

Giulia Palma

Proceedings of the Discrete Geometry and Mathematical Morphology, 2021

2020

Ambiguous reconstructions of hv-convex polyominoes.

[BibT_eX]

[DOI]

Discret. Math., 2020

The number of directed k-convex polyominoes.

[BibT_eX]

[DOI]

Adrien Boussicault

Samanta Socci

Discret. Math., 2020

The Max k-Cut Game: On Stable Optimal Colorings.

[BibT_eX]

[DOI]

CoRR, 2020

Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays.

[BibT_eX]

[DOI]

Giulia Palma

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Recurrence relations, succession rules and the positivity problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Burrows-Wheeler Transform of Words Defined by Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

A Generating Tree for Permutations Avoiding the Pattern 122<sup>+</sup>3.

[BibT_eX]

[DOI]

Enrica Duchi

Veronica Guerrini

Fundam. Informaticae, 2018

2017

Permutation classes and polyomino classes with excluded submatrices.

[BibT_eX]

[DOI]

Math. Struct. 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

First Steps in the Algorithmic Reconstruction of Digital Convex Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Advances in Discrete Geometry for Computer Imagery: Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Geometric properties of matrices induced by pattern avoidance.

[BibT_eX]

[DOI]

Veronica Guerrini

Theor. Comput. Sci., 2016

2015

The Identity Transform of a Permutation and its Applications.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

2014

About Half Permutations.

[BibT_eX]

[DOI]

Samanta Socci

Electron. J. Comb., 2014

Binary Pictures with Excluded Patterns.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2014

2013

Enumeration of 4-stack polyominoes.

[BibT_eX]

[DOI]

Jean-Marc Fedou

Theor. Comput. Sci., 2013

A tiling system for the class of <i>L</i>-convex polyominoes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Catalan structures and Catalan pairs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Generation and Enumeration of Some Classes of Interval Orders.

[BibT_eX]

[DOI]

Order, 2013

Polygons Drawn from Permutations.

[BibT_eX]

[DOI]

Stefano Bilotta

Samanta Socci

Fundam. Informaticae, 2013

On the shape of permutomino tiles.

[BibT_eX]

[DOI]

Alexandre Blondin Massé

Laurent Vuillon

Discret. Appl. Math., 2013

A decomposition theorem for homogeneous sets with respect to diamond probes.

[BibT_eX]

[DOI]

Daniela Battaglino

Comput. Vis. Image Underst., 2013

Recurrence relations versus succession rules

[BibT_eX]

[DOI]

CoRR, 2013

On the Degree Sequences of Uniform Hypergraphs.

[BibT_eX]

[DOI]

Christophe Picouleau

Proceedings of the Discrete Geometry for Computer Imagery, 2013

2012

Foreword.

[BibT_eX]

[DOI]

Sri Gopal Mohanty

Johann A. Makowsky

Fundam. Informaticae, 2012

A partial order structure on interval orders

[BibT_eX]

[DOI]

Filippo Disanto

Luca Ferrari

CoRR, 2012

2011

A reconstruction algorithm for a subclass of instances of the 2-color problem.

[BibT_eX]

[DOI]

Stefano Brocchi

Theor. Comput. Sci., 2011

Permutations with few internal points.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method.

[BibT_eX]

Ars Comb., 2011

Planar Configurations Induced by Exact Polyominoes.

[BibT_eX]

[DOI]

Daniela Battaglino

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

Encoding Centered Polyominoes by Means of a Regular Language.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Tiling the Plane with Permutations.

[BibT_eX]

[DOI]

Alexandre Blondin Massé

Laurent Vuillon

Proceedings of the Discrete Geometry for Computer Imagery, 2011

2010

Catalan pairs: A relational-theoretic approach to Catalan numbers.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2010

2009

Lattices of local two-dimensional languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Combinatorial properties of Catalan pairs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

The 1-Color Problem and the Brylawski Model.

[BibT_eX]

[DOI]

Stefano Brocchi

Proceedings of the Discrete Geometry for Computer Imagery, 2009

Solving Some Instances of the 2-Color Problem.

[BibT_eX]

[DOI]

Stefano Brocchi

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Scanning integer matrices by means of two rectangular windows.

[BibT_eX]

[DOI]

Maurice Nivat

Theor. Comput. Sci., 2008

The number of Z-convex polyominoes.

[BibT_eX]

[DOI]

Enrica Duchi

Gilles Schaeffer

Adv. Appl. Math., 2008

Reconstructing words from a fixed palindromic length sequence.

[BibT_eX]

[DOI]

Alexandre Blondin Massé

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem.

[BibT_eX]

[DOI]

Christophe Picouleau

Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007

Combinatorial aspects of L-convex polyominoes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

A Closed Formula for the Number of Convex Permutominoes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

2006

Tilings by Translation: Enumeration by a Rational Language Approach.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

In memoriam: Alberto Del Lungo (1965-2003).

[BibT_eX]

[DOI]

Elisa Pergola

Theor. Comput. Sci., 2005

Preface.

[BibT_eX]

[DOI]

Elisa Pergola

Theor. Comput. Sci., 2005

Enumeration of L-convex polyominoes by rows and columns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On the equivalence problem for succession rules.

[BibT_eX]

[DOI]

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

Production matrices.

[BibT_eX]

[DOI]

Emeric Deutsch

Luca Ferrari

Adv. Appl. Math., 2005

A Tomographical Characterization of L-Convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004

From object grammars to ECO systems.

[BibT_eX]

[DOI]

Enrica Duchi

Jean-Marc Fedou

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

2003

Some bijective results about the area of Schröder paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Jumping succession rules and their generating functions.

[BibT_eX]

[DOI]

Discret. Math., 2003

Lattice path moments by cut and paste.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2003

ECO Method and the Exhaustive Generation of Convex Polyominoes.

[BibT_eX]

[DOI]

Alberto Del Lungo

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

Approximating algebraic functions by means of rational ones.

[BibT_eX]

[DOI]

Elisa Pergola

Renzo Pinzani

Theor. Comput. Sci., 2002

An algebraic characterization of the set of succession rules.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

A Bijective Approach to the Area of Generalized Motzkin Paths.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

2001

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

[BibT_eX]

[DOI]