Seminar on Mathematical Foundations for Computer Science
An efficient algorithm for generating all k-ary symmetric necklaces
Speaker: Pham Lan Anh (HUT)
Seminar on Mathematical Foundations for Computer Science
Efficient maximum matching algorithms on trapezoid graphs
Speaker: Le Ngoc Khang
Seminar on Mathematical Foundations for Computer Science
Distance set on the upper half plane
Speaker:Đỗ Duy Hiếu
|
Highlights
28/10/24, Conference: School and Workshop “Selected topics in Arithmetic Algebraic Geometry” |
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).