Stefan Ehard

According to our database, Stefan Ehard authored at least 13 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Biholes in balanced bipartite graphs.

Stefan Ehard, Elena Mohr, Dieter Rautenbach

Discuss. Math. Graph Theory, 2023

2022

Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree.

Julien Baste, Stefan Ehard, Dieter Rautenbach

Discret. Math. Theor. Comput. Sci., 2022

A Short Proof of the Blow-Up Lemma for Approximate Decompositions.

Stefan Ehard, Felix Joos

Comb., 2022

2020

Rainbow triangles and cliques in edge-colored graphs.

Stefan Ehard, Elena Mohr

Eur. J. Comb., 2020

Partial immunization of trees.

Mitre Costa Dourado, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach

Discret. Optim., 2020

Approximating connected safe sets in weighted trees.

Stefan Ehard, Dieter Rautenbach

Discret. Appl. Math., 2020

Pseudorandom hypergraph matchings.

Stefan Ehard, Stefan Glock, Felix Joos

Comb. Probab. Comput., 2020

Low Weight Perfect Matchings.

Stefan Ehard, Elena Mohr, Dieter Rautenbach

Electron. J. Comb., 2020

2019

Vaccinate your trees!

Stefan Ehard, Dieter Rautenbach

Theor. Comput. Sci., 2019

Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives.

Christoph Brause, Stefan Ehard, Dieter Rautenbach

Discret. Math., 2019

On some tractable and hard instances for partial incentives and target set selection.

Stefan Ehard, Dieter Rautenbach

Discret. Optim., 2019

Dynamic monopolies for interval graphs with bounded thresholds.

Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach

Discret. Appl. Math., 2019

2018

Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree.

Stefan Ehard, Felix Joos

Electron. J. Comb., 2018