Stefan Ehard

• Graph Theory II (Sommersemester 2020)
• Angewandte Diskrete Mathematik (Wintersemester 2019/20, moodle)
• Graph Theory II (Sommersemester 2019)
• Analysis IIb für Ingenieure und Informatiker (Wintersemester 2018/19, moodle)
• Analysis I für Ingenieure und Informatiker (Sommersemester 2018, moodle)
• Graph Theory (Wintersemester 2017/18, moodle)

• Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree,
  with F. Joos, arxiv.
• Low weight perfect matchings,
  with E. Mohr and D. Rautenbach, to appear in Eletronic Journal of Combinatorics.
• Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree,
  with J. Baste and D. Rautenbach, arxiv.
• Biholes in balanced bipartite graphs,
  with E. Mohr and D. Rautenbach, arxiv.
• A short proof of the blow-up lemma for approximate decompositions,
  with F. Joos, arxiv.
• A rainbow blow-up lemma for almost optimally bounded edge-colourings,
  with S. Glock and F. Joos, Forum of Mathematics, Sigma 8 (2020) e37.
• Pseudorandom hypergraph matchings,
  with S. Glock and F. Joos, Combinatorics, Probability & Computing 29 (2020) 868-885.
• Rainbow triangles and cliques in edge-colored graphs,
  with E. Mohr, European Journal of Combinatorics 84 (2020) 103037.
• On some tractable and hard instances for partial incentives and target set selection,
  with D. Rautenbach, Discrete Optimization 34 (2019) 100547.
• Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives,
  with C. Brause and D. Rautenbach, Discrete Mathematics 342 (2019) 2127-2133.
• Dynamic monopolies for interval graphs with bounded thresholds,
  with S. Bessy, L.D. Penso, and D. Rautenbach, Discrete Applied Mathematics 260 (2019) 256-261.
• Partial immunization of trees,
  with M.C. Dourado, L.D. Penso, and  D. Rautenbach, Discrete Optimization 35 (2020) 100567.
• Vaccinate your trees!,
  with D. Rautenbach, Theoretical Computer Science 772 (2019) 46-57.
• Approximating connected safe sets in weighted trees,
  with D. Rautenbach, Discrete Applied Mathematics 281 (2020) 216-223.
• Long paths and cycles in random subgraphs of graphs with large minimum degree,
  with F. Joos, Electron. J. Combin. 25 (2018), no. 2, Paper 31, 15 pp.

 

Award for the best student talk at the 42nd Australasian Combinatorics Conference in Sydney, 2019 (Anne Penfold Street Prize).