Hung P. Hoang

According to our database, Hung P. Hoang authored at least 10 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k≥5.

Sophia Heimann, Hung P. Hoang, Stefan Hougardy

CoRR, 2024

2023

Assistance and interdiction problems on interval graphs.

Hung P. Hoang, Stefan Lendl, Lasse Wulf

Discret. Appl. Math., December, 2023

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations.

Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Ondrej Micka, Torsten Mütze

SIAM J. Discret. Math., September, 2023

On approximating the rank of graph divisors.

Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész

Discret. Math., September, 2023

Zigzagging through acyclic orientations of chordal graphs and hypergraphs.

Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Torsten Mütze

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Drawings of Complete Multipartite Graphs up to Triangle Flips.

Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

On Two Combinatorial Reconfiguration Problems: Reachability and Hamiltonicity.

Hung Phuc Hoang

PhD thesis, 2022

2021

A Subexponential Algorithm for ARRIVAL.

Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Combinatorial generation via permutation languages.

Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Combinatorial generation via permutation languages. I. Fundamentals.

Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams

CoRR, 2019