Marc Hellmuth

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 97

Top Venues

CoRR

Discret. Appl. Math.

Algorithms Mol. Biol.

Art Discret. Appl. Math.

Publications

José Antonio Ramírez-Rafael, Annachiara Korchmaros, Katia Aviña-Padilla, Alitzel López Sánchez, Andrea Arlette España-Tinajero, Marc Hellmuth, Peter F. Stadler, Maribel Hernández-Rosales
REvolutionH-tl: Reconstruction of Evolutionary Histories tool. RECOMB-CG (2024)
Anna Lindeberg, Guillaume E. Scholz, Marc Hellmuth
Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective. CoRR (2024)
Linda Knüver, Mareike Fischer, Marc Hellmuth, Kristina Wicke
The weighted total cophenetic index: A novel balance index for phylogenetic networks. Discret. Appl. Math. 359 (2024)
Marc Hellmuth, Guillaume E. Scholz
Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs. Discret. Appl. Math. 343 (2024)
Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth, Peter F. Stadler
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs. CALDAM (2024)
David Schaller, Tom Hartmann, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Relative timing information and orthology in evolutionary scenarios. Algorithms Mol. Biol. 18 (1) (2023)
Marc Hellmuth, Guillaume E. Scholz
Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. COCOON (1) (2023)
Marc Hellmuth, Peter F. Stadler, Sandhya Thekkumpadan Puthiyaveedu
Fitch Graph Completion. CoRR (2023)
David Schaller, Marc Hellmuth, Peter F. Stadler
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees. SIAM J. Discret. Math. 37 (3) (2023)
Marc Hellmuth, Guillaume E. Scholz
Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs. CoRR (2023)
Marc Hellmuth, Bruno J. Schmidt, Guillaume E. Scholz, Sandhya Thekkumpadan Puthiyaveedu
The Complement of the Djokovic-Winkler Relation. CoRR (2023)
Annachiara Korchmaros, David Schaller, Marc Hellmuth, Peter F. Stadler
Quasi-best match graphs. Discret. Appl. Math. 331 (2023)
Marc Hellmuth, Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz, Peter F. Stadler
Injective Split Systems. Graphs Comb. 39 (4) (2023)
Marc Hellmuth, Peter F. Stadler, Sandhya Thekkumpadan Puthiyaveedu
Fitch Graph Completion. COCOON (2) (2023)
Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth, Peter F. Stadler
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs. CoRR (2023)
Marc Hellmuth, Peter F. Stadler
The Theory of Gene Family Histories. CoRR (2023)
Marc Hellmuth, David Schaller, Peter F. Stadler
Clustering systems of phylogenetic networks. Theory Biosci. 142 (4) (2023)
Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu
On a generalization of median graphs: k-median graphs. CoRR (2023)
Carsten R. Seemann, Vincent Moulton, Peter F. Stadler, Marc Hellmuth
Planar median graphs and cubesquare-graphs. Discret. Appl. Math. 331 (2023)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Best Match Graphs With Binary Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 20 (3) (2023)
Marc Hellmuth, Guillaume E. Scholz
Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs. CoRR (2022)
Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Complete edge-colored permutation graphs. Adv. Appl. Math. 139 (2022)
Marc Hellmuth, Guillaume E. Scholz
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats. Discret. Appl. Math. 321 (2022)
Carmen Bruckmann, Peter F. Stadler, Marc Hellmuth
From modular decomposition trees to rooted median graphs. Discret. Appl. Math. 310 (2022)
Marc Hellmuth, David Schaller, Peter F. Stadler
Clustering Systems of Phylogenetic Networks. CoRR (2022)
Christoph Flamm, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Peter F. Stadler
Generic Context-Aware Group Contributions. IEEE ACM Trans. Comput. Biol. Bioinform. 19 (1) (2022)
David Schaller, Tom Hartmann, Manuel Lafond, Nicolas Wieseke, Marc Hellmuth, Peter F. Stadler
Relative Timing Information and Orthology in Evolutionary Scenarios. CoRR (2022)
Marc Hellmuth, David Schaller, Peter F. Stadler
Compatibility of partitions with trees, hierarchies, and split systems. Discret. Appl. Math. 314 (2022)
Anna Lindeberg, Marc Hellmuth
Construction of k-matchings in graph products. Art Discret. Appl. Math. 6 (2) (2022)
Dulce I. Valdivia, Maribel Hernández-Rosales, Manuela Geiß, Peter F. Stadler, Marc Hellmuth
Hierarchical and modularly-minimal vertex colorings. Art Discret. Appl. Math. 6 (2) (2022)
Marc Hellmuth, Mira Michel, Nikolai N. Nøjgaard, David Schaller, Peter F. Stadler
Combining Orthology and Xenology Data in a Common Phylogenetic Tree. BSB (2021)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Least resolved trees for two-colored best match graphs. CoRR (2021)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Least resolved trees for two-colored best match graphs. J. Graph Algorithms Appl. 25 (1) (2021)
David Schaller, Marc Hellmuth, Peter F. Stadler
A Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set. CoRR (2021)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs. CoRR (2021)
Anna Lindeberg, Marc Hellmuth
Construction of k-matchings and k-regular subgraphs in graph products. CoRR (2021)
Carmen Bruckmann, Peter F. Stadler, Marc Hellmuth
From Modular Decomposition Trees to Rooted Median Graphs. CoRR (2021)
Carsten R. Seemann, Vincent Moulton, Peter F. Stadler, Marc Hellmuth
Planar Median Graphs and Cubesquare-Graphs. CoRR (2021)
David Schaller, Marc Hellmuth, Peter F. Stadler
Orientation of Fitch Graphs and Detection of Horizontal Gene Transfer in Gene Trees. CoRR (2021)
David Schaller, Peter F. Stadler, Marc Hellmuth
Complexity of modification problems for best match graphs. Theor. Comput. Sci. 865 (2021)
Marc Hellmuth, Guillaume E. Scholz
Pseudo-Cographs, Polar-Cats and Level-1 Network Explainable Graphs. CoRR (2021)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Best Match Graphs with Binary Trees. AlCoB (2021)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs. Algorithms 14 (4) (2021)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Heuristic algorithms for best match graph editing. Algorithms Mol. Biol. 16 (1) (2021)
David Schaller, Marc Hellmuth, Peter F. Stadler
A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set. Algorithms Mol. Biol. 16 (1) (2021)
Marc Hellmuth, David Schaller, Peter F. Stadler
Compatibility of Partitions, Hierarchies, and Split Systems. CoRR (2021)
Nikolai Nøjgaard, Walter Fontana, Marc Hellmuth, Daniel Merkle
Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry. CoRR (2021)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Heuristic Algorithms for Best Match Graph Editing. CoRR (2021)
Nikolai Nøjgaard, Walter Fontana, Marc Hellmuth, Daniel Merkle
Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry. J. Comput. Biol. 28 (7) (2021)
Marc Hellmuth, Mira Michel, Nikolai N. Nøjgaard, David Schaller, Peter F. Stadler
Combining Orthology and Xenology Data in a Common Phylogenetic Tree. CoRR (2021)
Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Adrian Fritz, Marc Hellmuth, Peter F. Stadler, Nicolas Wieseke
Cograph editing: Merging modules is equivalent to editing P_4s. Art Discret. Appl. Math. 3 (2) (2020)
Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees. Discret. Appl. Math. 283 (2020)
Dulce I. Valdivia, Manuela Geiß, Maribel Hernández-Rosales, Peter F. Stadler, Marc Hellmuth
Hierarchical and Modularly-Minimal Vertex Colorings. CoRR (2020)
David Schaller, Peter F. Stadler, Marc Hellmuth
Complexity of Modification Problems for Best Match Graphs. CoRR (2020)
Jakob Lykke Andersen, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Marco Peressotti
A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework. SOFSEM (Doctoral Student Research Forum) (2020)
David Schaller, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Indirect Identification of Horizontal Gene Transfer. CoRR (2020)
Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard
Atom Tracking Using Cayley Graphs. ISBRA (2020)
Manuel Lafond, Marc Hellmuth
Reconstruction of time-consistent species trees. Algorithms Mol. Biol. 15 (1) (2020)
David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Best Match Graphs with Binary Trees. CoRR (2020)
Marc Hellmuth, Manuela Geiß, Peter F. Stadler
Complexity of modification problems for reciprocal best match graphs. Theor. Comput. Sci. 809 (2020)
Peter F. Stadler, Manuela Geiß, David Schaller, Alitzel López, Marcos González Laffitte, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernandez-Rosales
From pairs of most similar sequences to phylogenetic best matches. Algorithms Mol. Biol. 15 (1) (2020)
Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Complete Edge-Colored Permutation Graphs. CoRR (2020)
David Schaller, Manuela Geiß, Peter F. Stadler, Marc Hellmuth
Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs. CoRR (2020)
Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. CoRR (2020)
Jakob Lykke Andersen, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Marco Peressotti
A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework. CoRR (2019)
Dulce I. Valdivia, Manuela Geiß, Marc Hellmuth, Maribel Hernández-Rosales, Peter F. Stadler
Hierarchical Colorings of Cographs. CoRR (2019)
Manuela Geiß, Marcos González, Alitzel López, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernández-Rosales, Peter F. Stadler
Best Match Graphs and Reconciliation of Gene Trees with Species Trees. CoRR (2019)
Manuel Lafond, Marc Hellmuth
Reconstruction of time-consistent species trees. CoRR (2019)
Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
Generalized Fitch Relations II: Sets of Binary Relations that are explained by Edge-labeled Trees. CoRR (2019)
Marc Hellmuth
Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees. Discret. Appl. Math. 267 (2019)
Marc Hellmuth, Manuela Geiß, Peter F. Stadler
Complexity of Modification Problems for Reciprocal Best Match Graphs. CoRR (2019)
Marc Hellmuth, Yangjing Long, Manuela Geiß, Peter F. Stadler
A short note on undirected Fitch graphs. Art Discret. Appl. Math. 1 (1) (2018)
Carsten R. Seemann, Marc Hellmuth
The matroid structure of representative triple sets and triple-closure computation. Eur. J. Comb. 70 (2018)
Nikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth
Partial Homology Relations - Satisfiability in Terms of Di-Cographs. COCOON (2018)
Marc Hellmuth, Anders S. Knudsen, Michal Kotrbcík, Daniel Merkle, Nikolai Nøjgaard
Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. ALENEX (2018)
Marc Hellmuth, Nicolas Wieseke
On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions. J. Comb. Optim. 36 (2) (2018)
Marc Hellmuth
Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees. CoRR (2018)
Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Time-consistent reconciliation maps and forbidden time travel. Algorithms Mol. Biol. 13 (1) (2018)
Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler
Local algorithms for the prime factorization of strong product graphs. CoRR (2017)
Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. WABI (2017)
Manuela Geiß, Marc Hellmuth, Yangjing Long, Peter F. Stadler
A Short Note on Undirected Fitch Graphs. CoRR (2017)
Marc Hellmuth, Nicolas Wieseke, Marcus Lechner, Hans-Peter Lenhof, Martin Middendorf, Peter F. Stadler
Phylogenomics with Paralogs. CoRR (2017)
Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
A Survey on Hypergraph Products (Erratum). CoRR (2017)
Marc Hellmuth
A Local Prime Factor Decomposition Algorithm for Strong Product Graphs. CoRR (2017)
Marc Hellmuth, Adrian Fritz, Nicolas Wieseke, Peter F. Stadler
Merging Modules is equivalent to Editing P4's. CoRR (2017)
Nikolai Nøjgaard, Manuela Geiß, Peter F. Stadler, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth
Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. CoRR (2017)
Maribel Hernandez-Rosales, Marc Hellmuth, Nicolas Wieseke, Katharina T. Huber, Vincent Moulton, Peter F. Stadler
From event labeled gene trees to species trees. CoRR (2017)
Manuela Geiß, John Anders, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Reconstructing Gene Trees From Fitch's Xenology Relation. CoRR (2017)
Marc Hellmuth
From event-labeled gene trees with horizontal gene transfer to species trees. CoRR (2017)
Nikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth
Partial Orthology, Paralogy and Xenology Relations - Satisfiability in terms of Di-Cographs. CoRR (2017)
Marc Hellmuth
Biologically feasible gene trees, reconciliation maps and informative triples. Algorithms Mol. Biol. 12 (1) (2017)
Marc Hellmuth, Florian Lehner
Fast factorization of Cartesian products of (directed) hypergraphs. Theor. Comput. Sci. 615 (2016)
Marc Hellmuth, Peter F. Stadler, Nicolas Wieseke
The Mathematics of Xenology: Di-cographs, Symbolic Ultrametrics, 2-structures and Tree-representable Systems of Binary Relations. CoRR (2016)
Richard H. Hammack, Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
Associativity and Non-Associativity of Some Hypergraph Products. Math. Comput. Sci. 10 (3) (2016)
Marc Hellmuth, Nicolas Wieseke
Construction of Gene and Species Trees from Sequence Data incl. Orthologs, Paralogs, and Xenologs. CoRR (2016)
Marc Hellmuth, Maribel Hernandez-Rosales, Yangjing Long, Peter F. Stadler
Inference of Phylogenetic Trees from the Knowledge of Rare Evolutionary Events. CoRR (2016)
Marc Hellmuth, Adrian Fritz, Nicolas Wieseke, Peter F. Stadler
Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s. CoRR (2015)
Marc Hellmuth, Florian Lehner
Fast Factorization of Cartesian products of Hypergraphs. CoRR (2015)
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
Fast recognition of partial star products and quasi cartesian products. Ars Math. Contemp. 9 (2) (2015)

Marc Hellmuth.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Marc Hellmuth