papers
Publications (15)
cs.DM2012
Random Walks, Electric Networks and The Transience Class problem of Sandpiles
Ayush Choure, Sundar Vishwanathan
cs.DS2015
On Randomized Algorithms for Matching in the Online Preemptive Model
Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan
math.CO2017
Bounds for the Graham-Pollak Theorem for Hypergraphs
Anand Babu, Sundar Vishwanathan
math-ph2013
Improved bounds on the sandpile diffusions on Grid graphs
Ayush Choure, Sundar Vishwanathan
cs.DM2008
Circumference, Chromatic Number and Online Coloring
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
cs.DM2001
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
cs.DS2006
The Common Prefix Problem On Trees
Sreyash Kenkre, Sundar Vishwanathan
math.CO2011
A Counting Proof of the Graham Pollak Theorem
Sundar Vishwanathan
cs.CC2006
Approximation Algorithms for the Bipartite Multi-cut Problem
Sreyash Kenkre, Sundar Vishwanathan
cs.DS2014
Approximating the Regular Graphic TSP in near linear time
Ashish Chiplunkar, Sundar Vishwanathan
cs.DS2014
On Randomized Memoryless Algorithms for the Weighted $k$-server Problem
Ashish Chiplunkar, Sundar Vishwanathan
cs.DS2014
Metrical Service Systems with Multiple Servers
Ashish Chiplunkar, Sundar Vishwanathan
math.CO2009
Biclique Coverings and the Chromatic Number
Dhruv Mubayi, Sundar Vishwanathan
cs.DM2012
On graph parameters guaranteeing fast Sandpile diffusion
Ayush Choure, Sundar Vishwanathan
cs.DS2018
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models
Sumedh Tirodkar, Sundar Vishwanathan