学 术

分享到微信 ×
打开微信“扫一扫”
即可将网页分享至朋友圈
名师讲堂:Topics in graph algorithms
文:教师发展中心 来源:党委教师工作部、人力资源部(教师发展中心) 时间:2023-12-05 1913

教师发展中心“名师讲堂”活动特别邀请欧洲科学院院士、挪威卑尔根大学FEDOR FOMIN教授来校作学术交流。具体安排如下,欢迎广大师生参加。

一、主 题:Topics in graph algorithms

二、主讲人:欧洲科学院院士、挪威卑尔根大学FEDOR FOMIN 教授

三、时 间:2023年12月8日(星期五)10:20

四、地 点:清水河校区四号科研楼A区518会议室

五、主持人:计算机科学与工程学院(网络空间安全学院)Bakh Khoussainov教授

六、内容简介:

- Bollobas Lemma

- Some combinatorial applications (critical graphs and minimal separators)

- Representative Sets

- Few attempts to compute Reps

- Longest Cycle application

- Matroids

- One more attempt to compute Reps

- Kernelization application

七、主讲人简介: 

Fedor Foim, professor in computer science at the University of Bergen since 2002, doing research in Algorithms and Combinatorics. He is an elected member of the Norwegian Academy of Science and Letters (Det Norske VidenskapsAkademi, DNVA) since 2021, elected member of the Norwegian Academy of Technological Sciences (Norges tekniske vitenskapsakademi, NTVA) since 2021, elected member of Academia Europaea(欧洲科学院院士) since 2019, called EATCS Fellow in 2019 for "his fundamental contributions in the fields of parametrized complexity and exponential algorithms". His Master (1992) and PhD (1997) degrees are from the Faculty of Mathematics and Mechanics, St. Petersburg State University and my supervisor was Prof. Nikolay Petrov.

八、主办单位:教师发展中心

     承办单位:计算机科学与工程学院(网络空间安全学院)

 


 


编辑:李果  / 审核:李果  / 发布:陈伟