Publications: Phuc Hung Hoang

⬅️ Zurück zum Profil

2026

[1]	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, Bocconi University, Milan, Italy, January 27-30, 2026 (Shubhangi Saraf, ed.), volume 362 of LIPIcs, pages 66:1–66:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 38:1–38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Robert Ganian, Hung P. Hoang, Simon Wietheger Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press. [bibtex] [pdf] [doi]
[4]	Not All Degree Constraints Are Created Equal when Computing Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[5]	Parameterized Complexity of Efficient Sortation Robert Ganian, Hung Hoang, Simon Wietheger 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]

2024

[1]	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, volume 86, number 7, pages 2250–2288, 2024. [bibtex] [pdf] [doi]
[2]	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 (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 35:1–35:14, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(\geq\) 5 Sophia Heimann, Hung P. Hoang, Stefan Hougardy 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 84:1–84:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]