Publications: Phuc Hung Hoang

A Parameterized-Complexity Framework for Finding Local Optima Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz. 17th Innovations in Theoretical Computer Science Conference, ITCS 2026
📄 Details
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Robert Ganian, Hung P. Hoang, Simon Wietheger. AAAI-26, Sponsored by the Association for the Advancement of Artificial Intelligence
📄 Details

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy. Algorithmica
📄 Details
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k (≥) 5 Sophia Heimann, Hung P. Hoang, Stefan Hougardy. 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia
📄 Details
Generating All Invertible Matrices by Row Operations Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka. 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia
📄 Details