On Cancellative Set Families. - János Körner; Blerina Sinaimeri (Comb. Probab. Comput., 2007)

On types of growth for graph-different permutations. - János Körner; Gábor Simonyi; Blerina Sinaimeri (J. Comb. Theory A, 2009)

Labeling of Oriented Planar Graphs. - Tiziana Calamoneri; Blerina Sinaimeri (CTW, 2011)

Reverse-free codes and permutations. - Zoltán Füredi; Ida Kantor; Angelo Monti; Blerina Sinaimeri (Electron. Notes Discret. Math., 2011)

Rainbow graph splitting. - Angelo Monti; Blerina Sinaimeri (Theor. Comput. Sci., 2011)

On Relaxing the Constraints in Pairwise Compatibility Graphs. - Tiziana Calamoneri; Rossella Petreschi; Blerina Sinaimeri (WALCOM, 2012)

All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs. - Tiziana Calamoneri; Dario Frascaria; Blerina Sinaimeri (Comput. J., 2013)

L(2, 1)L(2, 1)-labeling of oriented planar graphs. - Tiziana Calamoneri; Blerina Sinaimeri (Discret. Appl. Math., 2013)

On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs. - Tiziana Calamoneri; Rossella Petreschi; Blerina Sinaimeri (Discret. Math. Algorithms Appl., 2013)

Exploring pairwise compatibility graphs. - Tiziana Calamoneri; Eugenio Montefusco; Rossella Petreschi; Blerina Sinaimeri (Theor. Comput. Sci., 2013)

Relating threshold tolerance graphs to other graph classes. - Tiziana Calamoneri; Blerina Sinaimeri (ICTCS, 2014)

Navigating in a Sea of Repeats in RNA-seq without Drowning. - Gustavo Sacomoto; Blerina Sinaimeri; Camille Marchet; Vincent Miele; Marie-France Sagot; Vincent Lacroix (WABI, 2014)

Pairwise Compatibility Graphs of Caterpillars. - Tiziana Calamoneri; Antonio Frangioni; Blerina Sinaimeri (Comput. J., 2014)

EUCALYPT: efficient tree reconciliation enumerator. - Beatrice Donati; Christian Baudet; Blerina Sinaimeri; Pierluigi Crescenzi; Marie-France Sagot (Algorithms Mol. Biol., 2015)

On Pairwise Compatibility of Some Graph (Super)Classes. - Tiziana Calamoneri; Blerina Sinaimeri; Mattia Gastaldello (CoRR, 2015)

Computing an Evolutionary Ordering is Hard. - Laurent Bulteau; Gustavo Sacomoto; Blerina Sinaimeri (Electron. Notes Discret. Math., 2015)

Robustness of the Parsimonious Reconciliation Method in Cophylogeny. - Laura Urbini; Blerina Sinaimeri; Catherine Matias; Marie-France Sagot (AlCoB, 2016)

On Maximal Chain Subgraphs and Covers of Bipartite Graphs. - Tiziana Calamoneri; Mattia Gastaldello; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (IWOCA, 2016)

Pairwise Compatibility Graphs: A Survey. - Tiziana Calamoneri; Blerina Sinaimeri (SIAM Rev., 2016)

Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads. - Leandro Lima; Blerina Sinaimeri; Gustavo Sacomoto; Hélène Lopez-Maestre; Camille Marchet; Vincent Miele; Marie-France Sagot; Vincent Lacroix (Algorithms Mol. Biol., 2017)

On variants of Vertex Geography on undirected graphs. - Angelo Monti; Blerina Sinaimeri (Discret. Appl. Math., 2018)

Geometric medians in reconciliation spaces of phylogenetic trees. - Katharina T. Huber; Vincent Moulton; Marie-France Sagot; Blerina Sinaimeri (Inf. Process. Lett., 2018)

Comparing Related Phylogenetic Trees. - Tiziana Calamoneri; Angelo Di Mambro; Blerina Sinaimeri (ICTCS, 2019)

