Hung P. Hoang
Scholar

Hung P. Hoang

Google Scholar ID: GF7jSB4AAAAJ
Postdoc at TU Wien
theoretical computer sciencealgorithmsgraph theoryoptimization
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
131
 
H-index
6
 
i10-index
3
 
Publications
20
 
Co-authors
5
list available
Contact
CVOpen ↗GitHubOpen ↗
Publications
7 items
On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
2026
Cited
0
Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements
2026
Cited
0
A Parameterized-Complexity Framework for Finding Local Optima
Information Technology Convergence and Services · 2026
Cited
0
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
2025
Cited
0
Flipping odd matchings in geometric and combinatorial settings
2025
Cited
0
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
2025
Cited
0
Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
2025
Cited
0
Resume (English only)
Co-authors
5 total
Torsten Mütze
Torsten Mütze
Professor for Discrete Mathematics, Universität Kassel
Aaron Williams
Aaron Williams
Associate Professor of Computer Science, Williams College
Co-author 3
Co-author 3
Co-author 4
Co-author 4
Lasse Wulf
Lasse Wulf
PostDoc, DTU Copenhagen