◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Hermelin

37 papers hereh-index 242.5k citations104 works total

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

author position
  • first author18
  • middle author14
  • last author4

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

fields
  • cs.DS24
  • cs.CC9
  • cs.DM2
  • cond-mat.dis-nn1
  • cs.NI1

identity via Semantic Scholar / OpenAlex

activity
20092023
most citedBinary Jumbled Pattern Matching via All-Pairs Shortest Paths

13 citations · 59 across the 31 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

cs.DM2012

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen

The Induced Graph Matching problem asks to find k disjoint induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of diffe…

◍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.