| Nonempty intersection of longest paths in series–parallel graphs G Chen, J Ehrenmüller, CG Fernandes, CG Heise, S Shan, P Yang, ... Discrete mathematics 340 (3), 287-304, 2017 | 33 | 2017 |
| The bandwidth theorem in sparse graphs P Allen, J Böttcher, J Ehrenmüller, A Taraz arXiv preprint arXiv:1612.00661, 2016 | 27 | 2016 |
| An improved bound on the sizes of matchings guaranteeing a rainbow matching D Clemens, J Ehrenmüller arXiv preprint arXiv:1503.00438, 2015 | 21 | 2015 |
| A Dirac-type theorem for Berge cycles in random hypergraphs D Clemens, J Ehrenmüller, Y Person arXiv preprint arXiv:1903.09057, 2019 | 12 | 2019 |
| On sets not belonging to algebras and rainbow matchings in graphs D Clemens, J Ehrenmüller, A Pokrovskiy Journal of Combinatorial Theory, Series B 122, 109-120, 2017 | 11 | 2017 |
| A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs D Clemens, J Ehrenmüller, Y Person Electronic notes in discrete mathematics 54, 181-186, 2016 | 10 | 2016 |
| Keeping Avoider's graph almost acyclic D Clemens, J Ehrenmüller, Y Person, T Tran arXiv preprint arXiv:1403.1482, 2014 | 9 | 2014 |
| Local resilience of spanning subgraphs in sparse random graphs P Allen, J Böttcher, J Ehrenmüller, A Taraz Electronic notes in discrete mathematics 49, 513-521, 2015 | 8 | 2015 |
| A spanning bandwidth theorem in random graphs P Allen, J Böttcher, J Ehrenmüller, J Schnitzer, A Taraz Combinatorics, Probability and Computing 31 (4), 598-628, 2022 | 4 | 2022 |
| Spanning trees in random series-parallel graphs J Ehrenmüller, J Rué Advances in applied mathematics 75, 18-55, 2016 | 3 | 2016 |
| Existence and enumeration of spanning structures in sparse graphs and hypergraphs J Ehrenmüller Dissertation, Technische Universität Hamburg-Harburg, 2016 | 1 | 2016 |