Exploring the Robustness of the Parsimonious Reconciliation Method in Host-Symbiont Cophylogeny. - Laura Urbini; Blerina Sinaimeri; Catherine Matias; Marie-France Sagot (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

A Family of Tree-Based Generators for Bubbles in Directed Graphs. - Vicente Acuña; Leandro Lima; Giuseppe F. Italiano; Luca Pepè Sciarria; Marie-France Sagot; Blerina Sinaimeri (IWOCA, 2020)

On Bubble Generators in Directed Graphs. - Vicente Acuña; Roberto Grossi; Giuseppe Francesco Italiano; Leandro Lima; Romeo Rizzi; Gustavo Sacomoto; Marie-France Sagot; Blerina Sinaimeri (Algorithmica, 2020)

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility. - Tiziana Calamoneri; Mattia Gastaldello; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (Algorithms Mol. Biol., 2020)

Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (Bioinform., 2020)

Lazy listing of equivalence classes - A paper on dynamic programming and tropical circuits. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (CoRR, 2020)

String factorisations with maximum or minimum dimension. - Angelo Monti; Blerina Sinaimeri (Theor. Comput. Sci., 2020)

Compressed Weighted de Bruijn Graphs. - Giuseppe F. Italiano; Nicola Prezza; Blerina Sinaimeri; Rossano Venturini (CPM, 2021)

Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (WABI, 2021)

On Generalizations of Pairwise Compatibility Graphs. - Tiziana Calamoneri; Angelo Monti; Blerina Sinaimeri (CoRR, 2021)

A family of tree-based generators for bubbles in directed graphs. - Vicente Acuña; Leandro Ishi Soares de Lima; Giuseppe F. Italiano; Luca Pepè Sciarria; Marie-France Sagot; Blerina Sinaimeri (J. Graph Algorithms Appl., 2021)

Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk). - Tiziana Calamoneri; Blerina Sinaimeri (WALCOM, 2022)

Efficiently sparse listing of classes of optimal cophylogeny reconciliations. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (Algorithms Mol. Biol., 2022)

On the domination number of $t$-constrained de Bruijn graphs. - Tiziana Calamoneri; Angelo Monti; Blerina Sinaimeri (Discret. Math. Theor. Comput. Sci., 2022)

A Network Approach to Aquatic Food Web Dynamics. - Davide Torre; Giuseppe F. Italiano; Blerina Sinaimeri (CIBB, 2023)

On Graphs that are not Star-k-PCGs (short paper). - Angelo Monti; Blerina Sinaimeri (ICTCS, 2023)

On Star-Multi-interval Pairwise Compatibility Graphs. - Angelo Monti; Blerina Sinaimeri (WALCOM, 2023)

A General Framework for Enumerating Equivalence Classes of Solutions. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (Algorithmica, 2023)

From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks. - Irene Finocchi; Renan Leon Garcia; Blerina Sinaimeri (Comput. J., 2024)

Disjoint covering of bipartite graphs with s-clubs. - Angelo Monti; Blerina Sinaimeri (CoRR, 2024)

Effects of graph operations on star pairwise compatibility graphs. - Angelo Monti; Blerina Sinaimeri (CoRR, 2024)

On Generalizations of Pairwise Compatibility Graphs. - Tiziana Calamoneri; Manuel Lafond; Angelo Monti; Blerina Sinaimeri (Discret. Math. Theor. Comput. Sci., 2024)

STARGATE-X: a Python package for statistical analysis on the REACTOME network. - Andrea Marino 003; Blerina Sinaimeri; Enrico Tronci; Tiziana Calamoneri (J. Integr. Bioinform., 2024)

Disjoint Covering of Bipartite Graphs with s-clubs. - Angelo Monti; Blerina Sinaimeri (SOFSEM (2), 2025)

On star-k-PCGs: exploring class boundaries for small k values. - Angelo Monti; Blerina Sinaimeri (Acta Informatica, 2025)