Pham Van Trung
Dr.
Department of Discrete Mathematics, Probabilily Theory and Statistics
Research Interest: Discrete dynamical system, computational complexity
Contact
Office: 208, Building A5
Phone: + 84 (024) 37564/208
Email: pvtrung AT math.ac.vn
Scientific CV
Address
Office: Building A5, Room 305
Tel: + 84 (024) 37564303
Email: pvtrung AT math.ac.vn
Personal homepage: https://sites.google.com/a/math.ac.vn/trungvp/
Born: in Quang Ngai in 1985
Education and academic degrees:
- Year: 2010 Bachelor/Master: France
Positions:
- Researcher of Department of Mathematics of Computer Science
Research areas: Discrete dynamical system, computational complexity
Scientific Publications
Publications
- 1. Libor Bartor, 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 (2019)
- 2. Kompatscher Michael, Olšák Miroslav, Libor Bartor, 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. (2018)
- 3. Kompatscher Michael, Pham Van Trung, A complexity dichotomy for poset constraint satisfaction, Journal of Applied Logics - IfCoLoG Journal of Logics and their Applications 5 (2018), no. 8, 1663–1695 (2018)
- 4. Manuel Bodirsky, Peter Jonsson, Pham Van Trung, The complexity of phylogeny constraint satisfaction problems, ACM Transactions on Computational Logic, 18(2017), 23:1–23:42 (2017)
- 5. Manuel Bodirsky, Peter Jonsson, Pham Van Trung, The Reducts of the Homogeneous Binary Branching C-relation, Journal of Symbolic Logic, 81 (2016),1255-1297 (2016)
- 6. Kevin Perrot, Pham Van Trung, Chip-firing game and a partial Tutte polynomial for eulerian digraphs, The Electronic Journal of Combinatorics, 23(1) (2016) (2016)
- 7. Pham Van Trung, Orbits of rotor-router operation and stationary distribution of random walks on directed graphs, Advances in Applied Mathematics 70 (2015) 45-53 (2015)
- 8. Kevin 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 (2015)
- 9. Formenti 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 (2014)
- 10. Pham 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. (2013)
- 11. Le 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 (2012)
- 12. Kevin 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 (2012)
Featured News
View allUpcoming Conferences
View allNew Publications
View allInstitute Lectures
View allSpeaker: Claude Sabbah (CNRS, École Polytechnique, Institut Polytechnique de Paris, France)