Title：Approximating Hypergraph Partitioning Problems

Abstract：Partitioning hypergraph is often an important subproblem for complexity reduction or parallelization computing in mathematics and computer science. In general, most hypergraph partitioning problems are NP-hard and even hard to approximate. With the advent of ever instances in various applications, such as VLSI circuit design， image processing and social networks，approximating hypergraph partitioning problems become more and more important and challenging. In the talk, we will introduce our recent results on approximating hypergraph partitioning problems with applications.

Speaker：Zhang Xiaoyan, Ph.D. in Applied Mathematics and Theoretical Computer Science from Nankai University and University of Twente in the Netherlands, professor and doctoral supervisor of School of Mathematical Sciences and Institute of Mathematics of Nanjing Normal University, visiting researcher of High Performance Computing Center, Institute of Digital, Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, "100 Young Leading Talents" and "Blue Project" outstanding young and middle-aged academic leaders of Nanjing Normal University, director of European and American Alumni Association of Nanjing Normal University, high-level talents of the six talent peaks in Jiangsu Province. He was selected as a young talent program of Jiangsu Think Tank, a supervisor of the Supervisory Committee of Jiangsu Operations Research, a member of the Youth Committee of Jiangsu European and American Alumni Association, a director of the China Operations Research Mathematical Planning Branch, a director of the China Operations Research Graph Theory and Combination Branch, an executive member of the Theoretical Computer Science Professional Committee of the Chinese Computer Society, a visiting professor at the Institute of Discrete Mathematics of the University of Bonn in Germany and Royal Holloway College, University of London, mainly engaged in the research of graph optimization slicing problems, chip design graph algorithms and theoretical computer science. His  research results have been published in 《SIAM J. COMPUTING》, 《SIAM J. SCIENTIFIC COMPUTING》, 《SIAM J. DISCRETE MATH》, 《J. GTAPH THEORY》，《IEEE  TRANSACTIONS ON INFORMATION THEORY》 and so on.

He has been in charge of several National Natural Science Foundation of China and provincial and ministerial projects, and has authored two English academic works and one translation.

Date：2:00pm-5:00pm 2023-09-18（Monday）.

Tencent Meeting ID： 415-180-985

Organizer：School of Mathematical Science

Students and teachers who are interested in graph theory are welcome.