WEEKLY ACTIVITIES
Seminar on Mathematical Foundations for Computer Science
Faster and Enhanced Inclusion-Minimal Cograph Completion
Speaker: Chritophe Crespelle (University Lyon)
Seminar on Mathematical Foundations for Computer Science
Tập khoảng cách trên đa tạp
Người báo cáo: Đỗ Duy Hiếu
Seminar on Mathematical Foundations for Computer Science
Complex Network: editing graph into few cliques and fixed-parameter tractable (fpt-)algorithm (Part 2)
Speaker: Phan Thi Ha Duong
Seminar on Mathematical Foundations for Computer Science
Data mining under Local differential privacy
Speaker: Nguyen Duy Hoang
Seminar on Mathematical Foundations for Computer Science
Data mining under Local differential privacy (part 2)
Speaker: Ta Duy Hoang
Seminar on Mathematical Foundations for Computer Science
Operation Simulation of Bac Hung Hai Irrigation System (Part 2)
Speaker: Nguyen Thi Van
Seminar on Mathematical Foundations for Computer Science
Complex Network: editing graph into few cliques and fixed-parameter tractable (fpt-)algorithm (Part 1)
Speaker: Phan Thi Ha Duong
Seminar on Mathematical Foundations for Computer Science
Sandpiles and graph polynomial
Speaker: Kevin Perrot (Université Aix- Marseille)
Seminar on Mathematical Foundations for Computer Science
Network models for Epidemics (Part 1)
Speaker: Le Chi Ngoc
Seminar on Mathematical Foundations for Computer Science
Network models for Epidemics (Part 2)
Speaker: Le Chi Ngoc
Seminar on Mathematical Foundations for Computer Science
Operation Simulation of Bac Hung Hai Irrigation System (Part 1)
Speaker: Nguyen Ngoc Doanh
Seminar on Mathematical Foundations for Computer Science
Complex network modelling through graph editing problems
Speaker: Christophe Crespelle (Université Claude Bernard Lyon 1)
Seminar on Mathematical Foundations for Computer Science
Ứng dụng của lý thuyết đồ thị trong một số bài toán thực tế
Người báo cáo: Lê Chí Ngọc - Đại học Bách Khoa Hà nội
Seminar on Mathematical Foundations for Computer Science
On the performance of approximating longest path
Speaker: Tran Vinh Duc
Seminar on Mathematical Foundations for Computer Science
Right-justified characterization for generating regular pattern permutations
Speaker: Do Phan Thuan and Tran Thi Thu Huong
Seminar on Mathematical Foundations for Computer Science
On cycles of maximum length in bipartite digraphs (part 2)
Speake: Ngo Dac Tan
Seminar on Mathematical Foundations for Computer Science
MARKOV CHAINS AND SIMULATED ANNEALING
Speaker: Tran Hung Thao
Seminar on Mathematical Foundations for Computer Science
Constraint satisfaction problems on infinite domains
Speaker: Pham Van Trung
Seminar on Mathematical Foundations for Computer Science
Constraint satisfaction problems on infinite domains (part 2)
Speaker: Pham Van Trung
Seminar on Mathematical Foundations for Computer Science
Constraint satisfaction problems on infinite domains (part 3)
Speaker: Pham Van Trung
Seminar on Mathematical Foundations for Computer Science
On cycles of maximum length in bipartite digraphs
Speake: Ngo Dac Tan
Seminar on Mathematical Foundations for Computer Science
Mạng phức tạp và một số bài toán trên đồ thị lớn
Speaker: Phan Thi Ha Duong
Seminar on Mathematical Foundations for Computer Science
A maximizing characteristic for critical configurations of chip-firing games on digraphs
Speaker: Nguyen Hoang Thach
|
Highlights
New Scientiffic Publications
- D. T. K. Huyen, J.-C. Yao, Nguyen Dong Yen, Characteristic sets and characteristic numbers of matrix two-person games, Journal of Global Optimization, Volume 90, pages 217–241, (2024), (SCI-E, Scopus).
- Du Thi Thu Trang, Ho Minh Toan, Hoang Phi Dung, Representation of positive polynomials on a generalized strip and its application to polynomial optimization, Optimization Letters 18 (2024), no. 7, 1727–1746, (SCI-E, Scopus).
- Nguyen Cong Minh, Vũ Quang Thanh, A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution, Combinatorica, Volume 44, pages 337–353, (2024), (SCI-E, Scopus).