Stefan Ehard

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 17

Top Topics

Dynamic Networks

Threshold Values

Bipartite Graph Matching

Top Venues

Discret. Optim.

Electron. J. Comb.

Discret. Appl. Math.

Publications

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