WEEKLY ACTIVITIES
Seminar on Numerical Analysis and Scientific Computing
An Efficient Algorithm for Determining the Connected Orthogonal Convex Hulls
Báo cáo viên: Nguyễn Kiều Linh (Học viện Công nghệ Bưu chính Viễn thông)
|
Highlights
New Scientiffic Publications
- Ha Thi Thu Hien, Ha Minh Lam, Ngo Viet Trung, Decreasing behavior of the depth functions of edge ideals. Journal of Algebraic Combinatorics, Volume 59Â (2024), pages 37–53, (SCI-E, Scopus).
- Lam Quoc Anh, Huy Minh Le, Kien Trung Nguyen, Le Xuan Thanh, An algorithmic approach to the robust downgrading makespan scheduling problem, Applied Set-Valued Analysis and Optimization, Volume 6, Issue 3, 1 December 2024, Pages 263-273, (Scopus).
- Hoang Nam Dung, Nguyen Kieu Linh, Hoang Xuan Phu, Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity, Applied Mathematics and Computation, Volume 481, 2024, 128931, (SCI-E, Scopus).
