default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFilippo Disanto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Filippo Disanto, Michael Fuchs
, Chun-Yen Huang, Ariel R. Paningbatan, Noah A. Rosenberg:
The distributions under two species-tree models of the total number of ancestral configurations for matching gene trees and species trees. Adv. Appl. Math. 152: 102594 (2024)- 2023
- [j14]Filippo Disanto, Michael Fuchs:
Distribution of External Branch Lengths in Yule Histories. Electron. J. Comb. 30(3) (2023)
2010 – 2019
- 2017
- [j13]Filippo Disanto, Noah A. Rosenberg:
Enumeration of Ancestral Configurations for Matching Gene Trees and Species Trees. J. Comput. Biol. 24(9): 831-850 (2017) - 2016
- [j12]Filippo Disanto, Noah A. Rosenberg:
Asymptotic Properties of the Number of Matching Coalescent Histories for Caterpillar-Like Families of Species Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 13(5): 913-925 (2016) - 2015
- [j11]Filippo Disanto, Noah A. Rosenberg:
Coalescent Histories for Lodgepole Species Trees. J. Comput. Biol. 22(10): 918-929 (2015) - [j10]Filippo Disanto:
Some Statistics on the Hypercubes of Catalan Permutations. J. Integer Seq. 18(2): 15.2.2 (2015) - 2014
- [j9]Filippo Disanto, Thomas Wiehe:
On the sub-permutations of pattern avoiding permutations. Discret. Math. 337: 127-141 (2014) - [j8]Filippo Disanto, Laurent Imbert, Fabrice Philippe:
On the Maximal Weight of (P, Q)-ary Chain Partitions With Bounded Parts. Integers 14: A37 (2014) - [j7]Filippo Disanto, Noah A. Rosenberg:
On the Number of Ranked Species Trees Producing Anomalous Ranked Gene Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 11(6): 1229-1238 (2014) - 2013
- [j6]Filippo Disanto, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Generation and Enumeration of Some Classes of Interval Orders. Order 30(2): 663-676 (2013) - [j5]Stefano Bilotta, Filippo Disanto, Renzo Pinzani, Simone Rinaldi:
Catalan structures and Catalan pairs. Theor. Comput. Sci. 502: 239-248 (2013) - 2012
- [i5]Filippo Disanto, Luca Ferrari, Simone Rinaldi:
A partial order structure on interval orders. CoRR abs/1203.5948 (2012) - [i4]Filippo Disanto, Thomas Wiehe:
Some instances of a sub-permutation problem on pattern avoiding permutations. CoRR abs/1210.6908 (2012) - [i3]Filippo Disanto, Laurent Imbert, Fabrice Philippe:
On the maximal weight of $(p,q)$-ary chain partitions with bounded parts. CoRR abs/1212.4370 (2012) - 2011
- [j4]Filippo Disanto, Enrica Duchi, Simone Rinaldi, Gilles Schaeffer:
Permutations with few internal points. Electron. Notes Discret. Math. 38: 291-296 (2011) - [i2]Filippo Disanto, Thomas Wiehe:
Some combinatorial problems on binary rooted trees occurring in population genetics. CoRR abs/1112.1295 (2011) - 2010
- [j3]Filippo Disanto, Luca Ferrari, Renzo Pinzani, Simone Rinaldi:
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
- [j2]Filippo Disanto, Simone Rinaldi, Luca Ferrari, Renzo Pinzani:
Combinatorial properties of Catalan pairs. Electron. Notes Discret. Math. 34: 429-433 (2009) - 2007
- [j1]Filippo Disanto, Andrea Frosini, Renzo Pinzani, Simone Rinaldi:
A Closed Formula for the Number of Convex Permutominoes. Electron. J. Comb. 14(1) (2007)
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-08-05 21:23 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:
