On Randomized Algorithms for Matching in the Online Preemptive Model. - Ashish Chiplunkar; Sumedh Tirodkar; Sundar Vishwanathan (ESA, 2015)

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams. - Sagar Kale; Sumedh Tirodkar (APPROX-RANDOM, 2017)

Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models. - Sumedh Tirodkar; Sundar Vishwanathan (COCOON, 2017)

On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems. - Sumedh Tirodkar; Sundar Vishwanathan (Algorithmica, 2017)

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams. - Sagar Kale; Sumedh Tirodkar; Sundar Vishwanathan (CoRR, 2017)

Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model. - Sumedh Tirodkar (FSTTCS, 2018)

Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models. - Sumedh Tirodkar; Sundar Vishwanathan (Algorithmica, 2019)