default search action
Simone Rinaldi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j57]Michela Ascolese
, Andrea Frosini, Elisa Pergola, Simone Rinaldi, Laurent Vuillon:
An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence. Theor. Comput. Sci. 1020: 114872 (2024) - [c23]Michela Ascolese, Andrea Frosini, Simone Rinaldi:
Generation of Skew Convex Polyominoes. ICTCS 2024: 133-145 - [e2]Sara Brunetti
Discrete Geometry and Mathematical Morphology - Third International Joint Conference, DGMM 2024, Florence, Italy, April 15-18, 2024, Proceedings. Lecture Notes in Computer Science 14605, Springer 2024, ISBN 978-3-031-57792-5 [contents] - 2023
- [c22]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: 77-91 - 2022
- [j56]Paolo Dulio, Andrea Frosini, Simone Rinaldi
Further steps on the reconstruction of convex polyominoes from orthogonal projections. J. Comb. Optim. 44(4): 2423-2442 (2022) - [j55]Giulia Palma
On the Reconstruction of 3-Uniform Hypergraphs from Degree Sequences of Span-Two. J. Math. Imaging Vis. 64(7): 693-704 (2022) - [c21]Andrea Frosini, Ilaria Mancini, Simone Rinaldi
Burrows-Wheeler Transform on Purely Morphic Words. DCC 2022: 452 - [c20]Andrea Frosini, Ilaria Mancini, Simone Rinaldi
Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words. DLT 2022: 139-151 - [i6]Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana, Marinella Sciortino:
Logarithmic equal-letter runs for BWT of purely morphic words. CoRR abs/2202.02609 (2022) - 2021
- [j54]Andrea Frosini, Christophe Picouleau, Simone Rinaldi
New sufficient conditions on the degree sequences of uniform hypergraphs. Theor. Comput. Sci. 868: 97-111 (2021) - [j53]Robert Cori, Andrea Frosini, Giulia Palma, Elisa Pergola, Simone Rinaldi
On doubly symmetric Dyck words. Theor. Comput. Sci. 896: 79-97 (2021) - [c19]Andrea Frosini, Giulia Palma, Simone Rinaldi
On the Reconstruction of 3-Uniform Hypergraphs from Step-Two Degree Sequences. DGMM 2021: 338-347 - 2020
- [j52]Adrien Boussicault, Simone Rinaldi
The number of directed k-convex polyominoes. Discret. Math. 343(3): 111731 (2020) - [j51]Paolo Dulio
Ambiguous reconstructions of hv-convex polyominoes. Discret. Math. 343(10): 111998 (2020) - [c18]Andrea Frosini, Giulia Palma, Simone Rinaldi
Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays. CiE 2020: 228-238 - [i5]Chiara Mocenni, Dario Madeo, Andrea Garuglieri, Simone Rinaldi, Giulia Palma:
The Max k-Cut Game: On Stable Optimal Colorings. CoRR abs/2006.05464 (2020)
2010 – 2019
- 2019
- [j50]Nicholas R. Beaton
Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences. Electron. J. Comb. 26(3): 3 (2019) - [j49]Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Recurrence relations, succession rules and the positivity problem. J. Comput. Syst. Sci. 104: 102-118 (2019) - [j48]Nicholas R. Beaton
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. Theor. Comput. Sci. 777: 69-92 (2019) - [c17]Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi:
Burrows-Wheeler Transform of Words Defined by Morphisms. IWOCA 2019: 393-404 - 2018
- [j47]Enrica Duchi, Veronica Guerrini, Simone Rinaldi
A Generating Tree for Permutations Avoiding the Pattern 122+3. Fundam. Informaticae 163(1): 21-39 (2018) - [j46]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): 2795-2819 (2018) - [i4]Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi:
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. CoRR abs/1808.04114 (2018) - 2017
- [j45]Daniela Battaglino, Mathilde Bouvel, Andrea Frosini, Simone Rinaldi
Permutation classes and polyomino classes with excluded submatrices. Math. Struct. Comput. Sci. 27(2): 157-183 (2017) - [c16]Paolo Dulio
First Steps in the Algorithmic Reconstruction of Digital Convex Sets. WORDS 2017: 164-176 - [c15]Elena Barcucci, Paolo Dulio
Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections. DGCI 2017: 147-158 - 2016
- [j44]Andrea Frosini, Simone Rinaldi:
Advances in Discrete Geometry for Computer Imagery: Preface. Theor. Comput. Sci. 624: 1 (2016) - [j43]Andrea Frosini, Veronica Guerrini, Simone Rinaldi
Geometric properties of matrices induced by pattern avoidance. Theor. Comput. Sci. 624: 109-120 (2016) - 2015
- [j42]Andrea Frosini, Daniela Battaglino, Simone Rinaldi
The Identity Transform of a Permutation and its Applications. Fundam. Informaticae 141(2-3): 191-205 (2015) - [c14]Stefano Bilotta
Recurrence Relations, Succession Rules, and the Positivity Problem. LATA 2015: 499-510 - 2014
- [j41]Simone Rinaldi, Samanta Socci:
About Half Permutations. Electron. J. Comb. 21(1): 1 (2014) - [c13]Daniela Battaglino, Andrea Frosini, Veronica Guerrini, Simone Rinaldi
Binary Pictures with Excluded Patterns. DGCI 2014: 25-38 - [e1]Elena Barcucci, Andrea Frosini, Simone Rinaldi:
Discrete Geometry for Computer Imagery - 18th IAPR International Conference, DGCI 2014, Siena, Italy, September 10-12, 2014. Proceedings. Lecture Notes in Computer Science 8668, Springer 2014, ISBN 978-3-319-09954-5 [contents] - 2013
- [j40]Daniela Battaglino, Andrea Frosini, Simone Rinaldi
A decomposition theorem for homogeneous sets with respect to diamond probes. Comput. Vis. Image Underst. 117(4): 319-325 (2013) - [j39]Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
On the shape of permutomino tiles. Discret. Appl. Math. 161(15): 2316-2327 (2013) - [j38]Stefano Bilotta
Polygons Drawn from Permutations. Fundam. Informaticae 125(3-4): 329-342 (2013) - [j37]Filippo Disanto, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
Generation and Enumeration of Some Classes of Interval Orders. Order 30(2): 663-676 (2013) - [j36]Stefano Brocchi, Andrea Frosini, Renzo Pinzani, Simone Rinaldi
A tiling system for the class of L-convex polyominoes. Theor. Comput. Sci. 475: 73-81 (2013) - [j35]Jean-Marc Fedou, Andrea Frosini, Simone Rinaldi:
Enumeration of 4-stack polyominoes. Theor. Comput. Sci. 502: 88-97 (2013) - [j34]Stefano Bilotta
Catalan structures and Catalan pairs. Theor. Comput. Sci. 502: 239-248 (2013) - [c12]Andrea Frosini, Christophe Picouleau, Simone Rinaldi:
On the Degree Sequences of Uniform Hypergraphs. DGCI 2013: 300-310 - [i3]Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Recurrence relations versus succession rules. CoRR abs/1301.2967 (2013) - 2012
- [j33]Sri Gopal Mohanty, Simone Rinaldi, Johann A. Makowsky:
Foreword. Fundam. Informaticae 117(1-4) (2012) - [i2]Filippo Disanto, Luca Ferrari, Simone Rinaldi:
A partial order structure on interval orders. CoRR abs/1203.5948 (2012) - 2011
- [j32]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: 109-128 (2011) - [j31]Filippo Disanto, Enrica Duchi, Simone Rinaldi, Gilles Schaeffer:
Permutations with few internal points. Electron. Notes Discret. Math. 38: 291-296 (2011) - [j30]Stefano Brocchi, Andrea Frosini, Simone Rinaldi:
A reconstruction algorithm for a subclass of instances of the 2-color problem. Theor. Comput. Sci. 412(36): 4795-4804 (2011) - [c11]Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
Tiling the Plane with Permutations. DGCI 2011: 381-393 - [c10]Daniela Battaglino, Jean-Marc Fedou, Andrea Frosini, Simone Rinaldi:
Encoding Centered Polyominoes by Means of a Regular Language. Developments in Language Theory 2011: 464-465 - [c9]Daniela Battaglino, Andrea Frosini, Simone Rinaldi:
Planar Configurations Induced by Exact Polyominoes. IWCIA 2011: 275-283 - 2010
- [j29]Filippo Disanto, Luca Ferrari
Catalan pairs: A relational-theoretic approach to Catalan numbers. Adv. Appl. Math. 45(4): 505-517 (2010) - [i1]Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi:
Catalan structures and Catalan pairs. CoRR abs/1011.3708 (2010)
2000 – 2009
- 2009
- [j28]Filippo Disanto, Simone Rinaldi
Combinatorial properties of Catalan pairs. Electron. Notes Discret. Math. 34: 429-433 (2009) - [j27]F. De Carli, Andrea Frosini, Simone Rinaldi
Lattices of local two-dimensional languages. Theor. Comput. Sci. 410(27-29): 2701-2713 (2009) - [c8]Stefano Brocchi, Andrea Frosini, Simone Rinaldi:
Solving Some Instances of the 2-Color Problem. DGCI 2009: 505-516 - [c7]Stefano Brocchi, Andrea Frosini, Simone Rinaldi:
The 1-Color Problem and the Brylawski Model. DGCI 2009: 530-538 - 2008
- [j26]Enrica Duchi, Simone Rinaldi
The number of Z-convex polyominoes. Adv. Appl. Math. 40(1): 54-72 (2008) - [j25]Andrea Frosini, Maurice Nivat, Simone Rinaldi:
Scanning integer matrices by means of two rectangular windows. Theor. Comput. Sci. 406(1-2): 90-96 (2008) - [c6]Andrea Frosini, Christophe Picouleau, Simone Rinaldi
Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem. DGCI 2008: 392-400 - [c5]Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé
Reconstructing words from a fixed palindromic length sequence. IFIP TCS 2008: 101-114 - 2007
- [j24]Filippo Disanto, Andrea Frosini, Renzo Pinzani, Simone Rinaldi:
A Closed Formula for the Number of Convex Permutominoes. Electron. J. Comb. 14(1) (2007) - [j23]Giusi Castiglione
Combinatorial aspects of L-convex polyominoes. Eur. J. Comb. 28(6): 1724-1741 (2007) - 2006
- [j22]Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
Tilings by Translation: Enumeration by a Rational Language Approach. Electron. J. Comb. 13(1) (2006) - 2005
- [j21]Emeric Deutsch
Production matrices. Adv. Appl. Math. 34(1): 101-122 (2005) - [j20]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): 21-35 (2005) - [j19]Elena Barcucci, Andrea Frosini, Simone Rinaldi
On directed-convex polyominoes in a rectangle. Discret. Math. 298(1-3): 62-78 (2005) - [j18]Srecko Brlek, Enrica Duchi, Elisa Pergola, Simone Rinaldi
On the equivalence problem for succession rules. Discret. Math. 298(1-3): 142-154 (2005) - [j17]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: 347-363 (2005) - [j16]Elisa Pergola, Simone Rinaldi:
Preface. Theor. Comput. Sci. 346(2-3): 183 (2005) - [j15]Elisa Pergola, Simone Rinaldi:
In memoriam: Alberto Del Lungo (1965-2003). Theor. Comput. Sci. 346(2-3): 184-188 (2005) - [j14]Giusi Castiglione
Enumeration of L-convex polyominoes by rows and columns. Theor. Comput. Sci. 347(1-2): 336-352 (2005) - [c4]Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi:
A Tomographical Characterization of L-Convex Polyominoes. DGCI 2005: 115-125 - 2004
- [j13]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) - [j12]Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi
A bijection for the total area of parallelogram polyominoes. Discret. Appl. Math. 144(3): 291-302 (2004) - [j11]Enrica Duchi, Jean-Marc Fedou, Simone Rinaldi:
From object grammars to ECO systems. Theor. Comput. Sci. 314(1-2): 57-95 (2004) - 2003
- [j10]Elisa Pergola, Renzo Pinzani, Simone Rinaldi, Robert A. Sulanke:
Lattice path moments by cut and paste. Adv. Appl. Math. 30(1-2): 208-218 (2003) - [j9]Luca Ferrari
Jumping succession rules and their generating functions. Discret. Math. 271(1-3): 29-50 (2003) - [j8]Elena Barcucci, Andrea Frosini, Simone Rinaldi:
Reconstruction of discrete sets from two absorbed projections: an algorithm. Electron. Notes Discret. Math. 12: 118-129 (2003) - [j7]Luca Ferrari
Some bijective results about the area of Schröder paths. Theor. Comput. Sci. 307(2): 327-335 (2003) - [c3]Alberto Del Lungo, Enrica Duchi, Andrea Frosini, Simone Rinaldi:
Enumeration of convex polyominoes using the ECO method. DMCS 2003: 103-116 - [c2]Alberto Del Lungo, Andrea Frosini, Simone Rinaldi:
ECO Method and the Exhaustive Generation of Convex Polyominoes. DMTCS 2003: 129-140 - 2002
- [j6]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): 580-591 (2002) - [j5]Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Approximating algebraic functions by means of rational ones. Theor. Comput. Sci. 270(1-2): 643-657 (2002) - [j4]Luca Ferrari
An algebraic characterization of the set of succession rules. Theor. Comput. Sci. 281(1-2): 351-367 (2002) - 2001
- [j3]Elena Barcucci, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
A Bijection for Some Paths on the Slit Plane. Adv. Appl. Math. 26(2): 89-96 (2001) - [j2]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): 129-153 (2001) - [j1]Elena Barcucci, Simone Rinaldi:
Some linear recurrences and their combinatorial interpretation by means of regular languages. Theor. Comput. Sci. 255(1-2): 679-686 (2001) - [c1]Alberto Del Lungo, Massimo Mirolli, Renzo Pinzani, Simone Rinaldi:
A Bijection for Directed-Convex Polyominoes. DM-CCG 2001: 133-144
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: