default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarilena Barnabei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo
, Matteo Silimbani:
Maxima and visibility in involutions. Adv. Appl. Math. 149: 102552 (2023)- 2020
- [j17]Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, Matteo Silimbani:
Permutations Avoiding a Simsun Pattern. Electron. J. Comb. 27(3): 3 (2020)
2010 – 2019
- 2019
- [j16]Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, Matteo Silimbani:
Ascending runs in permutations and valued Dyck paths. Ars Math. Contemp. 16(2): 445-463 (2019) - [j15]Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, Matteo Silimbani:
Consecutive patterns in restricted permutations and involutions. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j14]Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, Matteo Silimbani:
Motzkin and Catalan Tunnel Polynomials. J. Integer Seq. 21(8): 18.8.8 (2018) - 2016
- [j13]Marilena Barnabei, Flavio Bonetti, Sergi Elizalde, Matteo Silimbani:
Two Descent Statistics over 321-Avoiding Centrosymmetric Involutions. Electron. J. Comb. 23(1): 1 (2016) - [j12]Marilena Barnabei, Niccolò Castronuovo:
The Schützenberger involution over Dyck paths. Eur. J. Comb. 54: 121-137 (2016) - [j11]Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, Robert Cori:
Some permutations on Dyck words. Theor. Comput. Sci. 635: 51-63 (2016) - 2014
- [j10]Marilena Barnabei, Flavio Bonetti, Sergi Elizalde, Matteo Silimbani:
Descent sets on 321-avoiding involutions and hook decompositions of partitions. J. Comb. Theory A 128: 132-148 (2014) - 2012
- [j9]Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
Two Permutation Classes related to the Bubble Sort Operator. Electron. J. Comb. 19(3): 25 (2012) - 2011
- [j8]Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
Restricted involutions and Motzkin paths. Adv. Appl. Math. 47(1): 102-115 (2011) - 2010
- [j7]Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2. Eur. J. Comb. 31(5): 1360-1371 (2010)
2000 – 2009
- 2009
- [j6]Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
Bijections and recurrences for integer partitions into a bounded number of parts. Appl. Math. Lett. 22(3): 297-303 (2009) - [j5]Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
The Eulerian distribution on centrosymmetric involutions. Discret. Math. Theor. Comput. Sci. 11(1): 95-116 (2009) - [j4]Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
The descent statistic on involutions is not log-concave. Eur. J. Comb. 30(1): 11-16 (2009)
1980 – 1989
- 1980
- [j3]Marilena Barnabei, Andrea Brini:
A class of pbib-designs obtained from projective geometries. Discret. Math. 29(1): 13-17 (1980) - [j2]Marilena Barnabei, Andrea Brini:
Some properties of characteristic polynomials and applications to T-lattices. Discret. Math. 31(3): 261-270 (1980)
1970 – 1979
- 1978
- [j1]Marilena Barnabei, D. Searby, C. Zucchini:
On Small {k; q}-arcs in Planes of Order q2. J. Comb. Theory A 24(2): 241-246 (1978)
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-10-07 21:17 CEST 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:
