3 citations · 3 across the 3 of their papers we have counts for
3 papers
Combinatorial generation via permutation languages. V. Acyclic orientations
Jean Cardinal, Hung P. Hoang, Arturo Merino +2
In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provi…
Assistance and Interdiction Problems on Interval Graphs
Hung P. Hoang, Stefan Lendl, Lasse Wulf
We introduce a novel framework of graph modifications specific to interval graphs. We study interdiction problems with respect to these graph modifications. Given a list of origina…
A Subexponential Algorithm for ARRIVAL
Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang
The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in $NP \cap…