Stefan Ehard

According to our database1, Stefan Ehard authored at least 11 papers between 2018 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Rainbow triangles and cliques in edge-colored graphs.
Eur. J. Comb., 2020

Partial immunization of trees.
Discret. Optim., 2020

Approximating connected safe sets in weighted trees.
Discret. Appl. Math., 2020

Pseudorandom hypergraph matchings.
Comb. Probab. Comput., 2020

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

Low Weight Perfect Matchings.
Electron. J. Comb., 2020

2019
Vaccinate your trees!
Theor. Comput. Sci., 2019

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

On some tractable and hard instances for partial incentives and target set selection.
Discret. Optim., 2019

Dynamic monopolies for interval graphs with bounded thresholds.
Discret. Appl. Math., 2019

2018
Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree.
Electron. J. Comb., 2018


  Loading...