Randomized Online Graph Coloring (Preliminary Version) - Sundar Vishwanathan (FOCS, 1990)

New Results on Server Problems. - Marek Chrobak; Howard J. Karloff; T. H. Payne; Sundar Vishwanathan (SIAM J. Discret. Math., 1991)

An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two. - Sundar Vishwanathan (Inf. Process. Lett., 1992)

Randomized Online Graph Coloring. - Sundar Vishwanathan (J. Algorithms, 1992)

Locality based graph coloring. - Mario Szegedy; Sundar Vishwanathan (STOC, 1993)

Constructing Reliable Communication Networks of Small Weight Online. - Barun Chandra; Sundar Vishwanathan (J. Algorithms, 1995)

An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. - Sundar Vishwanathan (SODA, 1996)

An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. - Rina Panigrahy; Sundar Vishwanathan (J. Algorithms, 1998)

Competitive Algorithms for Layered Graph Traversal. - Amos Fiat; Dean P. Foster; Howard J. Karloff; Yuval Rabani; Yiftach Ravid; Sundar Vishwanathan (SIAM J. Comput., 1998)

Multilinear Polynomials and a Conjecture of Frankl and Füredi. - Arvind Sankar; Sundar Vishwanathan (J. Comb. Theory A, 1999)

Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. - Jaikumar Radhakrishnan; Pranab Sen; Sundar Vishwanathan (FSTTCS, 2000)

An approximation algorithm for finding a long path in Hamiltonian graphs. - Sundar Vishwanathan (SODA, 2000)

Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem - Jaikumar Radhakrishnan; Pranab Sen; Sundar Vishwanathan (CoRR, 2001)

Approximation Algorithms for the Achromatic Number. - Amitabh Chaudhary; Sundar Vishwanathan (J. Algorithms, 2001)

On 2-coloring certain k-uniform hypergraphs. - Sundar Vishwanathan (J. Comb. Theory A, 2003)

An approximation algorithm for finding long paths in Hamiltonian graphs. - Sundar Vishwanathan (J. Algorithms, 2004)

A technique for multicoloring triangle-free hexagonal graphs. - K. S. Sudeep; Sundar Vishwanathan (Discret. Math., 2005)

Approximation Algorithms for the Bipartite Multi-cut Problem - Sreyash Kenkre; Sundar Vishwanathan (CoRR, 2006)

Some results in square-free and strong square-free edge-colorings of graphs. - K. S. Sudeep; Sundar Vishwanathan (Discret. Math., 2007)

A bound on the chromatic number using the longest odd cycle length. - Sreyash Kenkre; Sundar Vishwanathan (J. Graph Theory, 2007)

The common prefix problem on trees. - Sreyash Kenkre; Sundar Vishwanathan (Inf. Process. Lett., 2008)

A polynomial space proof of the Graham-Pollak theorem. - Sundar Vishwanathan (J. Comb. Theory A, 2008)

Matched-Factor $d$-Domatic Coloring of Graphs. - K. S. Sudeep; Sundar Vishwanathan (SIAM J. Discret. Math., 2008)

On hard instances of approximate vertex cover. - Sundar Vishwanathan (ACM Trans. Algorithms, 2008)

Bipartite Coverings and the Chromatic Number. - Dhruv Mubayi; Sundar Vishwanathan (Electron. J. Comb., 2009)

MAP estimation in Binary MRFs via Bipartite Multi-cuts. - Sashank Jakkam Reddi; Sunita Sarawagi; Sundar Vishwanathan (NIPS, 2010)

Approximation algorithms for the Bipartite Multicut problem. - Sreyash Kenkre; Sundar Vishwanathan (Inf. Process. Lett., 2010)

Random walks, electric networks and the transience class problem of sandpiles. - Ayush Choure; Sundar Vishwanathan (SODA, 2012)

On Randomized Memoryless Algorithms for the Weighted K-Server Problem. - Ashish Chiplunkar; Sundar Vishwanathan (FOCS, 2013)

Circumference, chromatic number and online coloring. - Ajit A. Diwan; Sreyash Kenkre; Sundar Vishwanathan (Comb., 2013)

On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem - Ashish Chiplunkar; Sundar Vishwanathan (CoRR, 2013)

A counting proof of the Graham-Pollak Theorem. - Sundar Vishwanathan (Discret. Math., 2013)

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

Approximating the Regular Graphic TSP in Near Linear Time. - Ashish Chiplunkar; Sundar Vishwanathan (FSTTCS, 2015)

Metrical Service Systems with Multiple Servers. - Ashish Chiplunkar; Sundar Vishwanathan (Algorithmica, 2015)

On Graph Parameters Guaranteeing Fast Sandpile Diffusion. - Ayush Choure; Sundar Vishwanathan (Electron. J. Comb., 2015)

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

Multi-channel allocation to coexisting networks in TV white spaces. - Akanksha Patel; Sundar Vishwanathan; Bhaskaran Raman (COMSNETS, 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)

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

Bounds for the Graham-Pollak theorem for hypergraphs. - Anand Babu; Sundar Vishwanathan (Discret. Math., 2019)

Randomized Memoryless Algorithms for the Weighted and the Generalized k-server Problems. - Ashish Chiplunkar; Sundar Vishwanathan (ACM Trans. Algorithms, 2020)

Multicovering hypergraphs. - Anand Babu; Sundar Vishwanathan (Discret. Math., 2021)

Towards ACC Lower Bounds using Torus Polynomials. - Vaibhav Krishan; Sundar Vishwanathan (Electron. Colloquium Comput. Complex., 2024)