Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models. - Viet-Ha Nguyen 004; Kévin Perrot (Automata, 2018)

NP-completeness of the game Kingdomino. - Viet-Ha Nguyen 004; Kévin Perrot; Mathieu Vallet (CoRR, 2019)

NP-completeness of the game KingdominoTM. - Viet-Ha Nguyen 004; Kévin Perrot; Mathieu Vallet (Theor. Comput. Sci., 2020)

Graph problems motivated by (low and high) resolution models of large protein assemblies. (Problèmes de graphes motivés par des modèles basse et haute résolution de grands assemblages de protéines). - Viet-Ha Nguyen 004 (2021)

Overlaying a hypergraph with a graph with bounded maximum degree. - Frédéric Havet; Dorian Mazauric; Viet-Ha Nguyen 004; Rémi Watrigant (Discret. Appl. Math., 2022)

Rikudo is NP-complete. - Viet-Ha Nguyen 004; Kévin Perrot (Theor. Comput. Sci., 2022)