Simone Rinaldi

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 25

Top Topics

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Publications

Michela Ascolese, Andrea Frosini, Elisa Pergola, Simone Rinaldi
A Heuristic for the P-time Reconstruction of Unique 3-Uniform Hypergraphs from their Degree Sequences. ICTCS (2023)
Giulia Palma, Andrea Frosini, Simone Rinaldi
On the Reconstruction of 3-Uniform Hypergraphs from Degree Sequences of Span-Two. J. Math. Imaging Vis. 64 (7) (2022)
Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana, Marinella Sciortino
Logarithmic equal-letter runs for BWT of purely morphic words. CoRR (2022)
Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana, Marinella Sciortino
Burrows-Wheeler Transform on Purely Morphic Words. DCC (2022)
Paolo Dulio, Andrea Frosini, Simone Rinaldi, Lama Tarsissi, Laurent Vuillon
Further steps on the reconstruction of convex polyominoes from orthogonal projections. J. Comb. Optim. 44 (4) (2022)
Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana, Marinella Sciortino
Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words. DLT (2022)
Robert Cori, Andrea Frosini, Giulia Palma, Elisa Pergola, Simone Rinaldi
On doubly symmetric Dyck words. Theor. Comput. Sci. 896 (2021)
Andrea Frosini, Giulia Palma, Simone Rinaldi
On the Reconstruction of 3-Uniform Hypergraphs from Step-Two Degree Sequences. DGMM (2021)
Andrea Frosini, Christophe Picouleau, Simone Rinaldi
New sufficient conditions on the degree sequences of uniform hypergraphs. Theor. Comput. Sci. 868 (2021)
Andrea Frosini, Giulia Palma, Simone Rinaldi
Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays. CiE (2020)
Chiara Mocenni, Dario Madeo, Andrea Garuglieri, Simone Rinaldi, Giulia Palma
The Max k-Cut Game: On Stable Optimal Colorings. CoRR (2020)
Paolo Dulio, Andrea Frosini, Silvia M. C. Pagani, Simone Rinaldi
Ambiguous reconstructions of hv-convex polyominoes. Discret. Math. 343 (10) (2020)
Adrien Boussicault, Simone Rinaldi, Samanta Socci
The number of directed k-convex polyominoes. Discret. Math. 343 (3) (2020)
Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi
Burrows-Wheeler Transform of Words Defined by Morphisms. IWOCA (2019)
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences. Electron. J. Comb. 26 (3) (2019)
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. Theor. Comput. Sci. 777 (2019)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence relations, succession rules and the positivity problem. J. Comput. Syst. Sci. 104 (2019)
Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer, Simone Rinaldi
Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence. SIAM J. Discret. Math. 32 (4) (2018)
Enrica Duchi, Veronica Guerrini, Simone Rinaldi
3. Fundam. Informaticae 163 (1) (2018)
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. CoRR (2018)
Daniela Battaglino, Mathilde Bouvel, Andrea Frosini, Simone Rinaldi
Permutation classes and polyomino classes with excluded submatrices. Math. Struct. Comput. Sci. 27 (2) (2017)
Paolo Dulio, Andrea Frosini, Simone Rinaldi, Lama Tarsissi, Laurent Vuillon
First Steps in the Algorithmic Reconstruction of Digital Convex Sets. WORDS (2017)
Elena Barcucci, Paolo Dulio, Andrea Frosini, Simone Rinaldi
Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections. DGCI (2017)
Andrea Frosini, Veronica Guerrini, Simone Rinaldi
Geometric properties of matrices induced by pattern avoidance. Theor. Comput. Sci. 624 (2016)
Andrea Frosini, Simone Rinaldi
Advances in Discrete Geometry for Computer Imagery: Preface. Theor. Comput. Sci. 624 (2016)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence Relations, Succession Rules, and the Positivity Problem. LATA (2015)
Andrea Frosini, Daniela Battaglino, Simone Rinaldi, Samanta Socci
The Identity Transform of a Permutation and its Applications. Fundam. Informaticae 141 (2-3) (2015)
Simone Rinaldi, Samanta Socci
About Half Permutations. Electron. J. Comb. 21 (1) (2014)
Daniela Battaglino, Andrea Frosini, Veronica Guerrini, Simone Rinaldi, Samanta Socci
Binary Pictures with Excluded Patterns. DGCI (2014)
Filippo Disanto, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Generation and Enumeration of Some Classes of Interval Orders. Order 30 (2) (2013)
Daniela Battaglino, Andrea Frosini, Simone Rinaldi
A decomposition theorem for homogeneous sets with respect to diamond probes. Comput. Vis. Image Underst. 117 (4) (2013)
Jean-Marc Fedou, Andrea Frosini, Simone Rinaldi
Enumeration of 4-stack polyominoes. Theor. Comput. Sci. 502 (2013)
Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi
Catalan structures and Catalan pairs. Theor. Comput. Sci. 502 (2013)
Stefano Brocchi, Andrea Frosini, Renzo Pinzani, Simone Rinaldi
-convex polyominoes. Theor. Comput. Sci. 475 (2013)
Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence relations versus succession rules CoRR (2013)
Stefano Bilotta, Simone Rinaldi, Samanta Socci
Polygons Drawn from Permutations. Fundam. Informaticae 125 (3-4) (2013)
Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon
On the shape of permutomino tiles. Discret. Appl. Math. 161 (15) (2013)
Andrea Frosini, Christophe Picouleau, Simone Rinaldi
On the Degree Sequences of Uniform Hypergraphs. DGCI (2013)
Filippo Disanto, Luca Ferrari, Simone Rinaldi
A partial order structure on interval orders CoRR (2012)
Sri Gopal Mohanty, Simone Rinaldi, Johann A. Makowsky
Foreword. Fundam. Informaticae 117 (1-4) (2012)
Filippo Disanto, Enrica Duchi, Simone Rinaldi, Gilles Schaeffer
Permutations with few internal points. Electron. Notes Discret. Math. 38 (2011)
Daniela Battaglino, Jean-Marc Fedou, Andrea Frosini, Simone Rinaldi
Encoding Centered Polyominoes by Means of a Regular Language. Developments in Language Theory (2011)
Stefano Brocchi, Andrea Frosini, Simone Rinaldi
A reconstruction algorithm for a subclass of instances of the 2-color problem. Theor. Comput. Sci. 412 (36) (2011)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method. Ars Comb. 99 (2011)
Daniela Battaglino, Andrea Frosini, Simone Rinaldi
Planar Configurations Induced by Exact Polyominoes. IWCIA (2011)
Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon
Tiling the Plane with Permutations. DGCI (2011)
Filippo Disanto, Luca Ferrari, Renzo Pinzani, Simone Rinaldi
Catalan pairs: A relational-theoretic approach to Catalan numbers. Adv. Appl. Math. 45 (4) (2010)
Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi
Catalan structures and Catalan pairs CoRR (2010)
Stefano Brocchi, Andrea Frosini, Simone Rinaldi
Solving Some Instances of the 2-Color Problem. DGCI (2009)
Stefano Brocchi, Andrea Frosini, Simone Rinaldi
The 1-Color Problem and the Brylawski Model. DGCI (2009)
F. De Carli, Andrea Frosini, Simone Rinaldi, Andrea Sorbi
Lattices of local two-dimensional languages. Theor. Comput. Sci. 410 (27-29) (2009)
Filippo Disanto, Simone Rinaldi, Luca Ferrari, Renzo Pinzani
Combinatorial properties of Catalan pairs. Electron. Notes Discret. Math. 34 (2009)
Andrea Frosini, Maurice Nivat, Simone Rinaldi
Scanning integer matrices by means of two rectangular windows. Theor. Comput. Sci. 406 (1-2) (2008)
Enrica Duchi, Simone Rinaldi, Gilles Schaeffer
The number of Z-convex polyominoes. Adv. Appl. Math. 40 (1) (2008)
Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi
Reconstructing words from a fixed palindromic length sequence. IFIP TCS (2008)
Andrea Frosini, Christophe Picouleau, Simone Rinaldi
Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem. DGCI (2008)
Filippo Disanto, Andrea Frosini, Renzo Pinzani, Simone Rinaldi
A Closed Formula for the Number of Convex Permutominoes. Electron. J. Comb. 14 (1) (2007)
Giusi Castiglione, Andrea Frosini, Emanuele Munarini, Antonio Restivo, Simone Rinaldi
Combinatorial aspects of L-convex polyominoes. Eur. J. Comb. 28 (6) (2007)
Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon
Tilings by Translation: Enumeration by a Rational Language Approach. Electron. J. Comb. 13 (1) (2006)
Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi
On the equivalence problem for succession rules. Discret. Math. 298 (1-3) (2005)
Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi
Enumeration of L-convex polyominoes by rows and columns. Theor. Comput. Sci. 347 (1-2) (2005)
Elena Barcucci, Andrea Frosini, Simone Rinaldi
On directed-convex polyominoes in a rectangle. Discret. Math. 298 (1-3) (2005)
Emeric Deutsch, Luca Ferrari, Simone Rinaldi
Production matrices. Adv. Appl. Math. 34 (1) (2005)
Elisa Pergola, Simone Rinaldi
Preface. Theor. Comput. Sci. 346 (2-3) (2005)
Elena Barcucci, Andrea Frosini, Simone Rinaldi
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption. Discret. Appl. Math. 151 (1-3) (2005)
Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi
A Tomographical Characterization of L-Convex Polyominoes. DGCI (2005)
Andrea Frosini, Simone Rinaldi, Elena Barcucci, Attila Kuba
An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections. Electron. Notes Discret. Math. 20 (2005)
Elisa Pergola, Simone Rinaldi
In memoriam: Alberto Del Lungo (1965-2003). Theor. Comput. Sci. 346 (2-3) (2005)
Alberto Del Lungo, Enrica Duchi, Andrea Frosini, Simone Rinaldi
On the Generation and Enumeration of some Classes of Convex Polyominoes. Electron. J. Comb. 11 (1) (2004)
Enrica Duchi, Jean-Marc Fedou, Simone Rinaldi
From object grammars to ECO systems. Theor. Comput. Sci. 314 (1-2) (2004)
Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi
A bijection for the total area of parallelogram polyominoes. Discret. Appl. Math. 144 (3) (2004)
Alberto Del Lungo, Andrea Frosini, Simone Rinaldi
ECO Method and the Exhaustive Generation of Convex Polyominoes. DMTCS (2003)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Jumping succession rules and their generating functions. Discret. Math. 271 (1-3) (2003)
Elena Barcucci, Andrea Frosini, Simone Rinaldi
Reconstruction of discrete sets from two absorbed projections: an algorithm. Electron. Notes Discret. Math. 12 (2003)
Alberto Del Lungo, Enrica Duchi, Andrea Frosini, Simone Rinaldi
Enumeration of convex polyominoes using the ECO method. DMCS (2003)
Luca Ferrari, Elisabetta Grazzini, Elisa Pergola, Simone Rinaldi
Some bijective results about the area of Schröder paths. Theor. Comput. Sci. 307 (2) (2003)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke
Lattice path moments by cut and paste. Adv. Appl. Math. 30 (1-2) (2003)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke
A Bijective Approach to the Area of Generalized Motzkin Paths. Adv. Appl. Math. 28 (3-4) (2002)
Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
An algebraic characterization of the set of succession rules. Theor. Comput. Sci. 281 (1-2) (2002)
Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Approximating algebraic functions by means of rational ones. Theor. Comput. Sci. 270 (1-2) (2002)
Elena Barcucci, Alberto Del Lungo, Andrea Frosini, Simone Rinaldi
A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function. Adv. Appl. Math. 26 (2) (2001)
Elena Barcucci, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
A Bijection for Some Paths on the Slit Plane. Adv. Appl. Math. 26 (2) (2001)
Alberto Del Lungo, Massimo Mirolli, Renzo Pinzani, Simone Rinaldi
A Bijection for Directed-Convex Polyominoes. DM-CCG (2001)
Elena Barcucci, Simone Rinaldi
Some linear recurrences and their combinatorial interpretation by means of regular languages. Theor. Comput. Sci. 255 (1-2) (2001)