Folgen
Hung P. Hoang
Titel
Zitiert von
Zitiert von
Jahr
Combinatorial generation via permutation languages
E Hartung, HP Hoang, T Mütze, A Williams
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
252020
Combinatorial generation via permutation languages. II. Lattice congruences
HP Hoang, T Mütze
Israel Journal of Mathematics 244 (1), 359-417, 2021
232021
Combinatorial generation via permutation languages. I. Fundamentals
E Hartung, H Hoang, T Mütze, A Williams
Transactions of the American Mathematical Society 375 (4), 2255-2291, 2022
192022
A Subexponential Algorithm for ARRIVAL
B Gärtner, S Haslebacher, HP Hoang
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
92021
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
S Bhyravarapu, TA Hartmann, HP Hoang, S Kalyanasundaram, ...
Algorithmica, 1-39, 2024
82024
Combinatorial generation via permutation languages. V. Acyclic orientations
J Cardinal, HP Hoang, A Merino, O Mička, T Mütze
SIAM Journal on Discrete Mathematics 37 (3), 1509-1547, 2023
32023
Drawings of complete multipartite graphs up to triangle flips
O Aichholzer, MK Chiu, HP Hoang, M Hoffmann, J Kynčl, Y Maus, ...
arXiv preprint arXiv:2303.07401, 2023
32023
Assistance and interdiction problems on interval graphs
HP Hoang, S Lendl, L Wulf
Discrete Applied Mathematics 340, 153-170, 2023
22023
On Two Combinatorial Reconfiguration Problems: Reachability and Hamiltonicity
PH Hoang
ETH Zurich, 2022
22022
On approximating the rank of graph divisors
K Bérczi, HP Hoang, L Tóthmérész
Discrete Mathematics 346 (9), 113528, 2023
12023
Combinatorial generation via permutation languages. I. Fundamentals
H Elizabeth, HP Hoang, T Mutze, A Williams
Transactions of the American Mathematical Society 375, 2255-2291, 2022
12022
Gioan’s Theorem for complete bipartite graphs
O Aichholzer, MK Chiu, HP Hoang, M Hoffmann, Y Maus, B Vogtenhuber, ...
Abstracts 38th European Workshop on Computational Geometry, 31, 2022
12022
The -Opt algorithm for the Traveling Salesman Problem has exponential running time for
S Heimann, HP Hoang, S Hougardy
arXiv preprint arXiv:2402.07061, 2024
2024
On the PLS-completeness of TSP/k-Opt
HP Hoang, S Hougardy
Forschungsinstitut für Diskrete Mathematik, Rheinische Friedrich-Wilhelms …, 2023
2023
Zigzagging through acyclic orientations of chordal graphs and hypergraphs
J Cardinal, HP Hoang, A Merino, T Mütze
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
2023
Exhaustive generation of pattern-avoiding permutations
HP Hoang
Permutation Patterns 2019, 81, 2019
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–16