Phan Thị Hà Dương

Liên hệ

Lý lịch khoa học

Các công bố khoa học

Ấn phẩm

1. 1. Florian Bridoux, Christophe Crespelle, Phan Thị Hà Dương, Adrien Richard, Dividing sum of cycles in the semiring of functional digraphs, Natural Computing, Vol. 25, No. 1, 2026. (2026)
2. 2. Đỗ Duy Hiếu, Nguyen Dung, Phan Thị Hà Dương, Improving the DF-Louvain Algorithm Through Random Walk-Based Refinement, 2025 RIVF International Conference on Computing and Communication Technologies (RIVF), 2025, pp. 932-937 (2025)
3. 3. Đỗ Duy Hiếu, Phan Thị Hà Dương, An improvement on the Louvain algorithm using random walks, Journal of Combinatorial Optimization, Volume 50, article number 14, (2025) (2025)
4. 4. Đỗ Duy Hiếu, Phan Thị Hà Dương, Overlapping community detection algorithms using modularity and the cosine, Advances in Complex Systems Vol. 28, No. 03, 2550006 (2025) Regular Research Articles (2025)
5. 5. Florian Bridoux, Christophe Crespelle, Phan Thị Hà Dương, Adrien Richard, Dividing Permutations in the Semiring of Functional Digraphs, In Cellular Automata and Discrete Complex Systems. AUTOMATA 2024. Lecture Notes in Computer Science, vol 14782. Springer, Cham (2024)
6. 6. Dang Tien Dat, Đỗ Duy Hiếu, Phan Thị Hà Dương, Community detection in directed graphs using stationary distribution and hitting times methods, Social Network Analysis and Mining volume 13, Article number: 80 (2023). (2023)
7. 7. Đỗ Duy Hiếu, Phan Thị Hà Dương, Detecting communities in large networks using the extended Walktrap algorithm, 2022 RIVF International Conference on Computing and Communication Technologies (RIVF), pp. 100-105, doi: 10.1109/RIVF55975.2022.10013880. (2023)
8. 8. Phan Thị Hà Dương, Brill-Noether Conjecture on Cactus Graphs, Acta Mathematica Vietnamica volume 47 (2022), pages 833–845 (2022)
9. 9. Phan Thị Hà Dương, A Survey on the Stability of (Extended) Linear Sand Pile Model., In: Adamatzky, A. (eds) Automata and Complexity. Emergence, Complexity and Computation, vol 42 (2022), Springer, 253--281. (2022)
10. 10. Christophe Crespelle, DanielLokshtanov, Phan Thị Hà Dương, EricThierry, Faster and enhanced inclusion-minimal cograph completion, Discrete Applied Mathematics, 288 (2021) 138–151. (2021)
11. 11. Christophe Crespelle, Lê Tiến Nam, Kevin Perrot, Phan Thị Hà Dương, Linearity is strictly more powerful than contiguity for encoding graphs, Discrete Mathematics, 339 (2016), 2168-2177 (2016)
12. 12. Christophe Crespelle, Lê Tiến Nam, Kevin Perrot, Phan Thị Hà Dương, Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs, . Algorithms and Data Structures. Volume 9214 of the series Lecture Notes in Computer Science, p. 212-223 (2015)
13. 13. Christophe Crespelle, Matthieu Latapy, Phan Thị Hà Dương, On the termination of some biclique operators on multipartite graphs,, Discrete Applied Mathematics, 2015 (2015)
14. 14. Christophe Crespelle, Phan Thị Hà Dương, Tran The Hung, Termination of the iterated strong-factor operator on multipartite graphs, Theoretical Computer Science, 571 (2015), 67–77. (2015)
15. 15. Formenti Enrico, Phạm Văn Trung, Phan Thị Hà Dương, Trần Thị Thu Hương, Fixed-point forms of the parallel symmetric sandpile model, Theoretical Computer Science 533 (2014), 1–14 (2014)
16. 16. Phạm Văn Trung, Phan Thị Hà Dương, Lattices generated by Chip Firing Game models: Criteria and recognition algorithms, European Journal of Combinatorics, 34 (2013), 812 - 832. (2013)
17. 17. Kevin Perrot, Nguyễn Ngọc Doanh, Phan Thị Hà Dương, Effect of migration of three Competing Species on their Distribution in Multizone Environment, IEEE RIVF International Conference on Computing and Communication Technologies- Research, Innovation, and Vision for the Future, (2013) 227 -- 230 (2013)
18. 18. Robert Cori, Phan Thị Hà Dương, Trần Thị Thu Hương, Signed chip firing games with symmetric sandpile models on the cycles, RAIRO - Theoretical Informatics and Applications 47 (2013), 133 - 146. (2013)
19. 19. Le Manh Ha, Phạm Văn Trung, Phan Thị Hà Dương, 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)
20. 20. Kevin Perrot, Phan Thị Hà Dương, Phạm Văn 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)
21. 21. Matthieu Latapy, Phan Thị Hà Dương, Christophe Crespelle, Nguyen Thanh Qui, Termination of multipartite graph series arising from complex network modelisation, . In: The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA’10) (2010), 1 -- 22 (2010)
22. 22. Le Manh Ha, Phan Thị Hà Dương, Order structure and energy of conflicting chip firing game, Acta Mathematica Vietnamica, 35 (2010), 289 -- 301. (2010)
23. 23. Nguyễn Ngọc Doanh, Phan Thị Hà Dương, Nguyen Thi Ngoc Anh, Alexis Drogoul, Jean-Daniel Zucker, Disk graph-based model: a graph theoretical approach for linking agent-based model and dynamical systems, In: Proceedings of IEEE-RIVF International Conference on Computing and Communication Technologies, (2010), 254 -- 257 (2010)
24. 24. Le Manh Ha, Nguyen Anh Tam, Phan Thị Hà Dương, Algorithmic Aspects of the Reachability of Conflicting Chip Firing Game, Advances in Intelligent Information and Database Systems,283 (2010), 359 -- 370. (2010)
25. 25. Phan Thị Hà Dương, Trần Thị Thu Hương, On the stability of sand piles model, Theoretical Computer Science, 411 (2010), 594 -- 601. (2010)
26. 26. Le Manh Ha, Phạm Trà Ân, Phan Thị Hà Dương, On the relation between chip firing games and Petri nets, In: RIVF International Conference on Computing and Telecommunication Technologies, (2009), 328-335. (2009)
27. 27. Matthieu Latapy, Phan Thị Hà Dương, The lattice of integer partitions and its infinite extension, Discrete Mathematics, 309 (2009), 1357-1367 (2009)
28. 28. Le Manh Ha, Phan Thị Hà Dương, Interger partition in discrete dynamical model and ECO method, Vietnam J. Math. 37 (2009), 273-293. (2009)
29. 29. Phan Thị Hà Dương, Two sided sand piles model and unimodal sequences, RAIRO - Theoretical Informatics and Applications, 42 (2008), N0 3, 631 - 646 (2008)
30. 30. Le Minh Ha, Phan Thị Hà Dương, Strict partitions and discrete dynamical systems, Theoretical Computer Science, 389 (2007), 82 - 90. (2007)
31. 31. Le Minh Ha, Phan Thị Hà Dương, Generalized Pseudo-Permutations, Procedding of International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC02). #38.1-#38.9. (2002 (2002)
32. 32. Eric Goles, Michel Morvan, Phan Thị Hà Dương, Sandpiles and order structure of integer partitions, Discrete Applied Mathematics,117 (2002), 51 - 64. (2002)
33. 33. Daniel Krob, Matthieu Latapy, Jean-Christophe, J. Novelli, Phan Thị Hà Dương, Sylviane Schwer, Pseudo-permutations I: First combinatorial and lattice properties, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), 10pp. (2001) (2001)

Tiền ấn phẩm

1. 1. Đỗ Duy Hiếu, Phan Thị Hà Dương, GP-Cosine: Stationary-Centered Diffusion Geometry for Multiway Community Detection (2026)
2. 2. Phan Thị Hà Dương, A survey on the stability of (Extended) Linear Sand Pile Model. Automata and complexity (34 pages). Springer Book Series on Emergence, Complexity, Computation. To appear in 2022. ISSN 2194-7287. (2020)
3. 3. Nguyễn Ngọc Doanh, Kevin Perrot, Phan Thị Hà Dương, On the convergence of the model of migration of competing species in multizone environment (2019)
4. 4. Phan Thị Hà Dương, Link Stream Edition: Sparse Split and Bi-Sparse Split (2019)