Pham Van Trung


Department of Mathematics for Computer Sciences
Research interests: Discrete dynamical system, computational complexity

Office: Building A5, Room 305
Tel: + 84 (024) 37564303
Email: pvtrung AT
Personal homepage:

Born: in Quang Ngai in 1985

Education and academic degrees:

  • Year: 2010 Bachelor/Master: France


  • Researcher of Department of Mathematics of Computer Science

 Research areas: Discrete dynamical system, computational complexity


List of publications in MathSciNet

List of recent publications
1Libor Barto, Michael Kompatscher, Miroslav Olšák, Pham Van Trung, Michael Pinsker, Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures, Journal of Mathematical Logic, 19, (2019), 1950010, SCI(-E), Scopus.
2Barto Libor, Kompatscher Michael, Olšák Miroslav, Pham Van Trung, Pinsker Michael, The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 12 pp NJ, 2017.
3 Michael, Pham Van Trung, Kompatscher, A complexity dichotomy for poset constraint satisfaction Journal of Applied Logics - IfCoLoG Journal of Logics and their Applications 5 (2018), no. 8, 1663–1695.
4Manuel Bodirsky, Peter Jonsson, Pham Van Trung, The complexity of phylogeny constraint satisfaction problems. ACM Transactions on Computational Logic, 18(2017), 23:1–23:42, SCI(-E); Scopus.
5Manuel Bodirsky, Peter Jonsson, Pham Van Trung, The Reducts of the Homogeneous Binary Branching C-relation. Journal of Symbolic Logic, 81 (2016),1255-1297, SCI(-E); Scopus.
6Kévin Perrot, Pham Van Trung, Chip-firing game and a partial Tutte polynomial for eulerian digraphs, The Electronic Journal of Combinatorics, 23(1) (2016), SCI(-E); Scopus.
7Pham Van Trung, Orbits of rotor-router operation and stationary distribution of random walks on directed graphs, Advances in Applied Mathematics 70 (2015) 45-53, SCI(-E), Scopus.
8Kevin Perrot, Pham Van Trung, Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs. Annals of Combinatorics, 19 (2015), 373-396, SCI(-E), Scopus.
9Formenti Enrico, Pham Van Trung, Phan Thi Ha Duong, Tran Thi Thu Huong, Fixed-point forms of the parallel symmetric sandpile model. Theoretical Computer Science 533 (2014), 1–14.
10Pham Van Trung, Phan Thi Ha Duong, Lattices generated by Chip Firing Game models: Criteria and recognition algorithms, European Journal of  Combinatorics, 34 (2013), 812 - 832.
11Le Manh Ha, Pham Van Trung, Phan Thi Ha Duong, A polynomial-time algorithm for reachability problem of a subclass of Petri net and Chip Firing Games  IEEE-RIVF International Conference on Computing, 2012.
12Ke\'vin Perrot, Phan Thi Ha Duong, Pham Van Trung, On the set of Fixed Points of the Parallel Symmetric Sand Pile Model Automata 2011, DMTCS: Automata 2011 - 17th International Workshop on Cellular Automata and Discrete Complex Systems