| 2017 | COCOON | Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models. | Sumedh Tirodkar, Sundar Vishwanathan |
| 2017 | COMSNETS | Multi-channel allocation to coexisting networks in TV white spaces. | Akanksha Patel, Sundar Vishwanathan, Bhaskaran Raman |
| 2015 | ESA | On Randomized Algorithms for Matching in the Online Preemptive Model. | Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan |
| 2015 | ISAAC | On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems. | Sumedh Tirodkar, Sundar Vishwanathan |
| 2013 | COCOON | Metrical Service Systems with Multiple Servers. | Ashish Chiplunkar, Sundar Vishwanathan |
| 2013 | FOCS | On Randomized Memoryless Algorithms for the Weighted K-Server Problem. | Ashish Chiplunkar, Sundar Vishwanathan |
| 2012 | SODA | Random walks, electric networks and the transience class problem of sandpiles. | Ayush Choure, Sundar Vishwanathan |
| 2000 | SODA | An approximation algorithm for finding a long path in Hamiltonian graphs. | Sundar Vishwanathan |
| 1997 | SODA | Approximation Algorithms for the Achromatic Number. | Amitabh Chaudhary, Sundar Vishwanathan |
| 1996 | SODA | An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. | Sundar Vishwanathan |
| 1993 | STOC | Locality based graph coloring. | Mario Szegedy, Sundar Vishwanathan |
| 1991 | FOCS | Competitive Algorithms for Layered Graph Traversal | Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan |
| 1990 | FOCS | Randomized Online Graph Coloring (Preliminary Version) | Sundar Vishwanathan |
| 1990 | SODA | New Results on Server Problems. | Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan |