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:
Karthik C. S.
It appears you don't have a PDF plugin for this browser.
No biggie... you can
click here to
download the PDF file. ...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 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