default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBlerina Sinaimeri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Irene Finocchi
, Renan Leon Garcia, Blerina Sinaimeri:
From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks. Comput. J. 67(6): 2151-2161 (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) - [i11]Angelo Monti, Blerina Sinaimeri:
Disjoint covering of bipartite graphs with s-clubs. CoRR abs/2409.14783 (2024) - 2023
- [j25]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
A General Framework for Enumerating Equivalence Classes of Solutions. Algorithmica 85(10): 3003-3023 (2023) - [c17]Angelo Monti, Blerina Sinaimeri:
On Graphs that are not Star-k-PCGs (short paper). ICTCS 2023: 92-97 - [c16]Angelo Monti, Blerina Sinaimeri:
On Star-Multi-interval Pairwise Compatibility Graphs. WALCOM 2023: 267-278 - 2022
- [j24]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Efficiently sparse listing of classes of optimal cophylogeny reconciliations. Algorithms Mol. Biol. 17(1): 2 (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 - [i10]Angelo Monti, Blerina Sinaimeri:
On star-multi-interval pairwise compatibility graphs. CoRR abs/2209.11860 (2022) - 2021
- [j22]Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri:
A family of tree-based generators for bubbles in directed graphs. J. Graph Algorithms Appl. 25(1): 563-580 (2021) - [c13]Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini:
Compressed Weighted de Bruijn Graphs. CPM 2021: 16:1-16:16 - [c12]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
A General Framework for Enumerating Equivalence Classes of Solutions. ESA 2021: 80:1-80:14 - [c11]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations. WABI 2021: 3:1-3:18 - [i9]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On Generalizations of Pairwise Compatibility Graphs. CoRR abs/2112.08503 (2021) - 2020
- [j21]Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri:
On Bubble Generators in Directed Graphs. Algorithmica 82(4): 898-914 (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) - [j19]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions. Bioinform. 36(14): 4197-4199 (2020) - [j18]Angelo Monti, Blerina Sinaimeri:
String factorisations with maximum or minimum dimension. Theor. Comput. Sci. 842: 65-73 (2020) - [c10]Vicente Acuña, Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri:
A Family of Tree-Based Generators for Bubbles in Directed Graphs. IWOCA 2020: 17-29 - [i8]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Lazy listing of equivalence classes - A paper on dynamic programming and tropical circuits. CoRR abs/2004.12143 (2020)
2010 – 2019
- 2019
- [j17]Laura Urbini, Blerina Sinaimeri, Catherine Matias, Marie-France Sagot:
Exploring the Robustness of the Parsimonious Reconciliation Method in Host-Symbiont Cophylogeny. IEEE ACM Trans. Comput. Biol. Bioinform. 16(3): 738-748 (2019) - [c9]Tiziana Calamoneri, Angelo Di Mambro, Blerina Sinaimeri:
Comparing Related Phylogenetic Trees. ICTCS 2019: 8-13 - [i7]Angelo Monti, Blerina Sinaimeri:
String factorisations with maximum or minimum dimension. CoRR abs/1912.10140 (2019) - 2018
- [j16]Angelo Monti, Blerina Sinaimeri:
On variants of Vertex Geography on undirected graphs. Discret. Appl. Math. 251: 268-275 (2018) - [j15]Katharina T. Huber, Vincent Moulton, Marie-France Sagot, Blerina Sinaimeri:
Geometric medians in reconciliation spaces of phylogenetic trees. Inf. Process. Lett. 136: 96-101 (2018) - 2017
- [j14]Leandro Lima, Blerina Sinaimeri, Gustavo Sacomoto, Hélène Lopez-Maestre, Camille Marchet, Vincent Miele, Marie-France Sagot, Vincent Lacroix:
Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads. Algorithms Mol. Biol. 12(1): 2:1-2:19 (2017) - [c8]Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri:
On Bubble Generators in Directed Graphs. WG 2017: 18-31 - 2016
- [j13]Tiziana Calamoneri, Blerina Sinaimeri:
Pairwise Compatibility Graphs: A Survey. SIAM Rev. 58(3): 445-460 (2016) - [c7]Laura Urbini, Blerina Sinaimeri, Catherine Matias, Marie-France Sagot:
Robustness of the Parsimonious Reconciliation Method in Cophylogeny. AlCoB 2016: 119-130 - [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
- [j12]Beatrice Donati, Christian Baudet, Blerina Sinaimeri, Pierluigi Crescenzi, Marie-France Sagot:
EUCALYPT: efficient tree reconciliation enumerator. Algorithms Mol. Biol. 10: 3 (2015) - [j11]Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri:
Computing an Evolutionary Ordering is Hard. Electron. Notes Discret. Math. 50: 255-260 (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 - [c3]Gustavo Sacomoto, Blerina Sinaimeri, Camille Marchet, Vincent Miele, Marie-France Sagot, Vincent Lacroix:
Navigating in a Sea of Repeats in RNA-seq without Drowning. WABI 2014: 82-96 - [i5]Gustavo Sacomoto, Blerina Sinaimeri, Camille Marchet, Vincent Miele, Marie-France Sagot, Vincent Lacroix:
Navigating in a sea of repeats in RNA-seq without drowning. CoRR abs/1406.1022 (2014) - [i4]Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri:
Computing an Evolutionary Ordering is Hard. CoRR abs/1410.6663 (2014) - 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
- [j5]Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
Reverse-free codes and permutations. Electron. Notes Discret. Math. 38: 383-387 (2011) - [j4]Angelo Monti, Blerina Sinaimeri:
Rainbow graph splitting. Theor. Comput. Sci. 412(39): 5315-5324 (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) - 2010
- [j3]Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
On Reverse-Free Codes and Permutations. SIAM J. Discret. Math. 24(3): 964-978 (2010)
2000 – 2009
- 2009
- [j2]János Körner, Gábor Simonyi, Blerina Sinaimeri:
On types of growth for graph-different permutations. J. Comb. Theory A 116(3): 713-723 (2009) - 2007
- [j1]János Körner, Blerina Sinaimeri:
On Cancellative Set Families. Comb. Probab. Comput. 16(5): 767-773 (2007) - [i1]János Körner, Gábor Simonyi, Blerina Sinaimeri:
On types of growth for graph-different permutations. CoRR abs/0712.1442 (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-10-16 20:27 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:
