You are here
Marc Hellmuth - Publications
Personal | Research | Publications | Teaching | Software | Links
For the latest update go to GoTo New Homepage
submitted
-
M. Hellmuth and N. Wieseke
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions
(submitted: Lecture Note in Computer Science series (LNCS Cocoon 2015), 2015 )
[arXiv]
-
S. Berkemer, R. Chaves, A. Fritz, M. Hellmuth, M. Hernandez-Rosales and P. F. Stadler
Spiders can be recognized by counting their legs
(submitted: Mathematics in Computer Science, 2014)
[arXiv]
-
M. Hellmuth, T. Marc, L. Ostermeier, P. F. Stadler
The Relaxed Square Property
(submitted: Australasian Journal of Combinatorics, 2014)
[arXiv]
published (peer-reviewed)
-
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]
-
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]
-
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]
-
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]
-
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]
-
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]
-
M. Hellmuth, J. Leydold, P.F. Stadler,
Convex Cycle Bases,
Ars Math. Contemporanea, 7, 1, 123-140, 2014
[publisher's page]
-
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]
-
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]
-
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]
-
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]
-
L. Gringmann, M. Hellmuth, P.F. Stadler,
The Cartesian Product of Hypergraphs,
Journal of Graph Theory, 70, 2, 180-196, 2012
[publisher's page]
-
M. Hellmuth, L. Ostermeier, P.F. Stadler,
A Survey on Hypergraph Products,
Math. Comp. Sci., 6, 1, 1-32, 2012
[publisher's page]
-
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]
-
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]
-
M. Hellmuth
A Local Prime Factor Decomposition Algorithm,
Discrete Mathematics, 311, 12, 944-965, 2011
[publisher's page]
-
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]
-
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]
-
M. Hellmuth, W. Imrich, W. Kloeckl, P.F. Stadler,
Local algorithms for the prime factorization of strong product graphs,
Math. Comput. Sci, 2009, 2, 4, 653-682, 2009
[publisher's page]
-
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
[pdf]
-
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
[abstract] [supplement]
-
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]
-
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.
[pdf]
-
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]
non-peer-reviewed
-
M. Hernandez-Rosales, N. Wieseke, M. Hellmuth, P.F. Stadler,
Simulation of Gene Family Histories
Research Report Nr. 12-017, Department of Computer Science, University Leipzig, 2011
[pdf]
-
T. Biyikoglu, M. Hellmuth, J. Leydold,
Largest Laplacian Eigenvalue and Degree Sequences of Trees,
Research Report Series / Department of Statistics and Mathematics, Nr. 64, 2008.
[pdf]
Theses
-
PhD Thesis
Local Prime Factor Decomposition of Approximate Strong Product Graphs [pdf]
-
Diploma Thesis
Konstruktion von Worten mit Matchingeigenschaften und Anwendung auf das RNA Design [pdf]