SPEAKER: Jianli Chen，Center for Discrete Mathematics and Theoretical Computer Science，Fuzhou University
WHEN: Wendesday, 2019, July 3-9:30
WHERE: Room 665, Xingjian Building
Abstract: The very large scale integration (VLSI) placement problem is NP-hard, and many placement constraints on a chip must be considered. It is a great challenge to design efficient and effective algorithms for the VLSI placement problem with different constraints, especially for handling circuit designs with millions of objects. In this talk, from the view of mathematical methods, I will try to discuss the characteristics of VLSI placement problem, and introduce some of our work on this problem.
Bio: Jianli Chen received the B.Sc. degree in information and computing sciences, the M.Sc. degree in computer application technology, and the Ph.D. degree in applied mathematics, all from Fuzhou University, in 2007, 2009, and 2012, respectively. He is currently a distinguished professor with the Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University. His research interests include optimization theory and applications, and optimization methods for VLSI physical design automation. Dr. Chen received Best Paper Award from DAC 2017, Best Paper Award Nomination and Best-in-track Paper from ICCAD 2018, and Best-in-track Paper from ICCAD 2019. He and his group was the recipient of the First Place Award at the CAD Contest at ICCAD in 2017 and 2018, respectively. Dr. Chen also received the Distinguished Young Scholars Foundation of FuJian Province in 2018, and the CCF Integrated Circuit Early Career Award in 2018. He has served as a TPC for DAC, ICCAD, ASP-DAC, and so on. Since January 2018, he has served as a Design Automation Technical Committee of IEEE CEDA .