Stability of excess Demand Functions with Respect to a Strong Version of Wald's Axiom. - Thanh An Phan; Vuong Thi Thao Binh (Asia Pac. J. Oper. Res., 2009)

Reachable Grasps on a Polygon of a Robot Arm: Finding Convex Ropes without Triangulation. - Thanh An Phan (Int. J. Robotics Autom., 2010)

Blaschke-Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets. - N. N. Hai; Thanh An Phan (J. Optim. Theory Appl., 2011)

Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations. - Hoang Xuan Phu; V. M. Pho; Thanh An Phan (J. Optim. Theory Appl., 2011)

A parallel algorithm based on convexity for the computing of Delaunay tessellation. - Thanh An Phan; Le Hong Trang (Numer. Algorithms, 2012)

Direct multiple shooting method for solving approximate shortest path problems. - Thanh An Phan; Nguyen Ngoc Hai; Tran Van Hoai (J. Comput. Appl. Math., 2013)

On the Performance of Triangulation-Based Multiple Shooting Method for 2D Geometric Shortest Path Problems. - Thanh An Phan; Nguyen Ngoc Hai; Tran Van Hoai; Le Hong Trang (Trans. Large Scale Data Knowl. Centered Syst., 2014)

A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D. - Thanh An Phan; Thanh Giang Dinh (ICCSAMA, 2015)

A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints. - Le Hong Trang; Attila Kozma; Thanh An Phan; Moritz Diehl (Optim. Methods Softw., 2016)

Multiple shooting approach for computing approximately shortest paths on convex polytopes. - Tran Van Hoai; Thanh An Phan; Nguyen Ngoc Hai (J. Comput. Appl. Math., 2017)

QuickhullDisk: A faster convex hull algorithm for disks. - Nguyen Kieu Linh; Chanyoung Song; Joonghyun Ryu; Thanh An Phan; Nam-Dung Hoang; Deok-Soo Kim (Appl. Math. Comput., 2019)

An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $ mathbb {R}^{n}$. - Thanh An Phan; Nam-Dung Hoang; Nguyen Kieu Linh (Numer. Algorithms, 2020)

A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set. - Thanh An Phan; Phong Thi Thu Huyen; Thi Le Nguyen (Appl. Math. Comput., 2021)

A fast and efficient algorithm for determining the connected orthogonal convex hulls. - Nguyen Kieu Linh; Thanh An Phan; Tran Van Hoai (Appl. Math. Comput., 2022)

Finding Approximately Convex Ropes in the Plane. - Le Hong Trang; Thi Le Nguyen; Thanh An Phan (CoRR, 2022)

Blaschke, Separation Theorems and some Topological Properties for Orthogonally Convex Sets. - Thanh An Phan; Thi Le Nguyen (CoRR, 2022)

Finding shortest gentle paths on polyhedral terrains by the method of multiple shooting. - Thanh An Phan; Thi Le Nguyen; Le Hong Trang; Raymond Chi-Wing Wong (J. Comput. Sci., 2023)

Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves. - Thanh An Phan; Hoang Xuan Phu (J. Glob. Optim., 2023)

OFC-Delaunay triangulation: A new efficient algorithm for merging two adjacent Delaunay triangulations. - Thanh An Phan; Trinh Minh Duc; Dang Thi Oanh (Discret. Math. Algorithms Appl., 2024)

Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D. - Thanh An Phan; Thi Le Nguyen (J. Comb. Optim., 2024)