Sundar Vishwanathan

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 11

Top Topics

Maximum Matching

Service Systems

Related Problems

Broadly Applicable

Top Venues

Publications

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