◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

K. Stilp

1 paper hereh-index 173 citations2 works total

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

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1

identity via Semantic Scholar / OpenAlex

most citedApproximation algorithms and hardness for domination with propagation

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

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2007★ 5 cited

Approximation algorithms and hardness for domination with propagation

Ashkan Aazami, Michael D. Stilp

The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes S that power dominates all the nodes…

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