◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Kratsch

4 papers hereh-index 456k citations213 works total

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

author position
  • middle author2
  • last author1

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

fields
  • cs.DS4

identity via Semantic Scholar / OpenAlex

activity
20092021
most citedGenerating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

5 citations · 8 across the 3 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.DS2016

Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch

Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson. Although the optimization and decision variant…

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