Marc Hellmuth

Associate Professor

Stockholm University

Sweden

Research Interests

Explore related searches

Professors in Sweden

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

About

Marc Hellmuth is an Associate Professor at Stockholm University in Sweden. His research areas encompass the characterization and transformation of directed acyclic graphs (DAGs), phylogenetic networks, and combinatorial structures. His recent publications reflect a focus on network representation, modular decomposition, and novel indices in phylogenetic research.

Articles (19)

Year:

2026

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Collaborators (3)

Peter F. Stadler

Leipzig University

GERMANY

View details

Carsten Seemann

Leipzig University

GERMANY

View details

Christoph Flamm

Universität Wien

AUSTRIA

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Marc Hellmuth

Research Interests

Explore related searches

Contact this professor

About

Articles (19)

Characterizing and transforming DAGs within the ℐ-lca framework

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective

Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints

The weighted total cophenetic index: A novel balance index for phylogenetic networks

Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs

Planar median graphs and cubesquare-graphs

Best Match Graphs With Binary Trees

Quasi-best match graphs

Clustering systems of phylogenetic networks

Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees

Injective Split Systems

Generic Context-Aware Group Contributions

From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats

AsymmeTree: A Flexible Python Package for the Simulation of Complex Gene Family Histories

Complete edge-colored permutation graphs

Compatibility of partitions with trees, hierarchies, and split systems

From modular decomposition trees to rooted median graphs

Construction of k-matchings in graph products

A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set

Collaborators (3)

Peter F. Stadler

Carsten Seemann

Christoph Flamm

Make your next move.