The following pages link to Marc Hellmuth (Q340607):
Displaying 22 items.
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
- Least resolved trees for two-colored best match graphs (Q5084685) (← links)
- Forbidden time travel: Characterization of time-consistent tree reconciliation maps (Q5111818) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- A short note on undirected Fitch graphs (Q5198013) (← links)
- Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings (Q5232735) (← links)
- Correction (Q5966264) (← links)
- Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees (Q6072286) (← links)
- Injective split systems (Q6115433) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- Simultaneous Credible Regions for Multiple Changepoint Locations (Q6278607) (← links)
- A Simple Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set (Q6371680) (← links)
- Quasi-Best Match Graphs (Q6378197) (← links)
- Planar Median Graphs and Cubesquare-Graphs (Q6380665) (← links)
- The weighted total cophenetic index: A novel balance index for phylogenetic networks (Q6511131) (← links)
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs (Q6591462) (← links)
- Fitch graph completion (Q6591635) (← links)
- The weighted total cophenetic index: a novel balance index for phylogenetic networks (Q6633526) (← links)
- The complement of the Djoković-Winkler relation (Q6658058) (← links)
- Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective (Q6734164) (← links)
- Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints (Q6751579) (← links)
- Characterizing and Transforming DAGs within the I-LCA Framework (Q6754429) (← links)
