◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Ehard

13 papers here

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

author position
  • first author10
  • middle author2

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

fields
  • math.CO12
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20172020
most citedA short proof of the blow-up lemma for approximate decompositions

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

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2018

Dynamic monopolies for interval graphs with bounded thresholds

Stéphane Bessy, Stefan Ehard, Lucia D. Penso +1

For a graph G and an integer-valued threshold function τ on its vertex set, a dynamic monopoly is a set of vertices of G such that iteratively adding to it vertices u of $G…

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