Sundar Vishwanathan

According to our database, Sundar Vishwanathan authored at least 44 papers between 1990 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Multicovering hypergraphs.

Anand Babu, Sundar Vishwanathan

Discret. Math., 2021

2020

Randomized Memoryless Algorithms for the Weighted and the Generalized <i>k</i>-server Problems.

Ashish Chiplunkar, Sundar Vishwanathan

ACM Trans. Algorithms, 2020

2019

Bounds for the Graham-Pollak theorem for hypergraphs.

Anand Babu, Sundar Vishwanathan

Discret. Math., 2019

Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models.

Sumedh Tirodkar, Sundar Vishwanathan

Algorithmica, 2019

2017

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams.

Sagar Kale, Sumedh Tirodkar, Sundar Vishwanathan

CoRR, 2017

On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems.

Sumedh Tirodkar, Sundar Vishwanathan

Algorithmica, 2017

Multi-channel allocation to coexisting networks in TV white spaces.

Akanksha Patel, Sundar Vishwanathan, Bhaskaran Raman

Proceedings of the 9th International Conference on Communication Systems and Networks, 2017

Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models.

Sumedh Tirodkar, Sundar Vishwanathan

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2015

On Graph Parameters Guaranteeing Fast Sandpile Diffusion.

Ayush Choure, Sundar Vishwanathan

Electron. J. Comb., 2015

Metrical Service Systems with Multiple Servers.

Ashish Chiplunkar, Sundar Vishwanathan

Algorithmica, 2015

Approximating the Regular Graphic TSP in Near Linear Time.

Ashish Chiplunkar, Sundar Vishwanathan

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

On Randomized Algorithms for Matching in the Online Preemptive Model.

Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan

Proceedings of the Algorithms - ESA 2015, 2015

2013

A counting proof of the Graham-Pollak Theorem.

Sundar Vishwanathan

Discret. Math., 2013

On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem

Ashish Chiplunkar, Sundar Vishwanathan

CoRR, 2013

Circumference, chromatic number and online coloring.

Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan

Comb., 2013

On Randomized Memoryless Algorithms for the Weighted K-Server Problem.

Ashish Chiplunkar, Sundar Vishwanathan

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Random walks, electric networks and the transience class problem of sandpiles.

Ayush Choure, Sundar Vishwanathan

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010

Approximation algorithms for the Bipartite Multicut problem.

Sreyash Kenkre, Sundar Vishwanathan

Inf. Process. Lett., 2010

MAP estimation in Binary MRFs via Bipartite Multi-cuts.

Sashank Jakkam Reddi, Sunita Sarawagi, Sundar Vishwanathan

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009

Bipartite Coverings and the Chromatic Number.

Dhruv Mubayi, Sundar Vishwanathan

Electron. J. Comb., 2009

2008

On hard instances of approximate vertex cover.

Sundar Vishwanathan

ACM Trans. Algorithms, 2008

Matched-Factor $d$-Domatic Coloring of Graphs.

K. S. Sudeep, Sundar Vishwanathan

SIAM J. Discret. Math., 2008

A polynomial space proof of the Graham-Pollak theorem.

Sundar Vishwanathan

J. Comb. Theory, Ser. A, 2008

The common prefix problem on trees.

Sreyash Kenkre, Sundar Vishwanathan

Inf. Process. Lett., 2008

2007

A bound on the chromatic number using the longest odd cycle length.

Sreyash Kenkre, Sundar Vishwanathan

J. Graph Theory, 2007

Some results in square-free and strong square-free edge-colorings of graphs.

K. S. Sudeep, Sundar Vishwanathan

Discret. Math., 2007

2006

Approximation Algorithms for the Bipartite Multi-cut Problem

Sreyash Kenkre, Sundar Vishwanathan

CoRR, 2006

2005

A technique for multicoloring triangle-free hexagonal graphs.

K. S. Sudeep, Sundar Vishwanathan

Discret. Math., 2005

2004

An approximation algorithm for finding long paths in Hamiltonian graphs.

Sundar Vishwanathan

J. Algorithms, 2004

2003

On 2-coloring certain k-uniform hypergraphs.

Sundar Vishwanathan

J. Comb. Theory, Ser. A, 2003

2001

Approximation Algorithms for the Achromatic Number.

Amitabh Chaudhary, Sundar Vishwanathan

J. Algorithms, 2001

Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem

Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan

CoRR, 2001

2000

An approximation algorithm for finding a long path in Hamiltonian graphs.

Sundar Vishwanathan

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Depth-3 Arithmetic Circuits for S_n²(X) and Extensions of the Graham-Pollack Theorem.

Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

Multilinear Polynomials and a Conjecture of Frankl and Füredi.

Arvind Sankar, Sundar Vishwanathan

J. Comb. Theory, Ser. A, 1999

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

An O(log* n) Approximation Algorithm for the Asymmetric <i>p</i>-Center Problem.

Rina Panigrahy, Sundar Vishwanathan

J. Algorithms, 1998

1996

An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem.

Sundar Vishwanathan

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Constructing Reliable Communication Networks of Small Weight Online.

Barun Chandra, Sundar Vishwanathan

J. Algorithms, 1995

1993

Locality based graph coloring.

Mario Szegedy, Sundar Vishwanathan

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Randomized Online Graph Coloring.

Sundar Vishwanathan

J. Algorithms, 1992

An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two.

Sundar Vishwanathan

Inf. Process. Lett., 1992

1991

New Results on Server Problems.

Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan

SIAM J. Discret. Math., 1991

1990

Randomized Online Graph Coloring (Preliminary Version)

Sundar Vishwanathan

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990