Hung P. Hoang

MaRDI QIDQ2055277zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The \(k\)-Opt algorithm for the traveling salesman problem has exponential running time for \(k\geq 5\)	2026-01-14	Paper
Generating all invertible matrices by row operations Discrete Mathematics	2025-12-15	Paper
Drawings of complete multipartite graphs up to triangle flips	2024-10-16	Paper
Conflict-free coloring: graphs of bounded clique-width and intersection graphs Algorithmica	2024-08-02	Paper
Zigzagging through acyclic orientations of chordal graphs and hypergraphs	2024-05-14	Paper
Assistance and interdiction problems on interval graphs Discrete Applied Mathematics	2023-09-14	Paper
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations SIAM Journal on Discrete Mathematics	2023-08-10	Paper
On approximating the rank of graph divisors Discrete Mathematics	2023-06-12	Paper
Combinatorial generation via permutation languages. I: Fundamentals Transactions of the American Mathematical Society	2022-03-10	Paper
Combinatorial generation via permutation languages. I: Fundamentals Transactions of the American Mathematical Society	2022-03-10	Paper
Combinatorial generation via permutation languages. II. Lattice congruences Israel Journal of Mathematics	2021-12-01	Paper
Combinatorial generation via permutation languages Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms	2021-02-02	Paper
The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$ (available as arXiv preprint)	N/A	Paper
Generating all invertible matrices by row operations (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Hung P. Hoang