Marc Hellmuth

938 total citations
54 papers, 352 citations indexed

About

Marc Hellmuth is a scholar working on Molecular Biology, Computational Theory and Mathematics and Genetics. According to data from OpenAlex, Marc Hellmuth has authored 54 papers receiving a total of 352 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Molecular Biology, 27 papers in Computational Theory and Mathematics and 17 papers in Genetics. Recurrent topics in Marc Hellmuth's work include Genomics and Phylogenetic Studies (18 papers), Advanced Graph Theory Research (15 papers) and Genome Rearrangement Algorithms (9 papers). Marc Hellmuth is often cited by papers focused on Genomics and Phylogenetic Studies (18 papers), Advanced Graph Theory Research (15 papers) and Genome Rearrangement Algorithms (9 papers). Marc Hellmuth collaborates with scholars based in Germany, United States and Austria. Marc Hellmuth's co-authors include Peter F. Stadler, Nicolas Wieseke, Maribel Hernández-Rosales, Martin Middendorf, Vincent Moulton, Katharina T. Huber, Hans‐Peter Lenhof, Marcus Lechner, Josef Leydold and Henrik J. Ditzel and has published in prestigious journals such as Proceedings of the National Academy of Sciences, BMC Bioinformatics and IEEE Transactions on Visualization and Computer Graphics.

In The Last Decade

Marc Hellmuth

49 papers receiving 336 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Marc Hellmuth Germany	10	183	137	99	58	48	54	352
Stéphane Vialette France	11	203 1.1×	211 1.5×	81 0.8×	122 2.1×	80 1.7×	37	459
Alexandru I. Tomescu Finland	11	236 1.3×	121 0.9×	44 0.4×	147 2.5×	34 0.7×	68	437
Petr Kolman Czechia	12	49 0.3×	173 1.3×	49 0.5×	79 1.4×	117 2.4×	35	298
Jens Gramm Germany	13	146 0.8×	298 2.2×	66 0.7×	157 2.7×	156 3.3×	24	475
K. Yu. Gorbunov Russia	7	106 0.6×	81 0.6×	84 0.8×	47 0.8×	31 0.6×	31	200
Grzegorz Kubicki United States	9	49 0.3×	83 0.6×	31 0.3×	47 0.8×	56 1.2×	27	225
Ewa Kubicka United States	7	45 0.2×	106 0.8×	31 0.3×	31 0.5×	40 0.8×	20	232
Irena Rusu France	9	189 1.0×	99 0.7×	243 2.5×	116 2.0×	27 0.6×	45	365
Sylvain Guillemot France	8	89 0.5×	88 0.6×	49 0.5×	32 0.6×	35 0.7×	15	189
Mathieu Raffinot France	11	250 1.4×	131 1.0×	72 0.7×	488 8.4×	93 1.9×	28	666

Countries citing papers authored by Marc Hellmuth

Since Specialization

Citations

This map shows the geographic impact of Marc Hellmuth's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Marc Hellmuth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marc Hellmuth more than expected).

Fields of papers citing papers by Marc Hellmuth

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marc Hellmuth. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Marc Hellmuth. The network helps show where Marc Hellmuth may publish in the future.

Co-authorship network of co-authors of Marc Hellmuth

This figure shows the co-authorship network connecting the top 25 collaborators of Marc Hellmuth. A scholar is included among the top collaborators of Marc Hellmuth based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Marc Hellmuth. Marc Hellmuth is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Hellmuth, Marc, et al.. (2025). Solving NP-hard problems on GaTEx graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets. Theoretical Computer Science. 1037. 115157–115157. 2 indexed citations

Fischer, Mareike, et al.. (2024). The weighted total cophenetic index: A novel balance index for phylogenetic networks. Discrete Applied Mathematics. 359. 89–142. 1 indexed citations

Hellmuth, Marc, et al.. (2024). On a generalization of median graphs: k-median graphs. Ars Mathematica Contemporanea. 25(3). #P3.06–#P3.06.

Hellmuth, Marc & Peter F. Stadler. (2024). The Theory of Gene Family Histories. Methods in molecular biology. 2802. 1–32. 1 indexed citations

Moulton, Vincent, et al.. (2023). Planar median graphs and cubesquare-graphs. Discrete Applied Mathematics. 331. 38–58. 1 indexed citations

Hellmuth, Marc, et al.. (2023). Injective Split Systems. Graphs and Combinatorics. 39(4).

Stadler, Bärbel M. R., et al.. (2019). Best match graphs. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 7 indexed citations

Hellmuth, Marc, et al.. (2018). The matroid structure of representative triple sets and triple-closure computation. European Journal of Combinatorics. 70. 384–407. 1 indexed citations

Merkle, Daniel, et al.. (2018). Time-consistent reconciliation maps and forbidden time travel. Algorithms for Molecular Biology. 13(1). 2–2. 2 indexed citations

10.

Hellmuth, Marc, et al.. (2017). Inferring phylogenetic trees from the knowledge of rare evolutionary events. Journal of Mathematical Biology. 76(7). 1623–1653. 3 indexed citations

11.

Hellmuth, Marc. (2017). Biologically feasible gene trees, reconciliation maps and informative triples. Algorithms for Molecular Biology. 12(1). 23–23. 11 indexed citations

12.

Hellmuth, Marc, et al.. (2014). On the Cartesian skeleton and the factorization of the strong product of digraphs. Theoretical Computer Science. 565. 16–29. 2 indexed citations

13.

Hellmuth, Marc, et al.. (2014). Strong products of hypergraphs: Unique prime factorization theorems and algorithms. Discrete Applied Mathematics. 171. 60–71. 3 indexed citations

14.

Hellmuth, Marc, Josef Leydold, & Peter F. Stadler. (2013). Convex cycle bases. Ars Mathematica Contemporanea. 7(1). 123–140. 6 indexed citations

15.

Hellmuth, Marc. (2012). On the complexity of recognizing S-composite and S-prime graphs. Discrete Applied Mathematics. 161(7-8). 1006–1013. 3 indexed citations

16.

Hellmuth, Marc. (2011). A local prime factor decomposition algorithm. Discrete Mathematics. 311(12). 944–965. 7 indexed citations

17.

Jänicke, Stefan, Christian Heine, Marc Hellmuth, Peter F. Stadler, & Gerik Scheuermann. (2010). Visualization of Graph Products. IEEE Transactions on Visualization and Computer Graphics. 16(6). 1082–1089. 10 indexed citations

18.

Ingalls, Todd, et al.. (2009). Converting DNA to Music: ComposAlign.. 93–103. 1 indexed citations

19.

Hellmuth, Marc, Daniel Merkle, & Martin Middendorf. (2009). Extended shapes for the combinatorial design of RNA sequences. International Journal of Computational Biology and Drug Design. 2(4). 371–371. 6 indexed citations

20.

Hellmuth, Marc, et al.. (2008). Approximate graph products. European Journal of Combinatorics. 30(5). 1119–1133. 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact