Image

Description

The school focuses on two themes. In the morning sessions, we will look at various graph theoretic problems that also model real-world affairs. We begin with problems that can be solved in polynomial time. Later on, we will see that not all the problems of our interest can be solved in polynomial time and fall under the category of NP-hard problems. Since many of these problems are essential and need to be solved, we will introduce various algorithmic tools to get around NP-hard problems in this school. Specifically, we will cover exact exponential algorithms, approximation algorithms, and parameterized algorithms.

In contemporary times, we need to handle extensive data and design algorithms that can process and work on a massive amount of data even when the whole data is unavailable to us in one go. This school will also introduce streaming algorithms that are useful when the algorithm has limited access to the memory, and the data is available only as streams and can be examined in only a few passes.

In the evening sessions, we will introduce various problems in game theory. Game theory is a vast field, and in this school, we will focus on Voting Theory, Stable Matching, and Fair Allocation. We will introduce various rules, axiomatic properties, algorithms, and research directions in these fields.

There will also be several group activities to demonstrate the applicability of some of these concepts in real-world scenarios using various fun games and puzzles.

We are also organizing a poster session at the end of the school. You are welcome to submit posters of your work in the related domain.
Best two posters will be awarded.


Important Dates

Registration Deadline: November 30, 2022
School: December 05 - 11, 2022
Poster Session: December 11, 2022.

Eligibility

The school is intended for graduate students working or who want to work in the area of Algorithms and related areas, and for motivated undergraduate students who are enthusiastic regarding these areas. People from the industry looking for exposure or those working or planning to work in this area will also find the school beneficial.



Organizing Committee

Text

Kshitij Gajjar

Text

Lawqueen Kanesh

Text

Mayank Vatsa

Text

Pallavi Jain

Text

Richa Singh

Text

Saket Saurabh

Text

Vimal Raj Sharma

Registration

Registration Fee for Domestic Participants:
For Academicians INR 2000/- for one Winter School.
INR 3000/- for both Winter Schools.
For Non-academicians INR 20000/- for one Winter school.
INR 25000/- for both Winter Schools.
Accommodation: INR 300/- per day for hostel room
Registration Fee for International Participants:
For Academicians 100 USD for one Winter School.
150 USD for both Winter Schools.
For Non-academicians 300 USD for one Winter school.
400 USD for both Winter Schools.
Accommodation: 5 USD per day if attending in-person














*Tax 18% GST for all participants.
*No refund after October 30, 2022.
*International participants may choose to attend online.


Registration-cum-Payment Link for Domestic Participants:
https://forms.eduqfix.com/iitwinterform/add

Registration Link for International Participants:
https://forms.ihub-drishti.ai/ihubdrishtifoundation/form/RegistrationFormWinterSchool/formperma/vZbg0iMMF_JsFNDMcUcSPTQuqjchqhdeJR_ut2k1uPU

Payment for International Participants:
Please transfer the amount shown on the registration page for the international participants and upload the payment receipt and transaction reference number in the registration page. The account details for transferring the registration fee are as follows:

  • Name of Account Holder: Research & Development IIT Jodhpur
  • Bank Name: HDFC
  • Branch Address: HDFC Bank Limited, 57 B, 9th Chopasani Road, Jodhpur 342003, Rajasthan.
  • IFSC Code of Branch: HDFC0000142
  • MICR Code: 342240002
  • Type of Bank Account: Saving Bank Account
  • Complete Bank Account Number: 01421000144666
  • Swift Code: HDFCINBBXXX

Fee Waivers:

  1. 100% school-fee waiver and travel reimbursement will be provided to selected domestic student-participants - those who have applied for a scholarship.
  2. 25% fee reimbursement will be provided to selected participants from the industry - those who have applied for a scholarship.
  3. 50% fee waiver for participants from start-ups and MSMEs - those who have applied for a scholarship.
  4. Regular IITJ students do not have to pay accommodation fees. Executive IITJ Students have to pay accommodation fees.
  5. No scholarship for International participants.

