National and International Experts

Dr. Amit Deshpande
Microsoft Research

Amit Deshpande is a researcher in Microsoft Research, where he works in theoretical computer science and machine learning. His research interests include fairness and robustness of models in supervised and unsupervised learning, and sampling techniques for subsampling large data to efficiently explore, summarize, and learn. He received his undergraduate degree in Mathematics and Computer Science from CMI and his Ph.D. in Applied Mathematics from MIT.

Dr. Fahad Panolan
IIT Hyderbad

Fahad Panolan is an Assistant Professor in the department of Computer Science and Engineering, IIT Hyderabad, India. Prior to joining IITH, he was a PostDoc in the department of Informatics, University of Bergen, Norway, hosted by Prof. Fedor V. Fomin. he obtained PhD in Theoretical Computer Science from The Institute of mathematical sciences, Chennai, India under the supervision of Prof. Saket Saurabh in 2015. He works in the areas of Parameterized Algorithms and Complexity, Graph theory and graph algorithms, Approximation algorithms, and Streaming algorithms

Prof. Fedor Fomin
University of Bergen, Norway

Fedor Fomin is a professor in computer science at the University of Bergen, researching Algorithms and Combinatorics. In 2019 he was named an EATCS (European Association for Theoretical Computer Science) Fellow for "his fundamental contributions in the fields of parameterized complexity and exponential algorithms". He is elected member of The Norwegian Academy of Science and Letters, the Norwegian Academy of Technological Sciences, and the Academia Europaea.

Dr. Nimrod Talmon
Ben-Gurion University of the Negev

Nimrod Talmon is a researcher and lecturer at Ben-Gurion University, Israel, and a consultant at Weizmann Institute of Science, Israel. His main research interests include the development and analysis of algorithms, in the context of computational social choice, eDemocracy, and social networks. He has Erdos number 3, Sabbath number 7, and, arguably, Bacon number 6.

Dr. Rohit Vaish
IIT Delhi

Rohit Vaish is an Assistant Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Delhi. Previously, he was a postdoctoral researcher at Tata Institute of Fundamental Research and at Rensselaer Polytechnic Institute, and prior to that, completed his PhD from Indian Institute of Science. His research is in problems at the interface of computer science and economics; specifically in the area of computational social choice, spanning topics such as voting, matching, and fair division.

Prof. Saket Saurabh
IMSc, Chennai

Saket Saurabh is currently a professor of Theoretical Computer Science at the Institute of Mathematical Sciences, Chennai (IMSc), India and an adjunct faculty at University of Bergen, Norway. He specializes in parameterized complexity, exact algorithms, graph algorithms and game theory. His fundamental contributions to the area of parameterized complexity include procedures for obtaining algorithmic lower bounds, and meta-theorems on preprocessing. He is a co-author of two books: Parameterized Algorithms and Kernelization theory of parameterized preprocessing. He is a SwarnaJayanti Fellow in Mathematical Sciences (2018), Fellow of Indian Academy of Sciences (2020), Academia Europaea (2020), and European Association for Theoretical Computer Science (EATCS, 2021). He received the inaugural ACM India Early Career Researcher Award in 2020, and Shanti Swarup Bhatnagar Prize (SSB) for Science and Technology 2021Mathematical Science). He is also recipient of an ERC starting grant and an ERC Consolidator Grants in parameterized algorithms.

Dr. Sushmita Gupta
IMSc, Chennai

Sushmita Gupta is a faculty member at the Institute of Mathematical Sciences, Chennai. Prior to this she was a faculty member at the National Institute of Science Education and Research (NISER). She works in theoretical computer science, in the field of design and analysis of algorithms, specialising in computational social choice and algorithmic game theory.

Speakers from CSE@IITJ

Dr. Kshitij Gajjar
IIT Jodhpur

Kshitij Gajjar's primary research interests are algorithms, graph theory and combinatorics. He completed his Ph.D. from the Tata Institute of Fundamental Research, following which he held postdoc positions at the Technion, Israel, and the National University of Singapore. He is currently an assistant professor at the Indian Institute of Technology Jodhpur.

Dr. Lawqueen Kanesh
IIT Jodhpur

Lawqueen Kanesh is an assistant professor in the department of Computer Science and Engineering at IIT Jodhpur. Her research interests are Parameterized Complexity and Algorithms, Approximation Algorithms, Model Counting, Kernelization, and Graph Theory. She was a visiting researcher at the University of Warwick, UK from February 2022 to July 2022. Prior to that she was a postdoctoral researcher at the National University of Singapore from January 2021 to January 2022. She completed her Ph.D. in December 2020 in Theoretical Computer Science from the Institute of Mathematical Sciences, Chennai.

Dr. Pallavi Jain
IIT Jodhpur

Pallavi Jain is an Assistant Professor at the Department of Computer Science and Engineering, IIT Jodhpur, India. Before joining IIT Jodhpur, she was a Postdoctoral fellow at Ben-Gurion University of the Negev, Be'er Sheva, Israel. Prior to that, she was a SERB-NPDF at The Institute of Mathematical Science, Chennai, India. She received her Ph.D. from Dayalbagh Educational Institute, Agra, India. Her areas of interest are Parameterized Complexity and Algorithms, Kernelization, Graph Algorithms, and Computational Social Choice Theory.

Dr. Vimal Raj Sharma
IIT Jodhpur

Vimal Raj Sharma is an assistant professor in the Department of Computer Science and Engineering at IIT Jodhpur. Previously, he was a Computer Science Postdoctoral Fellow at Chennai Mathematical Institute. He obtained his PhD in Computer Science & Engineering from IIT Kanpur in 2022. He is broadly interested in complexity theory and algorithms. Specifically, his work centres around space complexity theory, where he has established relations between various space complexity classes and given new space upper bounds for natural problems such as Reachability and Matching.