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
- 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).
- Florian Bridoux, Christophe Crespelle, Phan Thi Ha Duong, Adrien Richard, Dividing Permutations in the Semiring of Functional Digraphs. In Cellular Automata and Discrete Complex Systems. AUTOMATA 2024. Lecture Notes in Computer Science, vol 14782. Springer, Cham.
- Le Mau Hai, Pham Hoang Hiep, Trinh Tung, Cone of Maximal Subextensions of the Plurisubharmonic Functions, Acta Mathematica Vietnamica, Volume 49, (2024), pages 83–97, (Scopus).