Eng Keat Hng

According to our database, Eng Keat Hng authored at least 6 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Prominent examples of flip processes.

Pedro Araújo, Jan Hladký, Eng Keat Hng, Matas Sileikis

Random Struct. Algorithms, May, 2024

2023

Approximating fractionally isomorphic graphons.

Jan Hladký, Eng Keat Hng

Eur. J. Comb., October, 2023

2022

Minimum Degrees for Powers of Paths and Cycles.

Eng Keat Hng

SIAM J. Discret. Math., December, 2022

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

An Approximate Blow-up Lemma for Sparse Hypergraphs.

Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2017

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