Current Location: Home > Research > Conferences > Content

All-day academic report

                   Morning Nov 23   the school of mathematics and statistics

time

leader

reporter

school

title

08:30-08:40

open ceremony

08:40-09:10


赵海兴

青海师范大学

Complex   Networks and its Representation Learning


09:10-09:40

李建平

云南大学数学与统计学院

Approximation   algorithms for solving the 1-line minimum rectilinear Steiner tree problem

09:40-10:10

侯新民

中国科学技术大学数学科学学院

Codegree   threshold for tiling balanced complete 3-partite 3-graphs   and generalized 4-cycles

10:10-10:40

relax

10:40-11:10


李书超

华中师范大学数学与统计学院

Extremal   problems on two types of trees with respect to the cover cost and the reverse   cover cost

11:10-11:40

张晓岩

南京师范大学数学科学学院及数学研究所

Clustering   Graph Routing Problems

11:40-14:30

lunch

                  Afternoon Nov 23   the school of mathematics and statistics

14:30-15:00


闫桂英

中国科学院数学与系统科学研究院

Graph   theory and its applications in bioinformatics

15:00-15:30

蔡建生

潍坊学院数学与信息科学学院

Improved   upper bound for the degenerate and star coloring chromatic numbers of graphs

15:30-16:00

陆由

西北工业大学数学与统计学院

Edge   coloring of signed graphs

16:00-16:30

relax

16:30-17:00


李佳傲

南开大学数学学院

Flow,   Group Connectivity and Group Coloring

17:00-17:30

罗荣

West   Virginia University

Flows   of signed graphs