Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThanh An Phan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Thanh An Phan
, Hoang Xuan Phu:
Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves. J. Glob. Optim. 85(4): 1037-1063 (2023)- [j13]Thanh An Phan, Nguyen Thi Le, Le Hong Trang, Raymond Chi-Wing Wong:
Finding shortest gentle paths on polyhedral terrains by the method of multiple shooting. J. Comput. Sci. 67: 101935 (2023) - 2022
- [j12]Nguyen Kieu Linh, Thanh An Phan, Tran Van Hoai:
A fast and efficient algorithm for determining the connected orthogonal convex hulls. Appl. Math. Comput. 429: 127183 (2022) - 2021
- [e1]Lam-Son Lê, Henry Nguyen, Thanh An Phan, Manuel Clavel, Tran Khanh Dang:
15th International Conference on Advanced Computing and Applications, ACOMP 2021, Ho Chi Minh City, Vietnam, November 24-26, 2021. IEEE 2021, ISBN 978-1-6654-0639-0 [contents] - 2020
- [j11]Thanh An Phan, Nam-Dung Hoang, Nguyen Kieu Linh:
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$. Numer. Algorithms 85(4): 1499-1518 (2020)
2010 – 2019
- 2019
- [j10]Nguyen Kieu Linh, Chanyoung Song, Joonghyun Ryu, Thanh An Phan, Nam-Dung Hoang, Deok-Soo Kim:
QuickhullDisk: A faster convex hull algorithm for disks. Appl. Math. Comput. 363 (2019) - 2017
- [j9]Tran Van Hoai, Thanh An Phan, Nguyen Ngoc Hai:
Multiple shooting approach for computing approximately shortest paths on convex polytopes. J. Comput. Appl. Math. 317: 235-246 (2017) - 2016
- [j8]Le Hong Trang, Attila Kozma, Thanh An Phan, Moritz Diehl:
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints. Optim. Methods Softw. 31(1): 187-203 (2016) - 2015
- [c1]Thanh An Phan, Thanh Giang Dinh:
A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D. ICCSAMA 2015: 15-26 - 2014
- [j7]Thanh An Phan, Nguyen Ngoc Hai, Tran Van Hoai, Le Hong Trang:
On the Performance of Triangulation-Based Multiple Shooting Method for 2D Geometric Shortest Path Problems. Trans. Large Scale Data Knowl. Centered Syst. 16: 45-56 (2014) - 2013
- [j6]Thanh An Phan, Nguyen Ngoc Hai, Tran Van Hoai:
Direct multiple shooting method for solving approximate shortest path problems. J. Comput. Appl. Math. 244: 67-76 (2013) - 2012
- [j5]Thanh An Phan, Le Hong Trang:
A parallel algorithm based on convexity for the computing of Delaunay tessellation. Numer. Algorithms 59(3): 347-357 (2012) - 2011
- [j4]Hoang Xuan Phu, V. M. Pho, Thanh An Phan:
Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations. J. Optim. Theory Appl. 149(1): 1-25 (2011) - [j3]N. N. Hai, Thanh An Phan:
Blaschke-Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets. J. Optim. Theory Appl. 151(3): 541-551 (2011) - 2010
- [j2]Thanh An Phan:
Reachable Grasps on a Polygon of a Robot Arm: Finding Convex Ropes without Triangulation. Int. J. Robotics Autom. 25(4) (2010)
2000 – 2009
- 2009
- [j1]Thanh An Phan, Vuong Thi Thao Binh:
Stability of excess Demand Functions with Respect to a Strong Version of Wald's Axiom. Asia Pac. J. Oper. Res. 26(4): 523-532 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
