Duc A. Hoang

activity

20242026

collaborators

Showing cs.DSShow all

4 papers · 1 filter

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.DS2025

The Complexity of Distance- $r$ Dominating Set Reconfiguration

Niranka Banerjee, Duc A. Hoang

For a fixed integer $r \geq 1$ , a distance- $r$ dominating set (D $r$ DS) of a graph $G = (V, E)$ is a vertex subset $D \subseteq V$ such that every vertex in $V$ is within distance $…

cs.DS2024

On the Complexity of Distance- $d$ Independent Set Reconfiguration

Duc A. Hoang

For a fixed positive integer $d \geq 2$ , a distance- $d$ independent set (D $d$ IS) of a graph is a vertex subset whose distance between any two members is at least $d$ . Imagine that…

Distance Recoloring

Directed Token Sliding

The Complexity of Distance-r Dominating Set Reconfiguration

On the Complexity of Distance-d Independent Set Reconfiguration

The Complexity of Distance- $r$ Dominating Set Reconfiguration

On the Complexity of Distance- $d$ Independent Set Reconfiguration