Duc A. Hoang

collaborators

7 papers

math.CO2026

Token-sliding realizability for complements, Cartesian-products, and grid graph families

Duc A. Hoang

For an integer $k \geq 0$ and a graph $G$ , the \emph{token-sliding reconfiguration graph $TS_{k} (G)$ } has the independent $k$ -sets of $G$ as vertices. Two vertices are adjacen…

math.CO2026

On Realizing Reconfiguration Graphs of Cliques

Duc A. Hoang

For a graph $H$ and an integer $k \geq 1$ , the \emph{Token Sliding reconfiguration graph} $TS_{k} (H)$ and the \emph{Token Jumping reconfiguration graph} $TJ_{k} (H)$ hav…

cs.DS2026

Distance Recoloring

Niranka Banerjee, Christian Engels, Duc A. Hoang

Reconfiguration problems ask whether one feasible solution can be transformed into another by a sequence of local moves while maintaining feasibility throughout. For integers $d \g…

cs.DS2026

Directed Token Sliding

Niranka Banerjee, Christian Engels, Duc A. Hoang

Reconfiguration problems involve determining whether two given configurations can be transformed into each other under specific rules. The Token Sliding problem asks whether, given…

cs.CL2026

FAID: Fine-Grained AI-Generated Text Detection Using Multi-Task Auxiliary and Multi-Level Contrastive Learning

Minh Ngoc Ta, Dong Cao Van, Duc-Anh Hoang +6

The growing collaboration between humans and AI models in generative tasks has introduced new challenges in distinguishing between human-written, LLM-generated, and human-LLM colla…

math.CO2025

A Note on Reconfiguration Graphs of Cliques

Quan N. Lam, Huu An Phan, Duc A. Hoang

In a reconfiguration setting, each clique of a graph $G$ is viewed as a set of tokens placed on vertices of $G$ such that no vertex has more than one token and any two tokens are a…