4 papers
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 is viewed as a set of tokens placed on vertices of such that no vertex has more than one token and any two tokens are a…
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…
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…
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
Suppose that two independent sets and of a graph with are given, and a token is placed on each vertex in . The Sliding Token problem is t…