External Links

Publications


Published (peer-reviewed)

    MONOGRAPHS / BOOK CHAPTERS
  1. The Theory of Gene Family Histories
    M. Hellmuth, P.F. Stadler
    Joao Carlos Setubal et al. (eds.), Comparative Genomics: Methods and Protocols, Methods in Molecular Biology, Springer Nature vol. 2802, (to appear), 2024
    [arXiv]
  2. From Sequence Data incl. Orthologs, Paralogs, and Xenologs to Gene and Species Trees
    M. Hellmuth, N. Wieseke
    in Evolutionary Biology: Convergent Evolution, Evolution of Complex Traits, Concepts and Methods, Ed. Pierre Pontarotti, Springer, p. 373-392, ISBN 978-3-319-41323-5, 2016
    [publisher's page][arXiv]
  3. Habilitation Thesis (2015)
    On the Decomposition and Reconstruction of Discrete Structures: Characterization, Approximation and Computation [Extended Abstract]
  4. PhD-Thesis (2010) "grade: summa cum laude"
    Local Prime Factor Decomposition of Approximate Strong Product Graphs [pdf]
  5. Diploma Thesis (2006)
    Konstruktion von Worten mit Matchingeigenschaften und Anwendung auf das RNA Design [pdf]

    6. JOURNALS
  6. Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs
    M. Hellmuth, G.E. Scholz
    Discrete Appl Math, 343, 25-43, 2024
    [publisher's page] [arXiv]
  7. Relative Timing Information and Orthology in Evolutionary Scenarios
    D. Schaller, T. Hartmann, M. Lafond, N. Wieseke, M. Hellmuth, P.F. Stadler
    Algorithms for Molecular Biology, 18(1), 16, 2023
    [publisher's page] [arXiv]
  8. Orientation of Fitch Graphs and Detection of Horizontal Gene Transfer in Gene Trees
    D. Schaller, M. Hellmuth, P.F. Stadler,
    SIAM J. Discrete Math, 37, 3, 2172--2207, 2023
    [publisher's page] [arXiv]
  9. Clustering Systems of Phylogenetic Networks
    M. Hellmuth, D. Schaller, P.F. Stadler,
    Theory in Biosciences, 142, 301-358, 2023
    [publisher's page] [arXiv]
  10. Injective split systems
    K.T. Huber, M. Hellmuth, V. Moulton, G.E. Scholz, P.F. Stadler,
    Graphs and Combinatorics, Springer, 38, 4, 65, 2023
    [publisher's page] [arXiv]
  11. Construction of k-matchings in graph products
    A. Lindeberg, M. Hellmuth
    Art Discrete Appl. Math., 6, #2.02, DOI 10.26493/2590-9770.1462.b03, 2023
    [publisher's page] [arXiv]
  12. Quasi-Best Match Graphs
    A. Korchmaro, D. Schaller, M. Hellmuth, P.F. Stadler,
    Discr. Appl. Math, 331, 104-125, 2023
    [publisher's page] [arXiv]
  13. Hierarchical and Modularly-Minimal Vertex Colorings
    D.I. Valdivia, M. Geiß, M. H.Rosales, P.F. Stadler, M. Hellmuth
    Art Discrete Appl. Math., 6, #2.01, DOI 10.26493/2590-9770.1422.9b6, 2023
    [publisher's page] [arXiv]
  14. Planar Median Graphs and Cubesquare-Graphs
    C.R. Seemann, V. Moulton, P.F. Stadler, M. Hellmuth
    Discr. Appl. Math, 331, 38-58, 2023
    [publisher's page] [arXiv]
  15. From Modular Decomposition Trees to Level-1 networks: Pseudo-Cographs, Polar-Cats and Prime Polar-Cats
    M. Hellmuth, G.E. Scholz
    Discr. Appl. Math, 321, 179-219, 2022
    [publisher's page] [arXiv]
  16. AsymmeTree: A Flexible Python Package for the Simulation of Complex Gene Family Histories
    D. Schaller, M. Hellmuth, P.F. Stadler,
    Software, 1(3), 276-298, 2022
    [publisher's page]
  17. Complete Edge-Colored Permutation Graphs
    T. Hartmann, M. Bannach, M. Middendorf, P.F. Stadler, N. Wieseke, M. Hellmuth
    Advances in Applied Mathematics, 139, 102377, 2022
    [publisher's page] [arXiv]
  18. Compatibility of Partitions, Hierarchies, and Split Systems
    M. Hellmuth, D. Schaller, P.F. Stadler,
    Discr. Appl. Math, 314, 265-283, 2022
    [publisher's page] [arXiv]
  19. Best Match Graphs with Binary Trees
    D. Schaller, M. Geiß, M. Hellmuth, P.F. Stadler,
    IEEE/ACM Trans Comput Biol Bioinform, DOI:10.1109/TCBB.2022.3143870, 2022
    [publisher's page] [arXiv]
  20. Generic Context-Aware Group Contributions
    C. Flamm, M. Hellmuth, D. Merkle, N. Nøjgaard, P.F. Stadler
    IEEE/ACM Trans Comput Biol Bioinform, 18(1), 429-442 2022
    [publisher's page]
  21. From Modular Decomposition Trees to Rooted Median Graphs
    C. Bruckmann, P.F. Stadler, M. Hellmuth
    Discr. Appl. Math, 310, 1-9, 2022
    [publisher's page] [arXiv]
  22. A Simpler Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set
    D. Schaller, M. Hellmuth, P.F. Stadler,
    Algorithms for Molecular Biology, 16, 23, 2021
    [publisher's page] [arXiv]
  23. Least resolved trees for two-colored best match graphs
    D. Schaller, M. Geiß, M. Hellmuth, P.F. Stadler
    Journal of Graph Algorithms and Applications, 25, 1, 397-416, 2021
    [publisher's page] [arXiv]
  24. Heuristic Algorithms for Best Match Graph Editing
    D. Schaller, M. Geiß, M. Hellmuth, P.F. Stadler
    Algorithms for Molecular Biology, 16, 19, 2021
    [publisher's page] [arXiv]
  25. Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry
    M. Hellmuth, W. Fontana, D. Merkle, N. Nøjgaard
    Journal of Computational Biology, 28, 7, 701-715, 2021
    [publisher's page] [preprint]
  26. Indirect Identification of Horizontal Gene Transfer
    D. Schaller, M. Lafond, P.F. Stadler, N. Wieseke, M. Hellmuth
    J. Math. Biology, 83, 10, DOI:10.1007/s00285-021-01631-0, 2021
    [publisher's page] [arXiv]
  27. Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees
    M. Hellmuth, Carsten R. Seemann, P.F. Stadler
    Discrete Mathematics & Theoretical Computer Science, 23, 1, 2021
    [publisher's page] [arXiv]
  28. Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
    D. Schaller, M. Geiß, M. Hellmuth, P.F. Stadler
    Algorithms, 14,4, 110, 2021
    [publisher's page] [arXiv]
  29. Corrigendum to "Best Match Graphs"
    D. Schaller, M. Geiß, E. Chavez, M. Gonzalez, A. Lopez, D. Valdivia, M. H. Rosales, B.M.R. Stadler, Marc Hellmuth, P.F. Stadler
    J. Math. Biology, 82, 47, 2021
    [publisher's page] [arXiv]
  30. Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs
    D. Schaller, M. Geiß, P.F. Stadler, M. Hellmuth
    J. Math. Biology, 82, 20, 82(3), 1-64, 2021
    [publisher's page] [arXiv]
  31. Complexity of Modification Problems for Best Match Graphs
    D. Schaller, P.F. Stadler, M. Hellmuth
    Theoretical Computer Science, 865, 63-84, 2021
    [publisher's page] [arXiv]
  32. M. Lafond, M. Hellmuth
    Reconstruction of time-consistent species trees
    Algorithms for Molecular Biology, 15, 16, 1-27, 2020
    [publisher's page][arXiv]
  33. From pairs of most similar sequences to phylogenetic best matches
    P.F. Stadler, M. Geiß, D. Schaller, A. Lopez, M.G. Laffitte, D.I. Valdivia, M. Hellmuth, M. H.Rosales
    Algorithms for Molecular Biology, 15, 5, 1-20, 2020
    [publisher's page][arXiv]
  34. Generalized Fitch Graphs II: Sets of Binary Relations that are explained by Edge-labeled Trees
    M. Hellmuth,  Carsten R. Seemann, P.F. Stadler
    Discr. Appl. Math, 283, 495-511, 2020
    [publisher's page][arXiv]
  35. A. Fritz, M. Hellmuth, P.F. Stadler, N. Wieseke
    Cograph Editing: Merging Modules is equivalent to Editing P4's
    Art Discrete Appl. Math., 3, #P2.01, 2020
    [publisher's page][arXiv]
  36. M. Geiß, M. Gonzalez Laffitte, A. Lopez  S anchez, D. Valdivia, M. H. Rosales, Marc Hellmuth, P.F. Stadler
    Best Match Graphs and Reconciliation of Gene Trees with SpeciesTrees
    J. Math. Biology, 80, 1459-1495, 2020
    [publisher's page][arXiv]
  37. M. Hellmuth,  M. Geiß, P.F. Stadler
    Complexity of Modification Problems for Reciprocal Best Match Graphs
    Theoretical Computer Science, 809, 384 - 393, 2020
    [publisher's page][preprint]
  38. M. Geiß, P.F. Stadler, M. Hellmuth
    Reciprocal Best Match Graphs
    J. Math. Biology, 80(3), 865-953, 2020
    [publisher's page][arXiv]
  39. M. Hellmuth
    Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees
    Discr. Appl. Math, 276, 1-11 2019
    [publisher's page][arXiv]
  40. M. Hellmuth, K.T. Huber, V. Moulton
    Reconciling Event-Labeled Gene Trees with MUL-trees and Species Networks
    J. Math. Biology, 79(5), 1885-1925, 2019
    [publisher's page][preprint]
  41. M. Hellmuth, C.R. Seemann
    Alternative Characterizations of Fitch's Xenology Relation
    J. Math. Biology, 79(3), 969-986, 2019
    [publisher's page][arXiv]
  42. M. Geiß, E. Chavez, M. Gonzalez, A. Lopez, D. Valdivia, M. H. Rosales, B.M.R. Stadler, Marc Hellmuth, P.F. Stadler
    Best Match Graphs
    J. Math. Biology, 78(7), 2015-2057, 2019
    [publisher's page] [Corrigendum]
  43. M. Geiß, J. Anders, P. F. Stadler, N. Wieseke, M. Hellmuth
    Reconstructing Gene Trees From Fitch's Xenology Relation
    J. Math. Biology,  77(5), 1459-1491, 2018
    [publisher's page][arXiv]
  44. T. Siems, M. Hellmuth, V. Liebscher
    Simultaneous Credible Regions for Multiple Changepoint Locations
    J. Comp. Graph. Statistics, 28(2), 290-298 2018
    [publisher's page][arXiv]
  45. M. Geiß, M Hellmuth, Y. Long, Peter F. Stadler
    A Short Note on Undirected Fitch Graphs
    Art Discrete Appl. Math., 1, 1, #P1.08, 2018
    [publisher's page][arXiv]
  46. M. Hellmuth, C.R. Seemann
    The Matroid Structure of Representative Triple Sets and Triple-Closure Computation
    Europ. J. of Combinatorics, 70, 384-407, 2018
    [publisher's page][arXiv]
  47. N. Nøjgaard, M. Geiß, D. Merkle, P. F. Stadler, N. Wieske, M. Hellmuth
    Time-Consistent Reconciliation Maps and Forbidden Time Travel
    Algorithms for Molecular Biology, 13, 1, 2,  2018
    [publisher's page][biorXiv]
  48. M. Hellmuth, M. Hernandez-Rosales, Y. Long, Peter F. Stadler
    Inferring Phylogenetic Trees from the Knowledge of Rare Evolutionary Events
    J. Math. Biology, 76, 7, 1623-1653, 2018
    [publisher's page][arXiv]
  49. M. Hellmuth, N. Wieseke
    On Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions
    J. Combinatorial Optimization, 36, 2, 591-616, 2018
    [publisher's page] [arXiv]
  50. M. Hellmuth
    Biologically Feasible Gene Trees, Reconciliation Maps and Informative Triples
    Algorithms for Molecular Biology, 12, 1, 23, 2017
    [publisher's page][arXiv]
  51. R. Batra , N. Alcaraz , K. Gitzhofer , J. Pauling , H. Ditzel , M. Hellmuth , M. List, J. Baumbach
    On the performance of de novo pathway enrichment
    Nature Partner Journals Systems Biology and Applications, 3, 1, 6, 2017
    [publisher's page]
  52. M. Hellmuth, P.F. Stadler, N. Wieseke
    The Mathematics of Xenology: Di-cographs, Symbolic Ultrametrics, 2-structures and Tree-representable Systems of Binary Relations
    J. Math. Biology, 75, 1, 199-237, 2017
    [publisher's page][arXiv]
  53. R.H. Hammack, M. Hellmuth, L. Ostermeier, P.F. Stadler
    Associativity and non-associativity of some hypergraph products
    Mathematics in Computer Science, 10, 3, 403-408, 2016
    [publisher's page] [arXiv]
  54. M. Hellmuth, F. Lehner
    Fast Factorization of Cartesian products of (Directed) Hypergraphs
    Theor. Comp. Sci, 615, 1-11, 2016
    [publisher's page] [arXiv]
  55. S. Berkemer, R. Chaves, A. Fritz, M. Hellmuth, M. Hernandez-Rosales and P. F. Stadler
    Spiders can be recognized by counting their legs
    Mathematics in Computer Science, 9, 4, 437-441, 2015
    [publisher's page] [arXiv]
  56. M. Hellmuth, T. Marc, L. Ostermeier, P. F. Stadler
    The Relaxed Square Property
    Australasian Journal of Combinatorics, 62, 3, 240-270, 2015
    [publisher's page] [arXiv]
  57. M. Hellmuth, N. Wieseke, M. Lechner, H.-P. Lenhof, M. Middendorf, P. F. Stadler
    Phylogenomics with Paralogs
    Proceedings of the National Academy of Sciences (PNAS), 112, 7, 2058-2063, 2015
    [publisher's page] [ParaPhylo]
  58. M. Hellmuth, T. Marc
    On the Cartesian Skeleton and the Factorization of the Strong Product of Digraphs
    J. Theor. Comp. Sci, 565, 0, 16-29, 2015
    [publisher's page] [arXiv]
  59. M. Hellmuth, W. Imrich, T. Kupka
    Fast Recognition of Partial Star Products and Quasi Cartesian Products
    Ars Math. Contemporanea, 9, 2, 233-252, 2015
    [publisher's page] [arXiv]
  60. M. H.-Rosales, M. Hellmuth, N. Wieseke, P.F. Stadler,
    Simulation of gene family histories,
    BMC Bioinformatics, 15, Suppl 3, A8, 2014
    [publisher's page]
  61. M. Hellmuth, M. Noll, L. Ostermeier
    Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms
    Discrete Applied Mathematics, 171, 60-71, 2014
    [publisher's page] [arXiv]
  62. M. Hellmuth, L. Ostermeier, P.F. Stadler
    Unique Square Property, Equitable Partitions, and Product-like Graphs,
    Discrete Mathematics, 320, 0, 92-103, 2014
    [publisher's page] [arXiv]
  63. M. Hellmuth, J. Leydold, P.F. Stadler,
    Convex Cycle Bases,
    Ars Math. Contemporanea, 7, 1, 123-140, 2014
    [publisher's page]
  64. M. Hellmuth, W. Imrich, T. Kupka
    Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
    Mathematics in Computer Science, 7, 3, 255-273, 2013
    [publisher's page] [arXiv]
  65. M. Hellmuth
    On the Complexity of Recognizing S-composite and S-prime Graphs,
    Discrete Appl. Math., 161, 7-8, 1006-1013, 2013
    [publisher's page]  [arXiv]
  66. M. Hellmuth, M. H.-Rosales, K. T. Huber, V. Moulton, P.F. Stadler, N. Wieseke,
    Orthology Relations, Symbolic Ultrametrics, and Cographs,
    J. Math. Biol., 66, 1-2, 399-420, 2013
    [publisher's page] [preprint]
  67. M. H.-Rosales, M. Hellmuth, K. T. Huber, V. Moulton, N. Wieseke, P.F. Stadler,
    From Event-Labeled Gene Trees to Species Trees,
    BMC Bioinformatics, 13, Suppl 19, S6, 2012
    [publisher's page] [preprint]
  68. L. Gringmann, M. Hellmuth, P.F. Stadler,
    The Cartesian Product of Hypergraphs,
    Journal of Graph Theory, 70, 2, 180-196, 2012
    [publisher's page]
  69. M. Hellmuth, L. Ostermeier, P.F. Stadler,
    A Survey on Hypergraph Products,
    Mathematics in Computer Science, 6, 1, 1-32, 2012
    [publisher's page][arXiv - ERRATUM]
  70. M. Hellmuth, P.J. Ostermeier, P.F. Stadler,
    Minimum Cycle Bases of Lexicographic Products,
    Ars Math. Contemporanea, 5, 2, 223-234, 2012
    [publisher's page]
  71. M. Hellmuth, L. Gringmann, P.F. Stadler,
    Diagonalized Cartesian Products of S-prime graphs are S-prime,
    Discrete Mathematics, 312, 1, 74-80, 2012
    [publisher's page]
  72. M. Hellmuth
    A Local Prime Factor Decomposition Algorithm,
    Discrete Mathematics, 311, 12, 944-965, 2011
    [publisher's page][arXiv]
  73. C. Heine, S. Jaenicke, M. Hellmuth, P.F. Stadler, G. Scheuermann,
    Visualization of Graph Products,
    IEEE Transactions on Visualization and Computer Graphics, 16, 6, 1082 - 1089, 2010
    [publisher's page] [preprint]
  74. M. Hellmuth, D. Merkle, M. Middendorf,
    Extended Shapes for the Combinatorial Design of RNA Sequences,
    Int. J. of Computational Biology and Drug Design, 2, 4, 371 - 384, 2009
    [publisher's page]
  75. M. Hellmuth, W. Imrich, W. Kloeckl, P.F. Stadler,
    Local algorithms for the prime factorization of strong product graphs,
    Mathematics in Computer Science, 2009, 2, 4, 653-682, 2009
    [publisher's page][arXiv]
  76. P.J. Ostermeier, M. Hellmuth, K. Klemm, J. Leydold, P.F. Stadler,
    A Note on Quasi-Robust Cycle Bases,
    Ars Math. Contemporanea, 2, 2, 231-240, 2009
    [publisher's page]
  77. T. Biyikoglu, M. Hellmuth, J. Leydold,
    Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences,
    Elec. J. Lin. Alg, 18, 202-210, 2009.
    [publisher's page]
  78. M. Hellmuth, W. Imrich, W. Kloeckl, P.F. Stadler,
    Approximate graph products,
    Europ. J. of Combinatorics, 30, 5, Part Special Issue on Metric Graph Theory, 1119-1133, 2009.
    [publisher's page]

    79. CONFERENCE PROCEEDINGS
  79. REvolutionh-tl: Reconstruction of Evolutionary Histories tool
    J.A. Ramirez-Rafael, A. Korchmaros, A. Lopez-Sanchez, A.A. Espana-Tinajero, M. Hellmuth, P.F. Stadler and M. Hernandez-Rosales
    21st Annual Satellite Conference of RECOMB on Comparative Genomics (RECOMB-CG 2024), Springer Nature, pp 89-109, 2024
    [publisher's page]
  80. Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
    A.V. Shanavas, M. Changat, M. Hellmuth, P.F. Stadler
    10th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM) Lecture Notes in Computer Science, vol 14508. Springer, pp 148-161, 2024
    [publisher's page] [arXiv]
  81. Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs
    M. Hellmuth, G.E. Scholz
    Computing and Combinatorics (COCOON 2023), Lecture Notes in Computer Science, vol 14422. Springer, pp 115-126, 2024
    [publisher's page] [arXiv]
  82. Fitch Graph Completion
    M. Hellmuth, P.F. Stadler, S. Thekkumpadan Puthiyaveedu
    Computing and Combinatorics (COCOON 2023), Lecture Notes in Computer Science, vol 14422. Springer, pp 225-237, 2024
    [publisher's page] [arXiv]
  83. Combining Orthology and Xenology Data in a Common Phylogenetic Tree
    M. Hellmuth, M. Michel, N. Nøjgaard, D. Schaller, P.F. Stadler
    Advances in Bioinformatics and Computational Biology (BSB2021)
    Lecture Notes in Computer Science, vol 13063, Springer, pp 53-64, 2021
    [publisher's page] [arXiv]
  84. Best Match Graphs with Binary Trees
    D. Schaller, M. Geiß, M. Hellmuth, P.F. Stadler
    Algorithms for Computational Biology. AlCoB 2021. Lecture Notes in Computer Science, vol 12715. Springer, Cham. https://doi.org/10.1007/978-3-030-74432-8_6, 2021
    [publisher's page][arXiv]
  85. M. Hellmuth, D. Merkle, N. Nøjgaard
    Atom Tracking Using Cayley Graphs
    16th International Symposium on Bioinformatics Research and Applications (ISBRA 2020)
    Lecture Notes in Computer Science, vol 12304, Springer, pp 406-415, 2020
    [publisher's page][preprint]
  86. J.L. Andersen, M. Hellmuth, D. Merkle, N. Nøjgaard, M. Peressotti
    A Graph-Based Tool to Embed the pi-Calculus into a Computational DPO Framework
    46th International Conference on Current Trends in Theory and Practice of Computer Science
    Doctoral Student Research Forum (SOFSEM), pp 121-132, 2020
    [publisher's page][arXiv]
  87. N. Nøjgaard, N. El-Mabrouk, D. Merkle, N. Wieske, M. Hellmuth
    Partial Homology Relations - Satisfiability in terms of Di-Cographs
    24th International Computing and Combinatorics Conference (COCOON),
    Lecture Notes in Computer Science, vol 10976, Springer, pp. 403-415, 2018
    [publisher's page][arXiv]
  88. M. Hellmuth, A.S. Knudsen, M. Kotrbcik, D. Merkle and N. Nøjgaard
    Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings
    Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX), 154-168, 2018
    [publisher's page][preprint]
  89. N. Nøjgaard, M. Geiß, D. Merkle, P. F. Stadler, N. Wieske, M. Hellmuth
    Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps
    17th International Workshop on Algorithms in Bioinformatics (WABI 2017),
    Leibniz International Proceedings in Informatics (LIPIcs), 88, 17:1-17:12, 2017
    [publisher's page][arXiv]
  90. M. Hellmuth and N. Wieseke
    On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions
    In Computing and Combinatorics: 21st International Conference (COCOON),
    Lecture Notes in Computer Science, vol 9198, Springer, pp. 609-623, 2015
    [publisher's page] [arXiv]
  91. T. Ingalls, G. Martius, M. Hellmuth, M. Marz, S.J. Prohaska,
    Converting DNA to Music: ComposAlign,
    German Conference on Bioinformatics 2009:Lecture Notes in Informatics, 93-103, 2009
    [publisher's page] [examples]
  92. M. Hellmuth, D. Merkle, M. Middendorf,
    On the Design of RNA Sequences for Realizing Extended Shapes,
    Bioinformatics, Systems Biology and Intelligent Computing, IJCBS '09, 167-173, 2009
    [publisher's page]


    93. Submitted

  93. Partial Fitch Graphs: Characterization, Satisfiability and Complexity
    M. Hellmuth, A. Korchmaros, J.A. Ramirez-Rafael, B. Schmidt, P.F. Stadler, S. Thekkumpadan Puthiyaveedu1
  94. Solving NP-hard Problems on GaTEx Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
    M. Hellmuth, G.E. Scholz
  95. The Complement of the Djokovic-Winkler Relation
    M. Hellmuth, G.E. Scholz, B.J. Schmidt, S. Thekkumpadan Puthiyaveedu
    [arXiv]
  96. Clusters and Unique Least Common Ancestors in Directed Acyclic Graphs
    A.V. Shanavas, M. Changat, M. Hellmuth, P.F. Stadler
    [preprint]
  97. On a generalization of median graphs: k-median graphs
    M. Hellmuth, S. Thekkumpadan Puthiyaveedu
    [arXiv]
  98. The weighted total cophenetic index: A novel balance index for phylogenetic networks
    L. Knüver, M. Fischer, M. Hellmuth, K. Wicke
    [arXiv]