Note: If you would like to book another hostel room for your spouse etc., who will not be attending the classes, then you can pay for it by cash on the spot (after arrival on campus), Booking however will be on availabilty of hostel rooms. Please note that the male and female hostel rooms are separate.

National and International Experts

Image

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.


Image

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


Image

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.


Image

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.


Image

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.


Image

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.


Image

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

Image

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.


Image

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.


Image

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.


Image

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.


Date Program Time(IST)
Day:1
Dec 5, 2022 Inaugural Speech- Director 09:00 - 09:15
Introduction to the school- Prof. Saket Saurabh 09:30 - 10:30
Lecture 1: Basics of Matching Theory 10:45 -11:45
Lecture 2: Matching and Vertex Cover 12:15 - 13:15
Lunch (13:15 - 14:30)
Lecture 3: Matching on one sided preferences- Dr. Sushmita Gupta 14:30-15:30
Lecture 4: Voting Theory-I- Dr. Pallavi Jain 16:00 - 17:30
How to go abroad with no bank balance? 18:00-19:00
Day:2
Dec 6, 2022 Lecture 5: Polynomial time Algebraic Algorithms- Dr. Lawqueen Kanesh 09:30-10:30
Lecture 6: Foundation of hardness-I- Dr. Vimal Raj Sharma 10:45-11:45
Lecture 7: Lecture 7: Exact Exponential Algorithms-I- Dr. Lawqueen Kanesh 12:15-13:15
Lunch (13:15-14:30)
Lecture 8: Voting Theory -II- Dr. Pallavi Jain 14:30-15:30
Lecture 9: Matching on two sided preferences- Dr. Sushmita Gupta 16:00 - 17:30
Fun with Crypto- Prof. Somitra Sanadhya 18:00-19:00
Day:3
Dec 7, 2022 Lecture 10: Basics of Parameterized Complexity -I- Prof. Fedor Fomin 09:30-10:30
Lecture 11: Basics of Parameterized Complexity -II- Prof. Fedor Fomin 10:45-11:45
Lecture 12: Treewidth-I- Prof. Saket Saurabh 12:15-13:15
Lunch (13:15-14:30)
Lecture 13: Parameterized Intractability- Dr. Lawqueen Kanesh 14:30-15:30
Lecture 14: Treewidth-II- Prof. Saket Saurabh 16:00 - 17:30
Fun with algorithms 18:00-19:00
Day:4
Dec 8, 2022 Lecture 15: Approximation-I- Prof. Saket Saurabh 09:30-10:30
Lecture 16: Approximation-II- Dr. Fahad Panolan 10:45-11:45
Lecture 17: Foundation of hardness-II- Dr. Vimal Raj Sharma 12:15-13:15
Lunch (13:15-14:00)
city tour 14:00
Day:5
Dec 9, 2022 Lecture 18: Fair Allocation-I- Dr. Rohit Vaish 09:30-10:30
Lecture 19: Approximation-III- Dr. Fahad Panolan 10:45-11:45
Lecture 20: Fair Allocation-II- Dr. Rohit Vaish 12:15-13:15
Lunch (13:15-14:30)
Lecture 21: Voting Theory -III (PB)- Dr. Nimrod Talmon 114:30-15:30
Lecture 22: FPT Approximation- Prof. Saket Saurabh 16:00 - 17:30
Algorithm Quiz with chocolates and snacks 18:00 - 19:00
Day:6
Dec 10, 2022 Lecture 23 : Fair Allocation-III- Dr. Rohit Vaish 09:30-10:30
Lecture 24: Small space algorithms -I- Prof. Saket Saurabh 10:45-11:45
Lecture 25: Fair Allocation-IV- Dr. Rohit Vaish 12:15-13:15
Lunch (13:15-14:30)
Lecture 26: Small space algorithms-II- Dr. Fahad Panolan 14:30-15:30
Research Direction in Voting Theory & Fair Allocation - Dr. Nimrod Talmon, Dr. Rohit Vaish 16:00 - 17:30
Day:7
Dec 11, 2022 Poster Session 9:30 - 11:30
Theory of ML 11:30-13:00

For any comments/enquiries/feedback, please contact @
(0291) 2801252, office_cse [at] iitj.ac.in