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
Curriculum Commission for Computer Engineering
Substitute Member

Contact

Projects

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

Publications

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees / Bojikian, N., Firbas, A., Ganian, R., Hoang, H. P., & Szilágyi, K. (2026). Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. In S. Bhattacharya, D. Nanongkai, michael benedikt, & G. Puppis (Eds.), 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.ICALP.2026.38
Minimum Maximal Matchings in Permutahedra / Brenner, S., Fink, J., Hoang, P. H., Merino, A., & Pilaud, V. (2026). Minimum Maximal Matchings in Permutahedra. Electronic Journal of Combinatorics, 33(2), Article P2.50. https://doi.org/10.37236/14145
Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements / Borzechowski, M., Haslebacher, S., Hoang, H. P., Schnider, P., & Weber, S. (2026). Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements. In H.-K. Ahn, M. Hoffmann, & A. Nayyeri (Eds.), 42nd International Symposium on Computational Geometry (SoCG 2026). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.SoCG.2026.19
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity / Ganian, R., Hoang, H. P., & Wietheger, S. (2026). Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity. In Fortieth AAAI Conference on Artificial Intelligence Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence (pp. 19108–19116). AAAI Press. https://doi.org/10.1609/aaai.v40i23.38984
Generating all invertible matrices by row operations / Gregor, P., Hoang, H. P., Merino, A., & Mička, O. (2026). Generating all invertible matrices by row operations. Discrete Mathematics, 349(2), Article 114851. https://doi.org/10.1016/j.disc.2025.114851
A Parameterized-Complexity Framework for Finding Local Optima / Ganian, R., Hoang, H. P., Komusiewicz, C., & Morawietz, N. (2026). A Parameterized-Complexity Framework for Finding Local Optima. In S. Saraf (Ed.), 17th Innovations in Theoretical Computer Science Conference (ITCS 2026). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.ITCS.2026.66
Signotopes with Few Plus Signs / Bergold, H., Egeling, L., & Hoang, P. H. (2025). Signotopes with Few Plus Signs. In O. Aichholzer & H. Wang (Eds.), 41st International Symposium on Computational Geometry (SoCG 2025). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.SoCG.2025.16
Download: PDF (812 KB)
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–2027)
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–2027)
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–2027)