Hung P. Hoang

Orcid: 0000-0001-7883-4134

Affiliations:
  • TU Wien, Austria
  • ETH Zürich, Switzerland (former)


According to our database1, Hung P. Hoang authored at least 23 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
On (In)approximability of MaxMin Independent Set Reconfiguration.
CoRR, April, 2026

On the PLS-Completeness of k-Opt Local Search for the Traveling Salesman Problem.
CoRR, March, 2026

A Near-Complete Resolution of the Exponential-Time Complexity of k-opt for the Traveling Salesman Problem.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

A Parameterized-Complexity Framework for Finding Local Optima.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level.
Proceedings of the 13th International Conference on Fun with Algorithms, 2026

Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements.
Proceedings of the 42nd International Symposium on Computational Geometry, 2026

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees.
CoRR, March, 2025

Flipping Odd Matchings in Geometric and Combinatorial Settings.
Proceedings of the 33rd International Symposium on Graph Drawing and Network Visualization, 2025

Signotopes with Few Plus Signs.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs.
Algorithmica, July, 2024

Parameterized Complexity of Efficient Sortation.
CoRR, 2024

Generating All Invertible Matrices by Row Operations.
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
Assistance and interdiction problems on interval graphs.
Discret. Appl. Math., December, 2023

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations.
SIAM J. Discret. Math., September, 2023

On approximating the rank of graph divisors.
Discret. Math., September, 2023

Zigzagging through acyclic orientations of chordal graphs and hypergraphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Drawings of Complete Multipartite Graphs up to Triangle Flips.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
On Two Combinatorial Reconfiguration Problems: Reachability and Hamiltonicity.
PhD thesis, 2022

2021
A Subexponential Algorithm for ARRIVAL.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Combinatorial generation via permutation languages.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Combinatorial generation via permutation languages. I. Fundamentals.
CoRR, 2019


  Loading...