International Conference on Combinatorics, Graph Theory and Applications
Sunday 15 April
13h30 – 14h00: Reception
14h – 14h15: Opening Ceremony
Chair: Ingo Schiermeyer
14h15 – 15h15: Vũ Hà Văn
Sum-free problems in additive combinatorics
15h15 – 15h30: Coffee Break
Chair: Phan Thị Hà Dương
15h30 – 16h30: Ingo Schiermeyer
Gallai Ramsey number for K4
16h30 – 16h55: Kevin Perrot
Crossing information on abelian sandpile models
Monday 16 April
Chair: Nguyễn Ngọc Doanh
09h00 – 10h00: Matthieu Latapy
Analysis of Temporal Interactions with Link Streams
10h00 – 10h15: Coffee Break
Chair: Hubert Randerath
10h15 – 10h40: Phan Thị Hà Dương
Rank of Divisors on Graphs and Graph Decomposition
10h40 – 11h05: Arnfried Kemnitz
Sum List Colorings of Graphs
11h05 – 11h30: Trần Nam Trung
Cameron-Walker Graphs and Castelnuovo-Mumford Regularity
11h30 – 11h55: Trần Thị Thu Hương
Rank Computing of Configurations on Bi-complete Graphs
12h00 – 13h30: Lunch break
Chair: Clémence Magnien
13h30 – 14h30: Ngô Việt Trung
Edge Ideals and Ear Decompositions of Graphs
14h30 – 14h45: Coffee Break
Chair: Kevin Perrot
14h45 – 15h10: Đoàn Duy Trung
The Proper 2-connection Number of Graphs
15h10 – 15h35: Lê Anh Vinh
Sum-Product Estimates and Expanding Polynomials over Matrix Rings
15h35 – 16h00: Nguyễn Ngọc Doanh
On the Generating Graph of an Individual-Based Predator-Prey Model
16h00 – 16h25: Đỗ Duy Hiếu
On Volume Set of Boxes in Vector Spaces Over Finite Fields
16h25 – 16h50: Nguyễn Anh Tú
Dominating Set in (fork, )-free Graph
Tuesday 17 April:
Chair: Arnfried Kemnitz
09h00 – 10h00: Clémence Magnien
Algorithmic Challenges in Link Streams: the Case of Clique Computations
10h00 – 10h15: Coffee Break
Chair: Matthieu Latapy
10h15 – 10h40: Nguyễn Thị Ngọc Anh
Integrating Multi-agentSystem, Geographic Information System, and Reinforcement Learning to Simulate and Optimize Traffic Signal Control
10h40 – 11h05: TrầnViệt Hùng
Induced Matching and Distance-$k$ Matching for Some Special Graphs
11h05 – 11h30: Nguyễn Hoàng Linh
Graph-based Methods for Fake Account Detection on Social Network
11h30 – 11h55: Lê Chí Ngọc
Some graph Theoretical optimization problems and applications
12h00 – 13h30: Lunch Break
Chair: Vũ Đình Hòa
13h30 – 14h30: Hubert Randerath
χ-binding functions and forbidden induced subgraphs
14h30 – 14h45: Coffee Break
Chair: Lê Chí Ngọc
14h45 – 15h10: Vũ Đình Hòa
15h10 – 15h35: Đỗ Minh Tuân
Necessary and sufficient conditions for quasi-strongly regularity of Graph Product
15h35 – 16h00: Đỗ Tuấn Hạnh
The Assignment Problem for the Transport Teams
16h00 – 16h45: Problems Session
16h45 – 17h00: Closing Ceremony
18h00: Banquet