A forum to bring together the Indian algorithmic research community, and understand deep and insightful results from the leading experts in the area. There will be a set of expository talks, each two hours long.

List of speakers:

Popular Matchings and Witnesses Kavitha Telikepalli TIFR		Hardness of Approximation for Metric Clustering Karthik C. S. Rutgers University		Recent Trends in Minimum Cut Algorithms Debmalya Panigrahi Duke University
Approximation Algorithm for Maximum Independent Set of Rectangles Arindam Khan IISc		Algorithms for Fair Division and Collective Welfare Siddharth Barman IISc		Online Algorithms for Caching Amit Kumar IITD
Reverse Experience Replay: An Efficient Way to Learn with Dependent Data Praneeth Netrapalli Google Research		Aggregating a Data Set: Rankings to Strings Diptarka Chakraborty NUS		Deletion and Elimination to Hereditary Graph Classes Fahad Panolan IITH

Coordinators: Aritra Banik, Sushmita Gupta, and Vikram Sharma




...Epilogue

• Arindam Khan, Approximation Algorithm for Maximum Independent Set of Rectangles Slides
• Debmalya Panigrahi, Recent Trends in Minimum Cut Algorithms Slides
• Praneeth Netrapalli, Reverse Experience Replay: An Efficient Way to Learn with Dependent Data
• Diptarka Chakraborty, Aggregating a Data Set: Rankings to Strings Slide 1 Slide 2
• Amit Kumar, Online Algorithms for Caching Slide 1
• Karthik C. S., Hardness of Approximation for Metric Clustering
• Fahad Panolan, Deletion and Elimination to Hereditary Graph Classes
• Siddharth Barman, Algorithms for Fair Division and Collective Welfare
• Kavitha Telikepalli, Popular Matchings and Witnesses

The workshop is free of charge thanks to the support from The Institute of Mathematical Sciences