Name
Affiliation
Papers
SIMONE RINALDI
Univ Sienna, Dipartimento Ingn Informaz & Sci Matemath, Siena, SI, Italy
50
Collaborators
Citations 
PageRank 
43
174
24.93
Referers 
Referees 
References 
153
230
284
Search Limit
100230
Title
Citations
PageRank
Year
New Sufficient Conditions On The Degree Sequences Of Uniform Hypergraphs00.342021
Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences.00.342019
A Generating Tree for Permutations Avoiding the Pattern 122+3.00.342018
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers.00.342018
Permutation classes and polyomino classes with excluded submatrices.20.402017
Geometric properties of matrices induced by pattern avoidance00.342016
The Identity Transform of a Permutation and its Applications.00.342015
About Half Permutations.10.362014
Binary Pictures With Excluded Patterns10.362014
Polygons Drawn from Permutations00.342013
A tiling system for the class of L-convex polyominoes00.342013
Enumeration of 4-stack polyominoes00.342013
Generation and Enumeration of Some Classes of Interval Orders.10.352013
On the shape of permutomino tiles10.372013
A decomposition theorem for homogeneous sets with respect to diamond probes00.342013
A reconstruction algorithm for a subclass of instances of the 2-color problem40.442011
Tiling the plane with permutations10.372011
Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method.10.382011
Planar configurations induced by exact polyominoes00.342011
Catalan structures and Catalan pairs10.352010
Catalan pairs: A relational-theoretic approach to Catalan numbers30.452010
Combinatorial properties of Catalan pairs10.352009
Lattices of local two-dimensional languages00.342009
Solving some instances of the 2-color problem30.412009
The 1-color problem and the Brylawski model20.412009
Reconstructing words from a fixed palindromic length sequence50.482008
The number of Z-convex polyominoes120.902008
Scanning integer matrices by means of two rectangular windows20.492008
A Closed Formula for the Number of Convex Permutominoes60.912007
Combinatorial aspects of L-convex polyominoes120.822007
Tilings by Translation: Enumeration by a Rational Language Approach50.562006
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption30.462005
Enumeration of L-convex polyominoes by rows and columns131.052005
An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections10.372005
In memoriam: Alberto Del Lungo (1965–2003)00.342005
On the equivalence problem for succession rules30.412005
On directed-convex polyominoes in a rectangle110.802005
A tomographical characterization of l-convex polyominoes150.992005
From object grammars to ECO systems40.512004
A bijection for the total area of parallelogram polyominoes10.372004
On the Generation and Enumeration of some Classes of Convex Polyominoes141.012004
Lattice path moments by cut and paste10.432003
Jumping succession rules and their generating functions70.562003
Reconstruction of discrete sets from two absorbed projections: an algorithm20.642003
ECO method and the exhaustive generation of convex polyominoes40.492003
Some bijective results about the ares of Schröder paths00.342003
Approximating algebraic functions by means of rational ones40.542002
An algebraic characterization of the set of succession rules151.072002
Some linear recurrences and their combinatorial interpretation by means of regular languages20.532001
A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function100.812001