Skip to content

Author

Duc A. Hoang

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Sep 2026

A Note on Directed Clique Token Sliding

It is shown that the problem is PSPACE -complete on oriented graphs, NP -complete on directed acyclic graphs (DAGs), and W -hard on DAGs when parameterized by k, and the NP -completeness of the bounded-length variant on DAGs is proved.

Duc A. Hoang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.