Publications

         Indexed in

Google Scholar

Mathscinet ID: 616239

ORCID  ID:  0000-0002-1903-3510

ResearchGate  (all can be downloaded here)

Scopus  ID: 8668858700

Web of Science  ID: N-8406-2019 

• 1. Phan Thanh An and Nguyen Thi Le, The Method of Multiple Shooting for finding approximately shortest paths for autonomous robots in unknown environments in 2D, Journal of Combinatorical Optimization, DOI 10.1007/s10878-024-01148-4    (SCI-E, Q2)  https://arxiv.org/abs/2208.10386

  2. Phan Thanh An, Nguyen Minh Phuong,  Dang Le Quang, and Le Hong Trang, A modified pothole detection approach to capture their width, Physica Scripta, Feb. 2024 (SCI-E, Q2).  (Phuong was HCMUT graduate student  at the time of authorship). 

  3. Vuong Thi Thao Binh and Phan Thanh An, Stability radius of s-quasimonotone maps,  Numerical Functional Analysis and Optimization, Volume 45 Issue 1, https://doi.org/10.1080/01630563.2024.2305345 (SCI-E, Q2)

  4. Phan Thành An, Trần Văn Hoài, and  Vương Bá Thịnh, The funnel tree algorithm for finding shortest paths on polyhedral surfaces,  Optimization (2023), https://doi.org/10.1080/02331934.2023.2241496 (SCI-E, Q1).

  5. Phan Thanh An, Trinh Minh Duc, Dang Thi Oanh, OFC-Delaunay triangulation: A new efficient algorithm for merging two adjacent Delaunay triangulations, Discrete Mathematics, Algorithms and Applications, (2023)  16 (2)  2350014  https://doi.org/10.1142/S1793830923500143  (ESCI, Q3)

  6. Phan Thành An, Nguyễn Thị Lê, Lê Hồng Trang, and Raymond Chi-Wing Wong, Finding shortest theta-gentle paths on polyhedral terrains by the Method of Multiple Shooting,  Journal of Computational Science, 67, 101935 (2023) (SCI-E, Q1). 

  7. Phan Thành An and Hoàng Xuân Phú, Finding exactly shortest paths through a sequence of adjacent triangles by the Method of Orienting Curves,  Journal of Global Optimization,  85,  (2023)  037–1063 (SCI-E, Q1).

  8. Le Hong Trang, Nguyen Thi Le, and Phan Thanh An, Finding approximately convex ropes in the plane,   Journal of Convex Analysis,  30 (1),  (2023) , 249-270. (SCI-E, Q3)

  9. Nguyễn Kiều Linh, Phan Thành An, and Trần Văn Hoài, O-Quickhull: A fast and efficient algorithm for determining the smallest connected  orthogonal convex hulls,  Applied Mathematics and Computation, 429,  (2022) 127183. (SCI-E, Q1)

  10. Phan Thành An, Hoàng Nam Dũng, and  Nguyễn Kiều Linh, The lifting projection of convex polyhedra for finding Delaunay triangulations,  Journal of Convex Analysis, 29 (1), (2022), 147-160. (SCI-E, Q2)

  11. Phan Thành An, Phong Thị Thu Huyền, and Nguyễn Thị Lê, A modified Graham’s scan algorithm for finding the smallest connected orthogonal convex hull of a finite planar point set, Applied Mathematics and Computation, 397  (2021) 125889. (SCI-E, Q1)

  12. Phan Thanh An, Vuong Thi Thao Binh, and Nguyen Ngoc Hai, Strictly stable generalized monotone maps and two versions of  Wald's axiom, Journal of Convex Analysis,  28 (1) (2021), 123-142.  (SCI-E, Q2)

  13. Phan Thành An, Nam Dũng Hoàng, and Nguyễn Kiều Linh, An efficient improvement of gift-wrapping algorithm for computing the convex hull of a finite set of points in R^n,  Numerical Algorithms, 85 (2020), 1499-1518.  (SCI-E, Q1)

  14. Nguyễn Kiều Linh,   Chanyoung Song, Joonghyun Ryu, Phan Thành An, Nam Dũng Hoàng, and Deok-Soo Kim,  QuickhullDisk: A faster convex hull algorithm for disks,  Applied Mathematics and Computation, 363 (2019), 124626. (SCI-E, Q1)

  15. Nguyễn Ngọc Hải, Phan Thành An, and Phong Thị Thu Huyền, Shortest paths along a sequence of line segments in Euclidean spaces, Journal of Convex Analysis, 26 (4) (2019), 1089-1112. (SCI-E, Q2)

  16.  Phan Thành An, Finding shortest paths in a sequence of triangles in 3D by the planar unfolding, Numerical Functional Analysis and Optimization, 40 (8) (2019), 944-952.  (SCI-E, Q2)

  17. Phan Thành An and Lê Hồng Trang, Computing approximately shortest descending paths on convex terrains via multiple shooting,  Computational and Applied Mathematics, 37 (5) (2018), 6499-6529. (SCI-E, Q3)

  18. Phan Thành An, Finding shortest paths in a sequence of triangles in 3D by the Method of Orienting Curves, Optimization, 67 (2018), 159-177. (SCI-E, Q1)

  19. Trần Văn Hoài, Phan Thành An, Nguyễn Ngọc Hải, Multiple shooting approach for computing approximately shortest paths on convex polytopes, Journal of Computational and Applied Mathematics, 317 (2017), 235–246. (SCI, Q2)

  20. Le Hong Trang, Attila Kozma, Phan Thành An, and Moritz Diehl, A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints, Optimization Methods and Software, 31 (2016), 187-203. (SCI-E, Q1)

  21. Phan Thành An, Đinh Thanh Giang, A direct method for determining the lower convex hull of a finite point set in 3D, Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications - ICCSAMA 2015, May 11-13, Metz, France, Advances in Intelligent Systems and Computing, Springer, 358 (2015), 15-26. (Scopus, ISI)

  22. Phan Thành An, Đinh Thanh Giang, and Le Hong Trang, An exact algorithm for minimizing a sum of Euclidean norms on rays in 2D and 3D, Numerical Functional Analysis and Optimization, 36 (2015), 405–418. (SCI-E, Q2)

  23. Phan Thành An, Nguyễn Ngọc Hải, Trần Văn Hoài, and Lê Hồng Trang, On the performance of triangulation-based multiple shooting method for 2D shortest path problems, LNCS Transactions on Large Scale Data and Knowledge Centered Systems, Springer (2014), 45-56. (Scopus, ISI)

  24. Phan Thành An, Nguyen Ngoc Hai, and Tran Van Hoai, The role of graph for solving some geometric shortest path problems in 2D and 3D, Proceedings of the 5th FTRA International Conference on Computer Science and its Applications (CSA-13), Danang, Vietnam, December 18 - 21, 2013, 2013, Lecture Notes in Electrical Engineering (LNEE), Springer, 279 (2014), 179-184. (Scopus)

  25. Phan Thành An and Le Hong Trang, An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves, Optimization, 62 (2013), 975-988. (SCI-E, Q2)

  26. Phan Thành An, Nguyen Ngoc Hai, and Tran Van Hoai, The role of convexity for solving some shortest path problems in the plane without triangulation, AIP Conference Proceedings, American Institute of Physics, NY, Vol. 1557 (2013), 89-93. (Scopus,  ISI)

  27. Phan Thành An, Nguyen Ngoc Hai and Tran Van Hoai, Direct multiple shooting method for solving approximate shortest path problems, Journal of Computational and Applied Mathematics 244 (2013), 67 - 76. (SCI, Q1)

  28. Nguyễn Ngọc Hải and Phan Thành An, A generalization of Blaschke's convergence theorem in metric spaces, Journal of Convex Analysis, 4 (2013), 1013 - 1024, preprint IMH2012/02/01. (SCI-E, Q2)

  29. Phan Thành An and Trần Văn Hoài, Incremental convex hull as an orientation to solving the shortest path problem, International Journal of Information and Electronics Engineering, 2 (2012), 652-655, also in IEEE Proc. 3rd Int. Conf. Comp. & Auto. Eng., Chongqing, China, Jan. 21-23 (2011).

  30. Phan Thành An and Lê Hồng Trang, A parallel algorithm based on convexity for the computing of Delaunay tessellation, Numerical Algorithms, 59 (2012), 347 -357. (SCI-E, Q2)

  31. Hoàng Xuân Phú, Võ Minh Phổ, and Phan Thành An, Maximizing strictly convex quadratic functions with bounded perturbation, Journal of Optimization Theory and Applications, 149 (2011), 1-25. (SCI, Q1)

  32. Nguyễn Ngọc Hải and Phan Thành An, Blaschke-type theorem and separation of disjoint closed geodesic convex sets,  Journal of Optimization  Theory and Applications,  3 (2011), 541 - 551. (SCI, Q1)

  33. Phan Thành An, Đinh Thanh Giang, and Nguyễn Ngọc Hải, Some computational aspects of geodesic convex sets in a simple polygon,  Numerical Functional Analysis and Optimization, 31 (2010), 221 -231 (SCI-E, Q2)

  34. Phan Thành An, Method of orienting curves for determining the convex hull of a finite set of points in the plane,  Optimization,  59 (2010), 175 - 179 (SCI-E, Q2)

  35. Phan Thành An, Reachable grasps on a polygon of a robot arm: finding convex ropes without triangulation,  International Journal of Robotics and Automation,  4 (2010), 304 - 310. (SCI-E, Q3)

  36. Phan Thành An and Vương Thị Thảo Bình, Stability of excess demand functions with respect to a strong version of Wald's axiom, Asia-Pacific Journal of Operational Research (APJOR), 26 (2009),  523-532. (SCI-E, Q3)

  37. Phan Thành An, Stability of generalized convexity and monotonicity. In: Mathematical modeling, simulation, visualization and e-learning, 193 - 200, Springer, Berlin, 2008. (WOS)

  38. Phan Thành An, Some computational aspects of Helly-type theorems. JNAIAM J. Numer. Anal. Ind. Appl. Math., 3 (2008), 269 - 274 (Q1).

  39. Phan Thành An, Phan Lê Na, and Ngô Quốc Chung, On parametric domain for asymptotic stability with probability one of zero solution of linear Ito stochastic differential equations, Ital. J. Pure Appl. Math., (2007), 129 - 138.

  40. Phan Thành An, Helly-type theorems for roughly convex-like sets,  Numerical Functional Analysis and Optimization, 28 (2007), 553 - 558. (SCI-E, Q2)

  41. Phan Thành An, A modification of Graham's algorithm for determining the convex hull of a finite planar set, Ann. Math. Inform., 34 (2007), 3 - 8. (Q3)

  42. Phan Thành An, Stability of generalized monotone maps with respect to their characterizations, Optimization, 55 (2006),  289-299. (SCI-E, Q3)

  43. Phan Thành An, A new type of stable generalized convex functions. JIPAM. J. Inequal. Pure Appl. Math., 7 (2006), 10 pp. (Q3)

  44. Phan Thành An, Nonemptiness of approximate subdifferentials of midpoint $\delta$-convex functions,  Numerical Functional Analysis and Optimization, 26 (2005), 735 - 738. (SCI-E, Q2)

  45. Phan Thành An, Outer $\gamma$-convex functions on a normed space,  JIPAM.J. Inequal. Pure Appl. Math., 6 (2005), 8 pp. (Q4)

  46. Phan Thành An and Nguyễn Ngọc Hải, δ-Convexity in Normed Linear Spaces, Numerical Functional Analysis and Optimization, 25 (2004), 407 - 422. (SCI-E, Q2)

  47. Hoàng Xuân Phú, Nguyễn Ngọc Hải, and Phan Thành An, Piecewise constant roughly convex functions,  Journal of Optimization Theory and Applications, 117 (2003), 415 - 438. (SCI, Q2)

  48. Hoàng Xuân Phú and Phan Thành An, Outer $\gamma$-convexity in normed linear spaces. Vietnam J. Math., 27 (1999), 323 - 334.

  49. Hoàng Xuân Phú and Phan Thành An, Stability of generalized convex functions with respect to linear disturbances, Optimization, 46 (1999), 381 - 389. (Q2)

  50. Hoàng Xuân Phú and Phan Thành An, Stable generalization of convex functions. Optimization, 3 (1996), 309 - 318. (Scopus)

Preprints: 

• 1.  Phan Thanh An,  Pham Hoang Anh, Tran Thanh Binh, Tran Van Hoai, Autonomous robot with limited exact vision range: a path planning in unknown environment,  submitted,  2022.

  2. Phan Thanh An, Nguyen Thi Le, Blaschke, separation theorems and some topological properties for orthogonally convex sets,  submitted, 2022.  https://arxiv.org/abs/2207.11973

  3. Phan Thanh An, Tran Van Hoai, Nguyen Kieu Linh, Bui Duc Vinh, Le Anh Thang, Approximate upper bounds of the width of cracks via the connected orthogonally convex hulls of of the images of the cracks, submitted 2022.

  4. Phan Thanh An et al., The connected orthogonally convex hulls and application in aircraft image recognition, 2022. 

  5. Phan Thanh An and Nguyen Ngoc Hai, The width of a compact set in R^n, submitted, 2022.

  6. Phan Thanh An et al., The Index of the Stability of Generalized Convexity and Monotonicity, 2023.

Videos

• 1.  Authors  and collaborators:  P. T. An, P. H. Anh, T. T. Binh, T. V. Hoai, N. T. Le, T. M. Tam, V. P. Truong, and T. L. Vi,  Autonomous robot with limited exact vision range ''in action'', Institute of Mathematical and Computational Sciences - IMACS, Ho Chi Minh City University of Technology, April 19, 2022.