Marc Hellmuth

Daniel Merkle

Nikolai Nøjgaard

Proceedings of the Bioinformatics Research and Applications - 16th International Symposium, 2020

2019

Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Generalized Fitch Relations II: Sets of Binary Relations that are explained by Edge-labeled Trees.

[BibT_eX]

[DOI]

Carsten R. Seemann

CoRR, 2019

Hierarchical Colorings of Cographs.

[BibT_eX]

[DOI]

Dulce I. Valdivia

Manuela Geiß

Maribel Hernández-Rosales

CoRR, 2019

Best Match Graphs and Reconciliation of Gene Trees with Species Trees.

[BibT_eX]

[DOI]

Manuela Geiß

Marcos González

Alitzel López Sánchez

Dulce I. Valdivia

Maribel Hernández-Rosales

CoRR, 2019

2018

On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

The matroid structure of representative triple sets and triple-closure computation.

[BibT_eX]

[DOI]

Carsten R. Seemann

Eur. J. Comb., 2018

Time-consistent reconciliation maps and forbidden time travel.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2018

A short note on undirected Fitch graphs.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2018

Partial Homology Relations - Satisfiability in Terms of Di-Cographs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Phylogenomics with Paralogs.

[BibT_eX]

[DOI]

CoRR, 2017

Reconstructing Gene Trees From Fitch's Xenology Relation.

[BibT_eX]

[DOI]

CoRR, 2017

Partial Orthology, Paralogy and Xenology Relations - Satisfiability in terms of Di-Cographs.

[BibT_eX]

[DOI]

CoRR, 2017

A Survey on Hypergraph Products (Erratum).

[BibT_eX]

[DOI]

CoRR, 2017

Merging Modules is equivalent to Editing P4's.

[BibT_eX]

[DOI]

CoRR, 2017

A Local Prime Factor Decomposition Algorithm for Strong Product Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

From event-labeled gene trees with horizontal gene transfer to species trees.

[BibT_eX]

[DOI]

CoRR, 2017

Biologically feasible gene trees, reconciliation maps and informative triples.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2017

Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps.

[BibT_eX]

[DOI]

Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

2016

Fast factorization of Cartesian products of (directed) hypergraphs.

[BibT_eX]

[DOI]

Florian Lehner

Theor. Comput. Sci., 2016

Associativity and Non-Associativity of Some Hypergraph Products.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2016

Construction of Gene and Species Trees from Sequence Data incl. Orthologs, Paralogs, and Xenologs.

[BibT_eX]

[DOI]

CoRR, 2016

The Mathematics of Xenology: Di-cographs, Symbolic Ultrametrics, 2-structures and Tree-representable Systems of Binary Relations.

[BibT_eX]

[DOI]

CoRR, 2016

Inference of Phylogenetic Trees from the Knowledge of Rare Evolutionary Events.

[BibT_eX]

[DOI]

Yangjing Long

CoRR, 2016

2015

On the Cartesian skeleton and the factorization of the strong product of digraphs.

[BibT_eX]

[DOI]

Ricardo Régis Cavalcante Chaves

Tilen Marc

Theor. Comput. Sci., 2015

Spiders can be Recognized by Counting Their Legs.

[BibT_eX]

[DOI]

Sarah Berkemer

Adrian Fritz

Math. Comput. Sci., 2015

Fast Factorization of Cartesian products of Hypergraphs.

[BibT_eX]

[DOI]

Florian Lehner

CoRR, 2015

Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s.

[BibT_eX]

[DOI]

CoRR, 2015

Fast recognition of partial star products and quasi cartesian products.

[BibT_eX]

[DOI]

Wilfried Imrich

Tomas Kupka

Ars Math. Contemp., 2015

The relaxed square property.

[BibT_eX]

[DOI]

Australas. J Comb., 2015

On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Unique square property, equitable partitions, and product-like graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

Strong products of hypergraphs: Unique prime factorization theorems and algorithms.

[BibT_eX]

[DOI]

Manuel Noll

Discret. Appl. Math., 2014

Simulation of gene family histories.

[BibT_eX]

[DOI]

BMC Bioinform., 2014

Convex cycle bases.

[BibT_eX]

[DOI]

Josef Leydold

Ars Math. Contemp., 2014

2013

Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs.

[BibT_eX]

[DOI]

Wilfried Imrich

Tomas Kupka

Math. Comput. Sci., 2013

On the complexity of recognizing S-composite and S-prime graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Square Property, Equitable Partitions, and Product-like Graphs

[BibT_eX]

[DOI]

CoRR, 2013

2012

A Survey on Hypergraph Products.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2012

The Cartesian product of hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Diagonalized Cartesian products of s-prime graphs are s-prime.

[BibT_eX]

[DOI]

Discret. Math., 2012

From event-labeled gene trees to species trees.

[BibT_eX]

[DOI]

BMC Bioinform., 2012

Minimum cycle bases of lexicographic products.

[BibT_eX]

[DOI]

Philipp-Jens Ostermeier

Ars Math. Contemp., 2012

2011

A local prime factor decomposition algorithm.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

Local Prime Factor Decomposition of Approximate Strong Product Graphs: Local Prime Factor Decompositionof Approximate Strong Product Graphs

[BibT_eX]

[DOI]

PhD thesis, 2010

Visualization of Graph Products.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2010

2009

Local Algorithms for the Prime Factorization of Strong Product Graphs.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2009

Extended shapes for the combinatorial design of RNA sequences.

[BibT_eX]

[DOI]

Daniel Merkle

Martin Middendorf

Int. J. Comput. Biol. Drug Des., 2009

Approximate graph products.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

A note on quasi-robust cycle bases.

[BibT_eX]

[DOI]

Philipp-Jens Ostermeier

Ars Math. Contemp., 2009

On the Design of RNA Sequences for Realizing Extended Shapes.

[BibT_eX]

[DOI]