| Completing graphs to metric spaces A Aranda, D Bradley-Williams, EK Hng, J Hubička, M Karamanlis, ... Electronic Notes in Discrete Mathematics 61, 53-60, 2017 | 11 | 2017 |
| Completing graphs to metric spaces. Submitted A Aranda, D Bradley-Williams, EK Hng, J Hubicka, M Karamanlis, ... arXiv preprint arXiv:1706.00295, 2017 | 7 | 2017 |
| Longest paths in random hypergraphs O Cooley, F Garbe, EK Hng, M Kang, N Sanhueza-Matamala, J Zalla SIAM Journal on Discrete Mathematics 35 (4), 2430-2458, 2021 | 4 | 2021 |
| Prominent examples of flip processes P Araújo, J Hladký, EK Hng, M Šileikis Random Structures & Algorithms 64 (3), 692-740, 2024 | 3 | 2024 |
| Density of small diameter subgraphs in -free graphs EK Hng, DM Cecchelli arXiv preprint arXiv:2207.14297, 2022 | 2 | 2022 |
| A sparse hypergraph blow-up lemma P Allen, J Böttcher, E Davies, EK Hng, J Skokan preparation, 0 | 2 | |
| Minimum degrees for powers of paths and cycles EK Hng SIAM Journal on Discrete Mathematics 36 (4), 2667-2736, 2022 | 1 | 2022 |
| Approximating fractionally isomorphic graphons J Hladký, EK Hng European Journal of Combinatorics 113, 103751, 2023 | | 2023 |
| Fractionally isomorphic graphs and graphons J Hladký, EK Hng European Conference on Combinatorics, Graph Theory and Applications, 579-586, 2023 | | 2023 |
| Characterization of flip process rules with the same trajectories EK Hng arXiv preprint arXiv:2305.19925, 2023 | | 2023 |
| Embedding problems in graphs and hypergraphs EK Hng London School of Economics and Political Science, 2022 | | 2022 |
| An Approximate Blow-up Lemma for Sparse Hypergraphs P Allen, J Böttcher, EK Hng, J Skokan, E Davies Procedia Computer Science 195, 394-403, 2021 | | 2021 |
| Minimum degree conditions for powers of cycles and paths EK Hng Acta Mathematica Universitatis Comenianae 88 (3), 795-800, 2019 | | 2019 |
