Simone Rinaldi

According to our database1, Simone Rinaldi authored at least 59 papers between 2001 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 




A Generating Tree for Permutations Avoiding the Pattern 122+3.
Fundam. Inform., 2018

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

Permutation classes and polyomino classes with excluded submatrices.
Mathematical Structures in Computer Science, 2017

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

First Steps in the Algorithmic Reconstruction of Digital Convex Sets.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

Advances in Discrete Geometry for Computer Imagery: Preface.
Theor. Comput. Sci., 2016

Geometric properties of matrices induced by pattern avoidance.
Theor. Comput. Sci., 2016

The Identity Transform of a Permutation and its Applications.
Fundam. Inform., 2015

Recurrence Relations, Succession Rules, and the Positivity Problem.
Proceedings of the Language and Automata Theory and Applications, 2015

About Half Permutations.
Electr. J. Comb., 2014

Binary Pictures with Excluded Patterns.
Proceedings of the Discrete Geometry for Computer Imagery, 2014

Enumeration of 4-stack polyominoes.
Theor. Comput. Sci., 2013

A tiling system for the class of L-convex polyominoes.
Theor. Comput. Sci., 2013

Catalan structures and Catalan pairs.
Theor. Comput. Sci., 2013

Generation and Enumeration of Some Classes of Interval Orders.
Order, 2013

Polygons Drawn from Permutations.
Fundam. Inform., 2013

On the shape of permutomino tiles.
Discrete Applied Mathematics, 2013

A decomposition theorem for homogeneous sets with respect to diamond probes.
Computer Vision and Image Understanding, 2013

Recurrence relations versus succession rules
CoRR, 2013

On the Degree Sequences of Uniform Hypergraphs.
Proceedings of the Discrete Geometry for Computer Imagery, 2013

Fundam. Inform., 2012

A partial order structure on interval orders
CoRR, 2012

A reconstruction algorithm for a subclass of instances of the 2-color problem.
Theor. Comput. Sci., 2011

Permutations with few internal points.
Electronic Notes in Discrete Mathematics, 2011

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

Planar Configurations Induced by Exact Polyominoes.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Encoding Centered Polyominoes by Means of a Regular Language.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Tiling the Plane with Permutations.
Proceedings of the Discrete Geometry for Computer Imagery, 2011

Catalan structures and Catalan pairs
CoRR, 2010

Lattices of local two-dimensional languages.
Theor. Comput. Sci., 2009

Combinatorial properties of Catalan pairs.
Electronic Notes in Discrete Mathematics, 2009

The 1-Color Problem and the Brylawski Model.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

Solving Some Instances of the 2-Color Problem.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

Scanning integer matrices by means of two rectangular windows.
Theor. Comput. Sci., 2008

Reconstructing words from a fixed palindromic length sequence.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem.
Proceedings of the Discrete Geometry for Computer Imagery, 2008

Combinatorial aspects of L-convex polyominoes.
Eur. J. Comb., 2007

A Closed Formula for the Number of Convex Permutominoes.
Electr. J. Comb., 2007

Tilings by Translation: Enumeration by a Rational Language Approach.
Electr. J. Comb., 2006

In memoriam: Alberto Del Lungo (1965-2003).
Theor. Comput. Sci., 2005

Theor. Comput. Sci., 2005

Enumeration of L-convex polyominoes by rows and columns.
Theor. Comput. Sci., 2005

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

On the equivalence problem for succession rules.
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

A Tomographical Characterization of L-Convex Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

From object grammars to ECO systems.
Theor. Comput. Sci., 2004

A bijection for the total area of parallelogram polyominoes.
Discrete Applied Mathematics, 2004

On the Generation and Enumeration of some Classes of Convex Polyominoes.
Electr. J. Comb., 2004

Some bijective results about the area of Schröder paths.
Theor. Comput. Sci., 2003

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

Jumping succession rules and their generating functions.
Discrete Mathematics, 2003

ECO Method and the Exhaustive Generation of Convex Polyominoes.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Enumeration of convex polyominoes using the ECO method.
Proceedings of the Discrete Models for Complex Systems, 2003

Approximating algebraic functions by means of rational ones.
Theor. Comput. Sci., 2002

An algebraic characterization of the set of succession rules.
Theor. Comput. Sci., 2002

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

A Bijection for Directed-Convex Polyominoes.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001