Stefan Ehard

17 papers Journal 17
YearRankTypeTitle / Venue / Authors
2023 J jnl
Biholes in balanced bipartite graphs.
Discuss. Math. Graph Theory
Stefan Ehard, Elena Mohr, Dieter Rautenbach
2022 J jnl
A Short Proof of the Blow-Up Lemma for Approximate Decompositions.
Comb.
Stefan Ehard, Felix Joos
2022 J jnl
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree.
Discret. Math. Theor. Comput. Sci.
Julien Baste, Stefan Ehard, Dieter Rautenbach
2020 J jnl
Approximating connected safe sets in weighted trees.
Discret. Appl. Math.
Stefan Ehard, Dieter Rautenbach
2020 J jnl
Low Weight Perfect Matchings.
Electron. J. Comb.
Stefan Ehard, Elena Mohr, Dieter Rautenbach
2020 J jnl
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree.
CoRR
Julien Baste, Stefan Ehard, Dieter Rautenbach
2020 J jnl
Partial immunization of trees.
Discret. Optim.
Mitre Costa Dourado, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
2020 J jnl
Pseudorandom hypergraph matchings.
Comb. Probab. Comput.
Stefan Ehard, Stefan Glock, Felix Joos
2020 J jnl
Rainbow triangles and cliques in edge-colored graphs.
Eur. J. Comb.
Stefan Ehard, Elena Mohr
2019 J jnl
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives.
Discret. Math.
Christoph Brause, Stefan Ehard, Dieter Rautenbach
2019 J jnl
Dynamic monopolies for interval graphs with bounded thresholds.
Discret. Appl. Math.
Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
2019 J jnl
On some tractable and hard instances for partial incentives and target set selection.
Discret. Optim.
Stefan Ehard, Dieter Rautenbach
2019 J jnl
Vaccinate your trees!
Theor. Comput. Sci.
Stefan Ehard, Dieter Rautenbach
2018 J jnl
Dynamic monopolies for interval graphs with bounded thresholds.
CoRR
Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
2018 J jnl
On some tractable and hard instances for partial incentives and target set selection.
CoRR
Stefan Ehard, Dieter Rautenbach
2018 J jnl
Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree.
Electron. J. Comb.
Stefan Ehard, Felix Joos
2017 J jnl
Approximating Connected Safe Sets in Weighted Trees.
CoRR
Stefan Ehard, Dieter Rautenbach