Completing graphs to metric spaces. - Andrés Aranda; David Bradley-Williams; Eng Keat Hng; Jan Hubicka; Miltiadis Karamanlis; Michael Kompatscher; Matej Konecný; Micheal Pawliuk (Electron. Notes Discret. Math., 2017)

An Approximate Blow-up Lemma for Sparse Hypergraphs. - Peter Allen 001; Julia Böttcher; Eng Keat Hng; Jozef Skokan; Ewan Davies (LAGOS, 2021)

Longest Paths in Random Hypergraphs. - Oliver Cooley; Frederik Garbe; Eng Keat Hng; Mihyun Kang; Nicolás Sanhueza-Matamala; Julian Zalla (SIAM J. Discret. Math., 2021)

Minimum Degrees for Powers of Paths and Cycles. - Eng Keat Hng (SIAM J. Discret. Math., 2022)

Approximating fractionally isomorphic graphons. - Jan Hladký; Eng Keat Hng (Eur. J. Comb., 2023)

Prominent examples of flip processes. - Pedro Araújo; Jan Hladký; Eng Keat Hng; Matas Sileikis (Random Struct. Algorithms, 2024)