Hung P. Hoang
Orcid: 0000-0001-7883-4134Affiliations:
- TU Wien, Austria
- ETH Zürich, Switzerland (former)
  According to our database1,
  Hung P. Hoang
  authored at least 17 papers
  between 2019 and 2025.
  
  
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
- 
    on orcid.org
On csauthors.net:
Bibliography
  2025
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem.
    
  
    CoRR, July, 2025
    
  
    CoRR, March, 2025
    
  
    Proceedings of the 41st International Symposium on Computational Geometry, 2025
    
  
  2024
    Algorithmica, July, 2024
    
  
    Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
    
  
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5.
    
  
    Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
    
  
  2023
    Discret. Appl. Math., December, 2023
    
  
    SIAM J. Discret. Math., September, 2023
    
  
    Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
    
  
    Proceedings of the 39th International Symposium on Computational Geometry, 2023
    
  
  2022
    PhD thesis, 2022
    
  
  2021
    Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
    
  
  2020
    Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
    
  
  2019