Phuc Hung Hoang

Projektass.(FWF) Dr.

Roles

PostDoc Researcher
Algorithms and Complexity, E192-01
Curriculum Commission for Informatics
Substitute Member
Curriculum Commission for Business Informatics
Substitute Member

Contact

Projects

Structural Analysis in Combinatorial Reconfiguration
2025 – 2028 / Austrian Science Fund (FWF)

Publications

Generating All Invertible Matrices by Row Operations / Gregor, P., Hoang, P. H., Merino, A., & Mička, O. (2024). Generating All Invertible Matrices by Row Operations. In 35th International Symposium on Algorithms and Computation (ISAAC 2024) (pp. 1–14). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2024.35
Project: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026)
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs / Bhyravarapu, S., Hartmann, T. A., Hoang, P. H., Kalyanasundaram, S., & Vinod Reddy, I. (2024). Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. Algorithmica, 86(7), 2250–2288. https://doi.org/10.1007/s00453-024-01227-2
Project: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026)
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5 / Heimann, S., Hoang, H. P., & Hougardy, S. (2024). The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. In K. Bringmann, M. Grohe, G. Puppis, & O. Svensson (Eds.), 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2024.84
Download: The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5 (1.14 MB)
Project: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026)