Pseudorandom hypergraph matchings S Ehard, S Glock, F Joos Combinatorics, Probability and Computing 29 (6), 868-885, 2020 | 28 | 2020 |
A rainbow blow-up lemma for almost optimally bounded edge-colourings S Ehard, S Glock, F Joos Forum of Mathematics, Sigma 8, e37, 2020 | 18 | 2020 |
Rainbow triangles and cliques in edge-colored graphs S Ehard, E Mohr European Journal of Combinatorics 84, 103037, 2020 | 16 | 2020 |
Dynamic monopolies for interval graphs with bounded thresholds S Bessy, S Ehard, LD Penso, D Rautenbach Discrete Applied Mathematics 260, 256-261, 2019 | 16 | 2019 |
On some tractable and hard instances for partial incentives and target set selection S Ehard, D Rautenbach Discrete Optimization 34, 100547, 2019 | 14 | 2019 |
Approximating connected safe sets in weighted trees S Ehard, D Rautenbach Discrete Applied Mathematics 281, 216-223, 2020 | 12 | 2020 |
Low weight perfect matchings S Ehard, E Mohr, D Rautenbach arXiv preprint arXiv:2010.15418, 2020 | 8 | 2020 |
Paths and cycles in random subgraphs of graphs with large minimum degree S Ehard, F Joos The Electronic Journal of Combinatorics 25 (2), 2-31, 2018 | 7 | 2018 |
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree S Ehard, F Joos Transactions of the American Mathematical Society 375 (10), 7035-7119, 2022 | 6 | 2022 |
A short proof of the blow-up lemma for approximate decompositions S Ehard, F Joos Combinatorica 42 (6), 771-819, 2022 | 4 | 2022 |
Biholes in balanced bipartite graphs S Ehard, E Mohr, D Rautenbach arXiv preprint arXiv:2004.03245, 2020 | 4 | 2020 |
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives C Brause, S Ehard, D Rautenbach Discrete Mathematics 342 (7), 2127-2133, 2019 | 4 | 2019 |
Vaccinate your trees! S Ehard, D Rautenbach Theoretical Computer Science 772, 46-57, 2019 | 4 | 2019 |
Vaccinate your trees! S Ehard, D Rautenbach Theoretical Computer Science 772, 46-57, 2019 | 4 | 2019 |
Partial immunization of trees MC Dourado, S Ehard, LD Penso, D Rautenbach Discrete Optimization 35, 100568, 2020 | 3 | 2020 |
Non-monotone target sets for threshold values restricted to , , and the vertex degree J Baste, S Ehard, D Rautenbach Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022 | 2 | 2022 |
Embeddings and decompositions of graphs and hypergraphs S Ehard Universität Ulm, 2021 | 1 | 2021 |
Statistical Spatial Predictions for Monthly Global Surface Air Temperature from 1880 to 2015 S Ehard San Diego State University, 2017 | | 2017 |
Long paths and cycles in random subgraphs of graphs with large minimum degree S Ehard, F Joos arXiv preprint arXiv:1510.09166, 2015 | | 2015 |