On the set of Fixed Points of the Parallel Symmetric Sand Pile Model. - Kévin Perrot; Thi Ha Duong Phan; Van Trung Pham (Automata, 2011)

A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games. - Le Manh Ha; Van Trung Pham; Thi Ha Duong Phan (RIVF, 2012)

Lattices generated by Chip Firing Game models: characterizations and recognition algorithm - Van Trung Pham; Thi Ha Duong Phan (CoRR, 2012)

NP-hardness of minimum feedback arc set problem on Eulerian digraphs and minimum recurrent configuration problem of Chip-firing game - Kévin Perrot; Van Trung Pham (CoRR, 2013)

Lattices generated by Chip Firing Game models: Criteria and recognition algorithms. - Van Trung Pham; Thi Ha Duong Phan (Eur. J. Comb., 2013)

Fixed-point forms of the parallel symmetric sandpile model. - Enrico Formenti; Van Trung Pham; Thi Ha Duong Phan; Tran Thi Thu Huong (Theor. Comput. Sci., 2014)

The Complexity of Phylogeny Constraint Satisfaction. - Manuel Bodirsky; Peter Jonsson; Van Trung Pham (STACS, 2016)

Chip-Firing Game and a Partial Tutte Polynomial for Eulerian Digraphs. - Kévin Perrot; Van Trung Pham (Electron. J. Comb., 2016)

The Reducts of the homogeneous Binary Branching C-Relation. - Manuel Bodirsky; Peter Jonsson; Van Trung Pham (J. Symb. Log., 2016)

A Complexity Dichotomy for Poset Constraint Satisfaction. - Michael Kompatscher; Van Trung Pham (STACS, 2017)

The Complexity of Phylogeny Constraint Satisfaction Problems. - Manuel Bodirsky; Peter Jonsson; Van Trung Pham (ACM Trans. Comput. Log., 2017)

Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. - Libor Barto; Michael Kompatscher; Miroslav Olsák; Van Trung Pham; Michael Pinsker (J. Math. Log., 2019)