Phuc Hung Hoang

Phuc Hung Hoang is a postdoctoral researcher in the Algorithms and Complexity Group at Technische Universität Wien (TU Wien) since November 2023, mentored by Robert Ganian. Prior to this, he worked as an Applied Scientist at Amazon EU (2021–2022) and earned his doctorate at ETH Zurich in 2022 under Bernd Gärtner and Emo Welzl. He holds a Master’s in Operational Research from the London School of Economics (2018) and a Chartered Accountant background from the National University of Singapore.

His research bridges algorithmic design, discrete structures, and interdisciplinary applications. Key areas include graph algorithms, combinatorial optimization, computational complexity, reconfiguration problems, and efficient enumeration. His work often explores how structural properties of problems enable faster algorithms, with a focus on parameterized complexity, combinatorial games, and computational geometry.

Recent publications highlight trends in reconfiguration problems, graph theory, and combinatorial optimization, including analyses of k-opt for TSP, degree-constrained spanning trees, and flip-based enumeration techniques. He secured the FWF ESPRIT Grant (2025–2028) as Principal Investigator for the project Structural Analysis of Combinatorial Reconfiguration.

At TU Wien, he teaches courses like Efficient Algorithms and Hypercube Structures. He has supervised over 12 theses, including works on signotopes, lattice congruences, and graph safety. Beyond academia, he integrates humanistic and artistic perspectives through initiatives like Letter Earthlings and the Intercultural Science-Art Project.