| 2026 | AAAI | Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity. | Robert Ganian, Hung P. Hoang, Simon Wietheger |
| 2026 | FUN | Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level. | Bernd Grtner, Sebastian Haslebacher, Hung P. Hoang |
| 2026 | ICALP | Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. | Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, Krisztina Szilgyi |
| 2026 | ICALP | On (In)approximability of MaxMin Independent Set Reconfiguration. | Hung P. Hoang, Naoto Ohsaka, Rin Saito, Yuma Tamura |
| 2026 | MFCS | Parameterized Complexity of Efficient Sortation. | Robert Ganian, Hung P. Hoang, Simon Wietheger |
| 2026 | SODA | A Near-Complete Resolution of the Exponential-Time Complexity of k-opt for the Traveling Salesman Problem. | Sophia Heimann, Hung P. Hoang, Stefan Hougardy |
| 2025 | GD | Flipping Odd Matchings in Geometric and Combinatorial Settings. | Oswin Aichholzer, Sofia Brenner, Joseph Dorfer, Hung P. Hoang, Daniel Perz, Christian Rieck, Francesco Verciani |
| 2024 | ICALP | The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. | Sophia Heimann, Hung P. Hoang, Stefan Hougardy |
| 2024 | ISAAC | Generating All Invertible Matrices by Row Operations. | Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka |
| 2021 | ICALP | A Subexponential Algorithm for ARRIVAL. | Bernd Grtner, Sebastian Haslebacher, Hung P. Hoang |
| 2007 | ISCAS | A SiGe BiCMOS Variable Gain Amplifier for Cryogenic Temperature Applications. | Tiejun Cao, Hung P. Hoang, Beth O. Woods, H. Alan Mantooth |