Остановите войну!
for scientists:
default search action
Blerina Sinaimeri
- > Home > Persons > Blerina Sinaimeri
Publications
- 2024
- [j26]Andrea Marino, Blerina Sinaimeri, Enrico Tronci, Tiziana Calamoneri:
STARGATE-X: a Python package for statistical analysis on the REACTOME network. J. Integr. Bioinform. 20(3) (2024) - 2022
- [j23]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the domination number of $t$-constrained de Bruijn graphs. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [c15]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the Domination Number of t-Constrained de Bruijn Graphs. ICTCS 2022: 34-39 - [c14]Tiziana Calamoneri, Blerina Sinaimeri:
Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk). WALCOM 2022: 3-14 - 2021
- [i9]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On Generalizations of Pairwise Compatibility Graphs. CoRR abs/2112.08503 (2021) - 2020
- [j20]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility. Algorithms Mol. Biol. 15(1): 14 (2020) - 2019
- [c9]Tiziana Calamoneri, Angelo Di Mambro, Blerina Sinaimeri:
Comparing Related Phylogenetic Trees. ICTCS 2019: 8-13 - 2016
- [j13]Tiziana Calamoneri, Blerina Sinaimeri:
Pairwise Compatibility Graphs: A Survey. SIAM Rev. 58(3): 445-460 (2016) - [c6]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
On Maximal Chain Subgraphs and Covers of Bipartite Graphs. ICTCS 2016: 286-291 - [c5]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
On Maximal Chain Subgraphs and Covers of Bipartite Graphs. IWOCA 2016: 137-150 - 2015
- [i6]Tiziana Calamoneri, Blerina Sinaimeri, Mattia Gastaldello:
On Pairwise Compatibility of Some Graph (Super)Classes. CoRR abs/1504.06454 (2015) - 2014
- [j10]Tiziana Calamoneri, Antonio Frangioni, Blerina Sinaimeri:
Pairwise Compatibility Graphs of Caterpillars. Comput. J. 57(11): 1616-1623 (2014) - [c4]Tiziana Calamoneri, Blerina Sinaimeri:
Relating threshold tolerance graphs to other graph classes. ICTCS 2014: 73-79 - 2013
- [j9]Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri:
All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs. Comput. J. 56(7): 882-886 (2013) - [j8]Tiziana Calamoneri, Blerina Sinaimeri:
L(2, 1)L(2, 1)-labeling of oriented planar graphs. Discret. Appl. Math. 161(12): 1719-1725 (2013) - [j7]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs. Discret. Math. Algorithms Appl. 5(2) (2013) - [j6]Tiziana Calamoneri, Eugenio Montefusco, Rossella Petreschi, Blerina Sinaimeri:
Exploring pairwise compatibility graphs. Theor. Comput. Sci. 468: 23-36 (2013) - 2012
- [c2]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On Relaxing the Constraints in Pairwise Compatibility Graphs. WALCOM 2012: 124-135 - [i3]Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri:
All graphs with at most seven vertices are Pairwise Compatibility Graphs. CoRR abs/1202.4631 (2012) - 2011
- [c1]Tiziana Calamoneri, Blerina Sinaimeri:
Labeling of Oriented Planar Graphs. CTW 2011: 93-96 - [i2]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On relaxing the constraints in pairwise compatibility graphs. CoRR abs/1105.2171 (2011)
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-03-25 02:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint