List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
DEBUG first row: length=10 | [1]=https://portal.mardi4nfdi.de/wiki/Public | [2]=The complement of the Djoković-Winkler | [3]=https://portal.mardi4nfdi.de/entity/Q665 | [4]=2025-01-08 | [5]=Q6658058 | [6]=https://portal.mardi4nfdi.de/entity/Q597 | [7]=Paper | [8]=7962794 | [9]=Discrete Mathematics | [10]=
| Publication | Date of Publication | Type |
|---|---|---|
| The complement of the Djoković-Winkler relation Discrete Mathematics row10= | journal=Discrete Mathematics | arxivId= | 2025-01-08 | Paper |
| The weighted total cophenetic index: a novel balance index for phylogenetic networks Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2024-11-06 | Paper |
| Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs row10= | journal= | arxivId= | 2024-08-22 | Paper |
| Fitch graph completion row10= | journal= | arxivId= | 2024-08-22 | Paper |
| Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2024-01-02 | Paper |
| The Complement of the Djokovic-Winkler Relation row10= | journal= | arxivId= | 2023-11-30 | Paper |
| Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees SIAM Journal on Discrete Mathematics row10= | journal=SIAM Journal on Discrete Mathematics | arxivId= | 2023-10-13 | Paper |
| Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs row10= | journal= | arxivId= | 2023-09-24 | Paper |
| Injective split systems Graphs and Combinatorics row10= | journal=Graphs and Combinatorics | arxivId= | 2023-07-12 | Paper |
| Fitch Graph Completion row10= | journal= | arxivId= | 2023-06-12 | Paper |
| Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs row10= | journal= | arxivId= | 2023-06-07 | Paper |
| The Theory of Gene Family Histories row10= | journal= | arxivId= | 2023-04-24 | Paper |
| On a generalization of median graphs: $k$-median graphs row10= | journal= | arxivId= | 2023-04-13 | Paper |
| Planar median graphs and cubesquare-graphs Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2023-03-29 | Paper |
| Quasi-best match graphs Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2023-03-29 | Paper |
| Construction of k-matchings in graph products The Art of Discrete and Applied Mathematics row10= | journal=The Art of Discrete and Applied Mathematics | arxivId= | 2022-12-19 | Paper |
| Hierarchical and modularly-minimal vertex colorings The Art of Discrete and Applied Mathematics row10= | journal=The Art of Discrete and Applied Mathematics | arxivId= | 2022-12-19 | Paper |
| Relative Timing Information and Orthology in Evolutionary Scenarios row10= | journal= | arxivId= | 2022-12-05 | Paper |
| Generalized Fitch graphs. III: Symmetrized Fitch maps and sets of symmetric binary relations that are explained by unrooted edge-labeled trees Discrete Mathematics & Theoretical Computer Science row10= | journal=Discrete Mathematics & Theoretical Computer Science | arxivId= | 2022-09-30 | Paper |
| From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2022-09-15 | Paper |
| Least resolved trees for two-colored best match graphs Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2022-06-28 | Paper |
| Complete edge-colored permutation graphs Advances in Applied Mathematics row10= | journal=Advances in Applied Mathematics | arxivId= | 2022-06-13 | Paper |
| Clustering Systems of Phylogenetic Networks row10= | journal= | arxivId= | 2022-04-28 | Paper |
| Compatibility of partitions with trees, hierarchies, and split systems Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2022-04-20 | Paper |
| Simultaneous Credible Regions for Multiple Changepoint Locations Journal of Computational and Graphical Statistics row10= | journal=Journal of Computational and Graphical Statistics | arxivId= | 2022-03-28 | Paper |
| Correction Journal of Computational and Graphical Statistics row10= | journal=Journal of Computational and Graphical Statistics | arxivId= | 2022-03-28 | Paper |
| From modular decomposition trees to rooted median graphs Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2022-02-09 | Paper |
| Best match graphs with binary trees row10= | journal= | arxivId= | 2021-12-21 | Paper |
| Planar Median Graphs and Cubesquare-Graphs row10=2110.09346 | journal= | arxivId=2110.09346 | 2021-10-18 | Paper |
| Quasi-Best Match Graphs row10=2109.10235 | journal= | arxivId=2109.10235 | 2021-09-21 | Paper |
| Indirect identification of horizontal gene transfer Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2021-07-13 | Paper |
| Combining Orthology and Xenology Data in a Common Phylogenetic Tree row10= | journal= | arxivId= | 2021-07-05 | Paper |
| A Simple Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set row10= | journal= | arxivId= | 2021-06-30 | Paper |
| Corrigendum to: ``Best match graphs Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2021-04-27 | Paper |
| Complexity of modification problems for best match graphs Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2021-04-08 | Paper |
| Complete characterization of incorrect orthology assignments in best match graphs Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2021-03-25 | Paper |
| Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs row10= | journal= | arxivId= | 2021-03-11 | Paper |
| Heuristic Algorithms for Best Match Graph Editing row10= | journal= | arxivId= | 2021-03-10 | Paper |
| Cograph editing: Merging modules is equivalent to editing P_4s The Art of Discrete and Applied Mathematics row10= | journal=The Art of Discrete and Applied Mathematics | arxivId= | 2020-09-15 | Paper |
| Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2020-06-29 | Paper |
| Forbidden time travel: characterization of time-consistent tree reconciliation maps row10= | journal= | arxivId= | 2020-05-27 | Paper |
| Best match graphs and reconciliation of gene trees with species trees Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2020-03-05 | Paper |
| Reciprocal best match graphs Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2020-02-21 | Paper |
| Complexity of modification problems for reciprocal best match graphs Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2020-01-29 | Paper |
| Reconstruction of time-consistent species trees row10= | journal= | arxivId= | 2019-10-29 | Paper |
| Reconciling event-labeled gene trees with MUL-trees and species networks Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2019-10-22 | Paper |
| A short note on undirected Fitch graphs The Art of Discrete and Applied Mathematics row10= | journal=The Art of Discrete and Applied Mathematics | arxivId= | 2019-10-02 | Paper |
| Linear time canonicalization and enumeration of non-isomorphic 1-face embeddings 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) row10= | journal=2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | arxivId= | 2019-09-12 | Paper |
| Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2019-09-05 | Paper |
| Alternative characterizations of Fitch's xenology relation Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2019-08-01 | Paper |
| Hierarchical Colorings of Cographs row10= | journal= | arxivId= | 2019-06-24 | Paper |
| Best match graphs Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2019-06-06 | Paper |
| Reconstructing gene trees from Fitch's xenology relation Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2018-10-09 | Paper |
| Partial homology relations -- satisfiability in terms of di-cographs row10= | journal= | arxivId= | 2018-10-04 | Paper |
| On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions Journal of Combinatorial Optimization row10= | journal=Journal of Combinatorial Optimization | arxivId= | 2018-07-20 | Paper |
| Inferring phylogenetic trees from the knowledge of rare evolutionary events Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2018-05-22 | Paper |
| The matroid structure of representative triple sets and triple-closure computation European Journal of Combinatorics row10= | journal=European Journal of Combinatorics | arxivId= | 2018-04-25 | Paper |
| The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2017-08-11 | Paper |
| Associativity and non-associativity of some hypergraph products Mathematics in Computer Science row10= | journal=Mathematics in Computer Science | arxivId= | 2016-11-14 | Paper |
| Simultaneous Credible Regions for Multiple Changepoint Locations row10=1610.04199 | journal= | arxivId=1610.04199 | 2016-10-13 | Paper |
| Fast recognition of partial star products and quasi Cartesian products Ars Mathematica Contemporanea row10= | journal=Ars Mathematica Contemporanea | arxivId= | 2016-01-22 | Paper |
| Fast factorization of Cartesian products of (directed) hypergraphs Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2016-01-21 | Paper |
| Spiders can be recognized by counting their legs Mathematics in Computer Science row10= | journal=Mathematics in Computer Science | arxivId= | 2016-01-13 | Paper |
| On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2015-10-29 | Paper |
| The relaxed square property row10= | journal= | arxivId= | 2015-09-23 | Paper |
| Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs Mathematics in Computer Science row10= | journal=Mathematics in Computer Science | arxivId= | 2015-02-04 | Paper |
| On the Cartesian skeleton and the factorization of the strong product of digraphs Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2014-12-22 | Paper |
| Convex cycle bases Ars Mathematica Contemporanea row10= | journal=Ars Mathematica Contemporanea | arxivId= | 2014-10-02 | Paper |
| Strong products of hypergraphs: unique prime factorization theorems and algorithms Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2014-05-06 | Paper |
| Unique square property, equitable partitions, and product-like graphs Discrete Mathematics row10= | journal=Discrete Mathematics | arxivId= | 2014-01-27 | Paper |
| On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2013-04-25 | Paper |
| A survey on hypergraph products Mathematics in Computer Science row10= | journal=Mathematics in Computer Science | arxivId= | 2013-04-24 | Paper |
| Minimum cycle bases of lexicographic products Ars Mathematica Contemporanea row10= | journal=Ars Mathematica Contemporanea | arxivId= | 2013-02-07 | Paper |
| Orthology relations, symbolic ultrametrics, and cographs Journal of Mathematical Biology row10= | journal=Journal of Mathematical Biology | arxivId= | 2013-02-01 | Paper |
| The Cartesian product of hypergraphs Journal of Graph Theory row10= | journal=Journal of Graph Theory | arxivId= | 2012-06-04 | Paper |
| Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime Discrete Mathematics row10= | journal=Discrete Mathematics | arxivId= | 2012-01-11 | Paper |
| A local prime factor decomposition algorithm Discrete Mathematics row10= | journal=Discrete Mathematics | arxivId= | 2011-05-16 | Paper |
| Local algorithms for the prime factorization of strong product graphs Mathematics in Computer Science row10= | journal=Mathematics in Computer Science | arxivId= | 2011-02-19 | Paper |
| A note on quasi-robust cycle bases Ars Mathematica Contemporanea row10= | journal=Ars Mathematica Contemporanea | arxivId= | 2010-04-15 | Paper |
| Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences The Electronic Journal of Linear Algebra row10= | journal=The Electronic Journal of Linear Algebra | arxivId= | 2009-09-07 | Paper |
| Approximate graph products European Journal of Combinatorics row10= | journal=European Journal of Combinatorics | arxivId= | 2009-06-17 | Paper |
| The weighted total cophenetic index: A novel balance index for phylogenetic networks row10=2307.08654 | journal= | arxivId=2307.08654 | N/A | Paper |
Research outcomes over time
This page was built for person: Marc Hellmuth
