Marc Hellmuth - RankMe

144 papers A 1C 1Misc 2Journal 129Unranked 10

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Inferring DAGs and Phylogenetic Networks from Least Common Ancestors. CoRR Anna Lindeberg, Anton Alfonsson, Vincent Moulton, Guillaume E. Scholz, Marc Hellmuth
2025	J	`jnl`	On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs. CoRR Johannes B. S. Petersen, Akbar Davoodi, Thomas Gärtner, Marc Hellmuth, Daniel Merkle
2025	J	`jnl`	On a generalization of median graphs: k-median graphs. Ars Math. Contemp. Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu
2025	J	`jnl`	Orthology and Near-Cographs in the Context of Phylogenetic Networks. CoRR Anna Lindeberg, Guillaume E. Scholz, Nicolas Wieseke, Marc Hellmuth
2025	J	`jnl`	Orthology and near-cographs in the context of phylogenetic networks. Algorithms Mol. Biol. Anna Lindeberg, Guillaume E. Scholz, Nicolas Wieseke, Marc Hellmuth
2025	J	`jnl`	Solving NP-hard problems on GaTEx graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets. Theor. Comput. Sci. Marc Hellmuth, Guillaume E. Scholz
2025	J	`jnl`	The complement of the Djoković-Winkler relation. Discret. Math. Marc Hellmuth, Bruno J. Schmidt, Guillaume E. Scholz, Sandhya Thekkumpadan Puthiyaveedu
2024	J	`jnl`	Characterizing and Transforming DAGs within the I-LCA Framework. CoRR Marc Hellmuth, Anna Lindeberg
2024	J	`jnl`	Nesting of Touching Polygons. CoRR Carsten R. Seemann, Peter F. Stadler, Marc Hellmuth
2024	J	`jnl`	Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective. CoRR Anna Lindeberg, Guillaume E. Scholz, Marc Hellmuth
2024	—	`conf`	REvolutionH-tl: Reconstruction of Evolutionary Histories tool. RECOMB-CG José Antonio Ramírez-Rafael, Annachiara Korchmaros, Katia Aviña-Padilla, Alitzel López Sánchez, Andrea Arlette España-Tinajero, Marc Hellmuth, Peter F. Stadler, Maribel Hernández-Rosales
2024	J	`jnl`	Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs. Discret. Appl. Math. Marc Hellmuth, Guillaume E. Scholz
2024	J	`jnl`	Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints. CoRR Anna Lindeberg, Marc Hellmuth
2024	J	`jnl`	The weighted total cophenetic index: A novel balance index for phylogenetic networks. Discret. Appl. Math. Linda Knüver, Mareike Fischer, Marc Hellmuth, Kristina Wicke
2024	—	`conf`	Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs. CALDAM Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth, Peter F. Stadler
2023	J	`jnl`	Best Match Graphs With Binary Trees. IEEE ACM Trans. Comput. Biol. Bioinform. David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2023	J	`jnl`	Clustering systems of phylogenetic networks. Theory Biosci. Marc Hellmuth, David Schaller, Peter F. Stadler
2023	—	`conf`	Fitch Graph Completion. COCOON (2) Marc Hellmuth, Peter F. Stadler, Sandhya Thekkumpadan Puthiyaveedu
2023	J	`jnl`	Fitch Graph Completion. CoRR Marc Hellmuth, Peter F. Stadler, Sandhya Thekkumpadan Puthiyaveedu
2023	J	`jnl`	Injective Split Systems. Graphs Comb. Marc Hellmuth, Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz, Peter F. Stadler
2023	—	`conf`	Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. COCOON (1) Marc Hellmuth, Guillaume E. Scholz
2023	J	`jnl`	Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs. CoRR Marc Hellmuth, Guillaume E. Scholz
2023	J	`jnl`	On a generalization of median graphs: k-median graphs. CoRR Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu
2023	J	`jnl`	Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees. SIAM J. Discret. Math. David Schaller, Marc Hellmuth, Peter F. Stadler
2023	J	`jnl`	Planar median graphs and cubesquare-graphs. Discret. Appl. Math. Carsten R. Seemann, Vincent Moulton, Peter F. Stadler, Marc Hellmuth
2023	J	`jnl`	Quasi-best match graphs. Discret. Appl. Math. Annachiara Korchmaros, David Schaller, Marc Hellmuth, Peter F. Stadler
2023	J	`jnl`	Relative timing information and orthology in evolutionary scenarios. Algorithms Mol. Biol. David Schaller, Tom Hartmann, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2023	J	`jnl`	The Complement of the Djokovic-Winkler Relation. CoRR Marc Hellmuth, Bruno J. Schmidt, Guillaume E. Scholz, Sandhya Thekkumpadan Puthiyaveedu
2023	J	`jnl`	The Theory of Gene Family Histories. CoRR Marc Hellmuth, Peter F. Stadler
2023	J	`jnl`	Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs. CoRR Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth, Peter F. Stadler
2022	J	`jnl`	AsymmeTree: A Flexible Python Package for the Simulation of Complex Gene Family Histories. Softw. David Schaller, Marc Hellmuth, Peter F. Stadler
2022	J	`jnl`	Clustering Systems of Phylogenetic Networks. CoRR Marc Hellmuth, David Schaller, Peter F. Stadler
2022	J	`jnl`	Compatibility of partitions with trees, hierarchies, and split systems. Discret. Appl. Math. Marc Hellmuth, David Schaller, Peter F. Stadler
2022	J	`jnl`	Complete edge-colored permutation graphs. Adv. Appl. Math. Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2022	J	`jnl`	Construction of k-matchings in graph products. Art Discret. Appl. Math. Anna Lindeberg, Marc Hellmuth
2022	J	`jnl`	From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats. Discret. Appl. Math. Marc Hellmuth, Guillaume E. Scholz
2022	J	`jnl`	From modular decomposition trees to rooted median graphs. Discret. Appl. Math. Carmen Bruckmann, Peter F. Stadler, Marc Hellmuth
2022	J	`jnl`	Generic Context-Aware Group Contributions. IEEE ACM Trans. Comput. Biol. Bioinform. Christoph Flamm, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Peter F. Stadler
2022	J	`jnl`	Hierarchical and modularly-minimal vertex colorings. Art Discret. Appl. Math. Dulce I. Valdivia, Maribel Hernández-Rosales, Manuela Geiß, Peter F. Stadler, Marc Hellmuth
2022	J	`jnl`	Relative Timing Information and Orthology in Evolutionary Scenarios. CoRR David Schaller, Tom Hartmann, Manuel Lafond, Nicolas Wieseke, Marc Hellmuth, Peter F. Stadler
2022	J	`jnl`	Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs. CoRR Marc Hellmuth, Guillaume E. Scholz
2021	J	`jnl`	A Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set. CoRR David Schaller, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set. Algorithms Mol. Biol. David Schaller, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs. Algorithms David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs. CoRR David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2021	—	`conf`	Best Match Graphs with Binary Trees. AlCoB David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry. CoRR Nikolai Nøjgaard, Walter Fontana, Marc Hellmuth, Daniel Merkle
2021	J	`jnl`	Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry. J. Comput. Biol. Nikolai Nøjgaard, Walter Fontana, Marc Hellmuth, Daniel Merkle
2021	—	`conf`	Combining Orthology and Xenology Data in a Common Phylogenetic Tree. BSB Marc Hellmuth, Mira Michel, Nikolai N. Nøjgaard, David Schaller, Peter F. Stadler
2021	J	`jnl`	Combining Orthology and Xenology Data in a Common Phylogenetic Tree. CoRR Marc Hellmuth, Mira Michel, Nikolai N. Nøjgaard, David Schaller, Peter F. Stadler
2021	J	`jnl`	Compatibility of Partitions, Hierarchies, and Split Systems. CoRR Marc Hellmuth, David Schaller, Peter F. Stadler
2021	J	`jnl`	Complexity of modification problems for best match graphs. Theor. Comput. Sci. David Schaller, Peter F. Stadler, Marc Hellmuth
2021	J	`jnl`	Construction of k-matchings and k-regular subgraphs in graph products. CoRR Anna Lindeberg, Marc Hellmuth
2021	J	`jnl`	From Modular Decomposition Trees to Rooted Median Graphs. CoRR Carmen Bruckmann, Peter F. Stadler, Marc Hellmuth
2021	J	`jnl`	Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. Discret. Math. Theor. Comput. Sci. Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
2021	J	`jnl`	Heuristic Algorithms for Best Match Graph Editing. CoRR David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	Heuristic algorithms for best match graph editing. Algorithms Mol. Biol. David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	Least resolved trees for two-colored best match graphs. CoRR David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	Least resolved trees for two-colored best match graphs. J. Graph Algorithms Appl. David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	Orientation of Fitch Graphs and Detection of Horizontal Gene Transfer in Gene Trees. CoRR David Schaller, Marc Hellmuth, Peter F. Stadler
2021	J	`jnl`	Planar Median Graphs and Cubesquare-Graphs. CoRR Carsten R. Seemann, Vincent Moulton, Peter F. Stadler, Marc Hellmuth
2021	J	`jnl`	Pseudo-Cographs, Polar-Cats and Level-1 Network Explainable Graphs. CoRR Marc Hellmuth, Guillaume E. Scholz
2020	—	`conf`	A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework. SOFSEM (Doctoral Student Research Forum) Jakob Lykke Andersen, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Marco Peressotti
2020	—	`conf`	Atom Tracking Using Cayley Graphs. ISBRA Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard
2020	J	`jnl`	Best Match Graphs with Binary Trees. CoRR David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
2020	J	`jnl`	Cograph editing: Merging modules is equivalent to editing P_4s. Art Discret. Appl. Math. Adrian Fritz, Marc Hellmuth, Peter F. Stadler, Nicolas Wieseke
2020	J	`jnl`	Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs. CoRR David Schaller, Manuela Geiß, Peter F. Stadler, Marc Hellmuth
2020	J	`jnl`	Complete Edge-Colored Permutation Graphs. CoRR Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2020	J	`jnl`	Complexity of Modification Problems for Best Match Graphs. CoRR David Schaller, Peter F. Stadler, Marc Hellmuth
2020	J	`jnl`	Complexity of modification problems for reciprocal best match graphs. Theor. Comput. Sci. Marc Hellmuth, Manuela Geiß, Peter F. Stadler
2020	J	`jnl`	From pairs of most similar sequences to phylogenetic best matches. Algorithms Mol. Biol. Peter F. Stadler, Manuela Geiß, David Schaller, Alitzel López Sánchez, Marcos E. González Laffitte, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernandez-Rosales
2020	J	`jnl`	Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. CoRR Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
2020	J	`jnl`	Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees. Discret. Appl. Math. Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
2020	J	`jnl`	Hierarchical and Modularly-Minimal Vertex Colorings. CoRR Dulce I. Valdivia, Manuela Geiß, Maribel Hernández-Rosales, Peter F. Stadler, Marc Hellmuth
2020	J	`jnl`	Indirect Identification of Horizontal Gene Transfer. CoRR David Schaller, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2020	J	`jnl`	Reconstruction of time-consistent species trees. Algorithms Mol. Biol. Manuel Lafond, Marc Hellmuth
2019	J	`jnl`	A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework. CoRR Jakob Lykke Andersen, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Marco Peressotti
2019	J	`jnl`	Best Match Graphs and Reconciliation of Gene Trees with Species Trees. CoRR Manuela Geiß, Marcos González, Alitzel López Sánchez, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernández-Rosales, Peter F. Stadler
2019	J	`jnl`	Complexity of Modification Problems for Reciprocal Best Match Graphs. CoRR Marc Hellmuth, Manuela Geiß, Peter F. Stadler
2019	J	`jnl`	Generalized Fitch Relations II: Sets of Binary Relations that are explained by Edge-labeled Trees. CoRR Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
2019	J	`jnl`	Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees. Discret. Appl. Math. Marc Hellmuth
2019	J	`jnl`	Hierarchical Colorings of Cographs. CoRR Dulce I. Valdivia, Manuela Geiß, Marc Hellmuth, Maribel Hernández-Rosales, Peter F. Stadler
2019	J	`jnl`	Reconstruction of time-consistent species trees. CoRR Manuel Lafond, Marc Hellmuth
2018	J	`jnl`	A short note on undirected Fitch graphs. Art Discret. Appl. Math. Marc Hellmuth, Yangjing Long, Manuela Geiß, Peter F. Stadler
2018	J	`jnl`	Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees. CoRR Marc Hellmuth
2018	A	`conf`	Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. ALENEX Marc Hellmuth, Anders S. Knudsen, Michal Kotrbcík, Daniel Merkle, Nikolai Nøjgaard
2018	J	`jnl`	On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions. J. Comb. Optim. Marc Hellmuth, Nicolas Wieseke
2018	Misc	`conf`	Partial Homology Relations - Satisfiability in Terms of Di-Cographs. COCOON Nikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth
2018	J	`jnl`	The matroid structure of representative triple sets and triple-closure computation. Eur. J. Comb. Carsten R. Seemann, Marc Hellmuth
2018	J	`jnl`	Time-consistent reconciliation maps and forbidden time travel. Algorithms Mol. Biol. Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2017	J	`jnl`	A Local Prime Factor Decomposition Algorithm for Strong Product Graphs. CoRR Marc Hellmuth
2017	J	`jnl`	A Short Note on Undirected Fitch Graphs. CoRR Manuela Geiß, Marc Hellmuth, Yangjing Long, Peter F. Stadler
2017	J	`jnl`	A Survey on Hypergraph Products (Erratum). CoRR Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
2017	J	`jnl`	Biologically feasible gene trees, reconciliation maps and informative triples. Algorithms Mol. Biol. Marc Hellmuth
2017	C	`conf`	Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. WABI Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2017	J	`jnl`	Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. CoRR Nikolai Nøjgaard, Manuela Geiß, Peter F. Stadler, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth
2017	J	`jnl`	From event labeled gene trees to species trees. CoRR Maribel Hernandez-Rosales, Marc Hellmuth, Nicolas Wieseke, Katharina T. Huber, Vincent Moulton, Peter F. Stadler
2017	J	`jnl`	From event-labeled gene trees with horizontal gene transfer to species trees. CoRR Marc Hellmuth
2017	J	`jnl`	Local algorithms for the prime factorization of strong product graphs. CoRR Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler
2017	J	`jnl`	Merging Modules is equivalent to Editing P4's. CoRR Marc Hellmuth, Adrian Fritz, Nicolas Wieseke, Peter F. Stadler
2017	J	`jnl`	Partial Orthology, Paralogy and Xenology Relations - Satisfiability in terms of Di-Cographs. CoRR Nikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth
2017	J	`jnl`	Phylogenomics with Paralogs. CoRR Marc Hellmuth, Nicolas Wieseke, Marcus Lechner, Hans-Peter Lenhof, Martin Middendorf, Peter F. Stadler
2017	J	`jnl`	Reconstructing Gene Trees From Fitch's Xenology Relation. CoRR Manuela Geiß, John Anders, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2016	J	`jnl`	Associativity and Non-Associativity of Some Hypergraph Products. Math. Comput. Sci. Richard H. Hammack, Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
2016	J	`jnl`	Construction of Gene and Species Trees from Sequence Data incl. Orthologs, Paralogs, and Xenologs. CoRR Marc Hellmuth, Nicolas Wieseke
2016	J	`jnl`	Fast factorization of Cartesian products of (directed) hypergraphs. Theor. Comput. Sci. Marc Hellmuth, Florian Lehner
2016	J	`jnl`	Inference of Phylogenetic Trees from the Knowledge of Rare Evolutionary Events. CoRR Marc Hellmuth, Maribel Hernandez-Rosales, Yangjing Long, Peter F. Stadler
2016	J	`jnl`	The Mathematics of Xenology: Di-cographs, Symbolic Ultrametrics, 2-structures and Tree-representable Systems of Binary Relations. CoRR Marc Hellmuth, Peter F. Stadler, Nicolas Wieseke
2015	J	`jnl`	Fast Factorization of Cartesian products of Hypergraphs. CoRR Marc Hellmuth, Florian Lehner
2015	J	`jnl`	Fast recognition of partial star products and quasi cartesian products. Ars Math. Contemp. Marc Hellmuth, Wilfried Imrich, Tomas Kupka
2015	Misc	`conf`	On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions. COCOON Marc Hellmuth, Nicolas Wieseke
2015	J	`jnl`	On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions. CoRR Marc Hellmuth, Nicolas Wieseke
2015	J	`jnl`	On Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions. CoRR Marc Hellmuth, Nicolas Wieseke
2015	J	`jnl`	On the Cartesian skeleton and the factorization of the strong product of digraphs. Theor. Comput. Sci. Marc Hellmuth, Tilen Marc
2015	J	`jnl`	Spiders can be Recognized by Counting Their Legs. Math. Comput. Sci. Sarah Berkemer, Ricardo Régis Cavalcante Chaves, Adrian Fritz, Marc Hellmuth, Maribel Hernandez-Rosales, Peter F. Stadler
2015	J	`jnl`	Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s. CoRR Marc Hellmuth, Adrian Fritz, Nicolas Wieseke, Peter F. Stadler
2015	J	`jnl`	The relaxed square property. Australas. J Comb. Marc Hellmuth, Tilen Marc, Lydia Ostermeier, Peter F. Stadler
2014	J	`jnl`	Convex cycle bases. Ars Math. Contemp. Marc Hellmuth, Josef Leydold, Peter F. Stadler
2014	J	`jnl`	On the Cartesian Skeleton and the Factorization of the Strong Product of Digraphs. CoRR Marc Hellmuth, Tilen Marc
2014	J	`jnl`	Simulation of gene family histories. BMC Bioinform. Maribel Hernandez-Rosales, Nicolas Wieseke, Marc Hellmuth, Peter F. Stadler
2014	J	`jnl`	Spiders can be recognized by counting their legs. CoRR Sarah Berkemer, Ricardo Régis Cavalcante Chaves, Adrian Fritz, Marc Hellmuth, Maribel Hernandez-Rosales, Peter F. Stadler
2014	J	`jnl`	Strong products of hypergraphs: Unique prime factorization theorems and algorithms. Discret. Appl. Math. Marc Hellmuth, Manuel Noll, Lydia Ostermeier
2014	J	`jnl`	The Relaxed Square Property. CoRR Marc Hellmuth, Tilen Marc, Lydia Ostermeier, Peter F. Stadler
2014	J	`jnl`	Unique square property, equitable partitions, and product-like graphs. Discret. Math. Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
2013	J	`jnl`	Fast Recognition of Partial Star Products and Quasi Cartesian Products. CoRR Marc Hellmuth, Wilfried Imrich, Tomas Kupka
2013	J	`jnl`	On the complexity of recognizing S-composite and S-prime graphs. Discret. Appl. Math. Marc Hellmuth
2013	J	`jnl`	Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs CoRR Marc Hellmuth, Wilfried Imrich, Tomas Kupka
2013	J	`jnl`	Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs. Math. Comput. Sci. Marc Hellmuth, Wilfried Imrich, Tomas Kupka
2013	J	`jnl`	Square Property, Equitable Partitions, and Product-like Graphs CoRR Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
2013	J	`jnl`	Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms CoRR Marc Hellmuth, Manuel Noll, Lydia Ostermeier
2012	J	`jnl`	A Survey on Hypergraph Products. Math. Comput. Sci. Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
2012	J	`jnl`	Diagonalized Cartesian products of s-prime graphs are s-prime. Discret. Math. Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
2012	J	`jnl`	From event-labeled gene trees to species trees. BMC Bioinform. Maribel Hernandez-Rosales, Marc Hellmuth, Nicolas Wieseke, Katharina T. Huber, Vincent Moulton, Peter F. Stadler
2012	J	`jnl`	Minimum cycle bases of lexicographic products. Ars Math. Contemp. Marc Hellmuth, Philipp-Jens Ostermeier, Peter F. Stadler
2012	J	`jnl`	The Cartesian product of hypergraphs. J. Graph Theory Lydia Ostermeier, Marc Hellmuth, Peter F. Stadler
2011	J	`jnl`	A local prime factor decomposition algorithm. Discret. Math. Marc Hellmuth
2010	—	`—`	Local Prime Factor Decomposition of Approximate Strong Product Graphs: Local Prime Factor Decompositionof Approximate Strong Product Graphs Marc Hellmuth
2010	J	`jnl`	Visualization of Graph Products. IEEE Trans. Vis. Comput. Graph. Stefan Jänicke, Christian Heine, Marc Hellmuth, Peter F. Stadler, Gerik Scheuermann
2009	J	`jnl`	A note on quasi-robust cycle bases. Ars Math. Contemp. Philipp-Jens Ostermeier, Marc Hellmuth, Josef Leydold, Konstantin Klemm, Peter F. Stadler
2009	J	`jnl`	Approximate graph products. Eur. J. Comb. Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler
2009	—	`conf`	Converting DNA to Music: ComposAlign. GCB Todd Ingalls, Georg Martius, Manja Marz, Sonja J. Proshaka, Marc Hellmuth
2009	J	`jnl`	Extended shapes for the combinatorial design of RNA sequences. Int. J. Comput. Biol. Drug Des. Marc Hellmuth, Daniel Merkle, Martin Middendorf
2009	J	`jnl`	Local Algorithms for the Prime Factorization of Strong Product Graphs. Math. Comput. Sci. Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler
2009	—	`conf`	On the Design of RNA Sequences for Realizing Extended Shapes. IJCBS Marc Hellmuth, Daniel Merkle, Martin Middendorf