112 citations · 255 across the 57 of their papers we have counts for
13 papers · 1 filter
From Modular Decomposition Trees to Level-1 Networks: Pseudo-Cographs, Polar-Cats and Prime Polar-Cats
Marc Hellmuth, Guillaume E. Scholz
The modular decomposition of a graph is a natural construction to capture key features of in terms of a labeled tree whose vertices are labeled as "series" (), "…
Orientation of Fitch Graphs and Detection of Horizontal Gene Transfer in Gene Trees
David Schaller, Marc Hellmuth, Peter F. Stadler
Horizontal gene transfer events partition a gene tree and thus, its leaf set into subsets of genes whose evolutionary history is described by speciation and duplication events…
Planar Median Graphs and Cubesquare-Graphs
Carsten R. Seemann, Vincent Moulton, Peter F. Stadler +1
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper…
Construction of -matchings and -regular subgraphs in graph products
Anna Lindeberg, Marc Hellmuth
A -matching of a graph is a subset such that each connected component in the subgraph of is either a single-vertex graph or -regu…
Quasi-Best Match Graphs
Annachiara Korchmaros, David Schaller, Marc Hellmuth +1
Quasi-best match graphs (qBMGs) are a hereditary class of directed, properly vertex-colored graphs. They arise naturally in mathematical phylogenetics as a generalization of best m…
Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry
Nikolai Nøjgaard, Walter Fontana, Marc Hellmuth +1
While atom tracking with isotope-labeled compounds is an essential and sophisticated wet-lab tool in order to, e.g., illuminate reaction mechanisms, there exists only a limited amo…