Surender Baswana, IITK |
Vital edges and sensitivity oracles for (s,t)-mincuts |
Barna Saha, UCSD |
Sublinear Time Algorithms for Computing Edit Distance |
Sayan Bhattacharya |
Recent Advances in Dynamic Matching |
Sujoy Bhore, IITB |
Euclidean Steiner Spanner: Light and Sparse |
Mrinal Kumar, TIFR |
Fast multivariate multipoint evaluation |
Akanksha Agrawal, IITM |
Computing Square Colorings |
Roohani Sharma, MPI |
Flow-augmentation: advances in parameterized (weighted) cut problems |
Prajakta Nimbhorkar, CMI |
Matchings with Fairness Constraints |
Sutanu Gayen, IITK |
FPRAS for computing the total variation distance in large dimensions |
Arijit Ghosh, ISI Kolkata |
Testing of Index-Invariant Properties in the Huge Object Model |
Rohit Gurjar, IITB |
Greedy algorithms, matroids, and parallel complexity |
Nithin Varma, CMI |
Improved sublinear algorithms for testing permutation freeness |
Raghu Meka, UCLA |
Strong bounds for three-term progressions |