Combinatorial generation via permutation languages. I. Fundamentals. - Elizabeth J. Hartung; Hung Phuc Hoang; Torsten Mütze; Aaron Williams 001 (CoRR, 2019)

Combinatorial generation via permutation languages. - Elizabeth J. Hartung; Hung Phuc Hoang; Torsten Mütze; Aaron Williams 001 (SODA, 2020)

A Subexponential Algorithm for ARRIVAL. - Bernd Gärtner; Sebastian Haslebacher; Hung P. Hoang 001 (ICALP, 2021)

On Two Combinatorial Reconfiguration Problems: Reachability and Hamiltonicity. - Hung Phuc Hoang (2022)

Drawings of Complete Multipartite Graphs up to Triangle Flips. - Oswin Aichholzer; Man-Kwun Chiu; Hung P. Hoang 001; Michael Hoffmann 001; Jan Kyncl; Yannic Maus; Birgit Vogtenhuber; Alexandra Weinberger (SoCG, 2023)

Zigzagging through acyclic orientations of chordal graphs and hypergraphs. - Jean Cardinal; Hung Phuc Hoang; Arturo Merino; Torsten Mütze (SODA, 2023)

On approximating the rank of graph divisors. - Kristóf Bérczi; Hung P. Hoang 001; Lilla Tóthmérész (Discret. Math., 2023)

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. - Jean Cardinal; Hung Phuc Hoang; Arturo Merino; Ondrej Micka; Torsten Mütze (SIAM J. Discret. Math., 2023)

Assistance and interdiction problems on interval graphs. - Hung P. Hoang 001; Stefan Lendl; Lasse Wulf (Discret. Appl. Math., 2023)

The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. - Sophia Heimann; Hung P. Hoang 001; Stefan Hougardy (ICALP, 2024)

Generating All Invertible Matrices by Row Operations. - Petr Gregor; Hung P. Hoang 001; Arturo Merino; Ondrej Micka (ISAAC, 2024)

Parameterized Complexity of Efficient Sortation. - Robert Ganian; Hung P. Hoang 001; Simon Wietheger (CoRR, 2024)

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. - Sriram Bhyravarapu; Tim A. Hartmann; Hung P. Hoang 001; Subrahmanyam Kalyanasundaram; I. Vinod Reddy (Algorithmica, 2024)

Signotopes with Few Plus Signs. - Helena Bergold; Lukas Egeling; Hung P. Hoang 001 (SoCG, 2025)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. - Narek Bojikian; Alexander Firbas; Robert Ganian; Hung P. Hoang 001; Krisztina Szilágyi (CoRR, 2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem. - Sophia Heimann; Hung P. Hoang 001; Stefan Hougardy (CoRR, 2025)