◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Hellmuth

2 papers hereh-index 191.3k citations121 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1
  • last author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DM1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

collaborators

2 papers

cs.DM2026

Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints

Patricia A. Ebert, Marc Hellmuth

Least common ancestor (LCA) constraints encode relative-order information in directed acyclic graphs (DAGs) and give rise to a natural constraint-realization problem. Phylogenetic…

cs.DS2025

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs

Johannes B. S. Petersen, Akbar Davoodi, Thomas Gärtner +2

We present an exact algorithm for computing all common subgraphs with the maximum number of vertices across multiple graphs. Our approach is further extended to handle the connecte…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.