Blerina Sinaimeri

Proceedings of the WALCOM: Algorithms and Computation, 2023

On Graphs that are not Star-k-PCGs (short paper).

[BibT_eX]

[DOI]

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022

On the domination number of $t$-constrained de Bruijn graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

Efficiently sparse listing of classes of optimal cophylogeny reconciliations.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2022

Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk).

[BibT_eX]

[DOI]

Leandro Ishi Soares de Lima

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

A family of tree-based generators for bubbles in directed graphs.

[BibT_eX]

[DOI]

Vicente Acuña

J. Graph Algorithms Appl., 2021

On Generalizations of Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations.

[BibT_eX]

[DOI]

Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021

Compressed Weighted de Bruijn Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

String factorisations with maximum or minimum dimension.

[BibT_eX]

[DOI]

Giuseppe Francesco Italiano

Theor. Comput. Sci., 2020

Lazy listing of equivalence classes - A paper on dynamic programming and tropical circuits.

[BibT_eX]

[DOI]

CoRR, 2020

Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions.

[BibT_eX]

[DOI]

Bioinform., 2020

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2020

On Bubble Generators in Directed Graphs.

[BibT_eX]

[DOI]

Vicente Acuña

Roberto Grossi

Algorithmica, 2020

A Family of Tree-Based Generators for Bubbles in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Exploring the Robustness of the Parsimonious Reconciliation Method in Host-Symbiont Cophylogeny.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

Comparing Related Phylogenetic Trees.

[BibT_eX]

[DOI]

Angelo Di Mambro

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018

Geometric medians in reconciliation spaces of phylogenetic trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

On variants of Vertex Geography on undirected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2017

2016

Pairwise Compatibility Graphs: A Survey.

[BibT_eX]

[DOI]

SIAM Rev., 2016

On Maximal Chain Subgraphs and Covers of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Robustness of the Parsimonious Reconciliation Method in Cophylogeny.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - Third International Conference, 2016

2015

Computing an Evolutionary Ordering is Hard.

[BibT_eX]

[DOI]

Laurent Bulteau

Gustavo Sacomoto

Electron. Notes Discret. Math., 2015

On Pairwise Compatibility of Some Graph (Super)Classes.

[BibT_eX]

[DOI]

Mattia Gastaldello

CoRR, 2015

EUCALYPT: efficient tree reconciliation enumerator.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2015

2014

Pairwise Compatibility Graphs of Caterpillars.

[BibT_eX]

[DOI]

Antonio Frangioni

Comput. J., 2014

Navigating in a Sea of Repeats in RNA-seq without Drowning.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Relating threshold tolerance graphs to other graph classes.

[BibT_eX]

[DOI]

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

Exploring pairwise compatibility graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs.

[BibT_eX]

[DOI]

Rossella Petreschi

Discret. Math. Algorithms Appl., 2013

<i>L</i>(2, 1)L(2, 1)-labeling of oriented planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

Dario Frascaria

Comput. J., 2013

2012

On Relaxing the Constraints in Pairwise Compatibility Graphs.

[BibT_eX]

[DOI]

Rossella Petreschi

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

2011

Rainbow graph splitting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Reverse-free codes and permutations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Labeling of Oriented Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009

On types of growth for graph-different permutations.

[BibT_eX]

[DOI]

János Körner

Gábor Simonyi

J. Comb. Theory, Ser. A, 2009

2007

On Cancellative Set Families.

[BibT_eX]

[DOI]

János Körner