Sundar Vishwanathan

59 papers A* 9A 2B 1Misc 3Journal 41Unranked 3
YearRankTypeTitle / Venue / Authors
2026 A conf
Lower Bounds and Separations for Torus Polynomials.
ITCS
Vaibhav Krishan, Sundar Vishwanathan
2024 J jnl
Towards ACC Lower Bounds using Torus Polynomials.
Electron. Colloquium Comput. Complex.
Vaibhav Krishan, Sundar Vishwanathan
2021 J jnl
Multicovering hypergraphs.
Discret. Math.
Anand Babu, Sundar Vishwanathan
2020 J jnl
Randomized Memoryless Algorithms for the Weighted and the Generalized
ACM Trans. Algorithms
Ashish Chiplunkar, Sundar Vishwanathan
2019 J jnl
Bounds for the Graham-Pollak theorem for hypergraphs.
Discret. Math.
Anand Babu, Sundar Vishwanathan
2019 J jnl
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models.
Algorithmica
Sumedh Tirodkar, Sundar Vishwanathan
2017 J jnl
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams.
CoRR
Sagar Kale, Sumedh Tirodkar, Sundar Vishwanathan
2017 Misc conf
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models.
COCOON
Sumedh Tirodkar, Sundar Vishwanathan
2017 Misc conf
Multi-channel allocation to coexisting networks in TV white spaces.
COMSNETS
Akanksha Patel, Sundar Vishwanathan, Bhaskaran Raman
2017 J jnl
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems.
Algorithmica
Sumedh Tirodkar, Sundar Vishwanathan
2016 J jnl
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models.
CoRR
Sumedh Tirodkar, Sundar Vishwanathan
2015 — conf
Approximating the Regular Graphic TSP in Near Linear Time.
FSTTCS
Ashish Chiplunkar, Sundar Vishwanathan
2015 J jnl
Metrical Service Systems with Multiple Servers.
Algorithmica
Ashish Chiplunkar, Sundar Vishwanathan
2015 J jnl
On Graph Parameters Guaranteeing Fast Sandpile Diffusion.
Electron. J. Comb.
Ayush Choure, Sundar Vishwanathan
2015 A conf
On Randomized Algorithms for Matching in the Online Preemptive Model.
ESA
Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan
2015 B conf
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems.
ISAAC
Sumedh Tirodkar, Sundar Vishwanathan
2014 J jnl
Approximating Regular Graphic TSP in near linear time.
CoRR
Ashish Chiplunkar, Sundar Vishwanathan
2014 J jnl
On Randomized Algorithms for Matching in the Online Preemptive Model.
CoRR
Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan
2013 J jnl
A counting proof of the Graham-Pollak Theorem.
Discret. Math.
Sundar Vishwanathan
2013 J jnl
Circumference, chromatic number and online coloring.
Comb.
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
2013 Misc conf
Metrical Service Systems with Multiple Servers.
COCOON
Ashish Chiplunkar, Sundar Vishwanathan
2013 A* conf
On Randomized Memoryless Algorithms for the Weighted K-Server Problem.
FOCS
Ashish Chiplunkar, Sundar Vishwanathan
2013 J jnl
On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem
CoRR
Ashish Chiplunkar, Sundar Vishwanathan
2012 J jnl
Metrical Service Systems with Multiple Servers
CoRR
Ashish Chiplunkar, Sundar Vishwanathan
2012 J jnl
On graph parameters guaranteeing fast Sandpile diffusion
CoRR
Ayush Choure, Sundar Vishwanathan
2012 A* conf
Random walks, electric networks and the transience class problem of sandpiles.
SODA
Ayush Choure, Sundar Vishwanathan
2011 J jnl
Random Walks, Electric Networks and The Transience Class problem of Sandpiles
CoRR
Ayush Choure, Sundar Vishwanathan
2010 J jnl
Approximation algorithms for the Bipartite Multicut problem.
Inf. Process. Lett.
Sreyash Kenkre, Sundar Vishwanathan
2010 — conf
MAP estimation in Binary MRFs via Bipartite Multi-cuts.
NIPS
Sashank Jakkam Reddi, Sunita Sarawagi, Sundar Vishwanathan
2009 J jnl
Bipartite Coverings and the Chromatic Number.
Electron. J. Comb.
Dhruv Mubayi, Sundar Vishwanathan
2008 J jnl
A polynomial space proof of the Graham-Pollak theorem.
J. Comb. Theory A
Sundar Vishwanathan
2008 J jnl
Circumference, Chromatic Number and Online Coloring
CoRR
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
2008 J jnl
Matched-Factor $d$-Domatic Coloring of Graphs.
SIAM J. Discret. Math.
K. S. Sudeep, Sundar Vishwanathan
2008 J jnl
On hard instances of approximate vertex cover.
ACM Trans. Algorithms
Sundar Vishwanathan
2008 J jnl
The common prefix problem on trees.
Inf. Process. Lett.
Sreyash Kenkre, Sundar Vishwanathan
2007 J jnl
A bound on the chromatic number using the longest odd cycle length.
J. Graph Theory
Sreyash Kenkre, Sundar Vishwanathan
2007 J jnl
Some results in square-free and strong square-free edge-colorings of graphs.
Discret. Math.
K. S. Sudeep, Sundar Vishwanathan
2006 J jnl
Approximation Algorithms for the Bipartite Multi-cut Problem
CoRR
Sreyash Kenkre, Sundar Vishwanathan
2006 J jnl
The Common Prefix Problem On Trees
CoRR
Sreyash Kenkre, Sundar Vishwanathan
2005 J jnl
A technique for multicoloring triangle-free hexagonal graphs.
Discret. Math.
K. S. Sudeep, Sundar Vishwanathan
2004 J jnl
An approximation algorithm for finding long paths in Hamiltonian graphs.
J. Algorithms
Sundar Vishwanathan
2003 J jnl
On 2-coloring certain k-uniform hypergraphs.
J. Comb. Theory A
Sundar Vishwanathan
2001 J jnl
Approximation Algorithms for the Achromatic Number.
J. Algorithms
Amitabh Chaudhary, Sundar Vishwanathan
2001 J jnl
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
CoRR
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
2000 A* conf
An approximation algorithm for finding a long path in Hamiltonian graphs.
SODA
Sundar Vishwanathan
2000 — conf
Depth-3 Arithmetic Circuits for S
FSTTCS
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
1999 J jnl
Multilinear Polynomials and a Conjecture of Frankl and Füredi.
J. Comb. Theory A
Arvind Sankar, Sundar Vishwanathan
1998 J jnl
An O(log* n) Approximation Algorithm for the Asymmetric
J. Algorithms
Rina Panigrahy, Sundar Vishwanathan
1998 J jnl
Competitive Algorithms for Layered Graph Traversal.
SIAM J. Comput.
Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
1997 A* conf
Approximation Algorithms for the Achromatic Number.
SODA
Amitabh Chaudhary, Sundar Vishwanathan
1996 A* conf
An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem.
SODA
Sundar Vishwanathan
1995 J jnl
Constructing Reliable Communication Networks of Small Weight Online.
J. Algorithms
Barun Chandra, Sundar Vishwanathan
1993 A* conf
Locality based graph coloring.
STOC
Mario Szegedy, Sundar Vishwanathan
1992 J jnl
An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two.
Inf. Process. Lett.
Sundar Vishwanathan
1992 J jnl
Randomized Online Graph Coloring.
J. Algorithms
Sundar Vishwanathan
1991 A* conf
Competitive Algorithms for Layered Graph Traversal
FOCS
Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
1991 J jnl
New Results on Server Problems.
SIAM J. Discret. Math.
Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
1990 A* conf
New Results on Server Problems.
SODA
Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
1990 A* conf
Randomized Online Graph Coloring (Preliminary Version)
FOCS
Sundar Vishwanathan