Venkatesan Guruswami (University of California, Berkeley)
Biography
Venkatesan Guruswami is a Professor of Computer Science and Mathematics at UC Berkeley and senior scientist at the Simons Institute for the Theory of Computing. Venkat received his Bachelor's degree from the Indian Institute of Technology, Madras, and his Ph.D. from MIT.
Venkat's research interests include coding theory, constraint satisfaction, approximate optimization, and computational complexity. He is the Editor-in-Chief of JACM, and was previously president of the Computational Complexity Foundation. Venkat is a recipient of the Presburger Award, a Simons Investigator award, Guggenheim, Packard and Sloan Fellowships, the ACM Doctoral Dissertation Award, and a distinguished alumnus award from IIT Madras. He is a fellow of the ACM, IEEE, and AMS.
Title
To appear.
Abstract
To appear.
Ken-ichi Kawarabayashi (National Institute of Informatics, Japan)
Biography
Ken-ichi Kawarabayashi has been a professor at the National Institute of Informatics since 2009 and became a professor at the University of Tokyo in 2022. From 2019 to 2021, he also served as the deputy director general of the National Institute of Informatics. His research interests include graph theory, combinatorics, scalable algorithms, combinatorial optimization, and their application to machine learning, as well as the theoretical analysis of deep learning. In addition to his academic roles, Ken-ichi serves as an editor for Algorithmica, Journal of Graph Theory, Graphs and Combinatorics, TheoriTCS, and four other prestigious journals. He has been recognized with SODA'13 best paper award, Japan Academy medal in 2013, and the Fulkerson Prize in 2021 for his contributions to the field.
Title
To appear.
Abstract
To appear.
Daniel Lokshtanov (University of California, Santa Barbara)
Biography
Daniel Lokshtanov is a Professor of Computer Science at UCSB, and a Visiting Professor at the University of Bergen. He received his PhD in Computer Science (2009), from the University of Bergen. Lokshtanov spent two years (2010-2012) as a Simons Postdoctoral Fellow at University of California at San Diego. His main research interests are in graph algorithms, parameterized algorithms and complexity. He is a recipient of the Meltzer prize, and a co-author of the Parameterized Algorithms book and the Kernelization book.
Title
To appear.
Abstract
To appear.