( en | de | ru )

 

Disambiguation of "Hellmuth, Marc"

Author of the publication

copydeleteadd this publication to your clipboard
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms

, , and . CoRR, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Marc Hellmuth

Stefanie Marczoch

Langzeitverlauf von 200 Patienten mit kraniofazialen und zervikalen Dystonien bis zu 12 Jahre nach der ersten Botulinumtoxin-Behandlung. TU München, (2009)

Hellmuth Voß

Hellmuth Ullrich

Hellmuth Schwiedessen

 

Other publications of authors with the same name

Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees.. CoRR, (2018)Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms, , and . CoRR, (2013)Inference of Phylogenetic Trees from the Knowledge of Rare Evolutionary Events., , , and . CoRR, (2016)From modular decomposition trees to rooted median graphs., , and . Discret. Appl. Math., (2022)A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework., , , , and . SOFSEM (Doctoral Student Research Forum), volume 2568 of CEUR Workshop Proceedings, page 121-132. CEUR-WS.org, (2020)Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs., , , and . CALDAM, volume 14508 of Lecture Notes in Computer Science, page 148-161. Springer, (2024)Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s., , , and . CoRR, (2015)The Complement of the Djokovic-Winkler Relation., , , and . CoRR, (2023)Complexity of modification problems for best match graphs., , and . Theor. Comput. Sci., (2021)On the complexity of recognizing S-composite and S-prime graphs.. Discret. Appl. Math., 161 (7-8): 1006-1013 (2013)