Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sundar Vishwanathan
2010 – today
- 2013
[j20]Sundar Vishwanathan: A counting proof of the Graham-Pollak Theorem. Discrete Mathematics 313(6): 765-766 (2013)- [c11]Ashish Chiplunkar, Sundar Vishwanathan: Metrical Service Systems with Multiple Servers. COCOON 2013: 481-492
- [i9]Ashish Chiplunkar, Sundar Vishwanathan: On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem. CoRR abs/1301.0123 (2013)
- 2012
- [c10]Ayush Choure, Sundar Vishwanathan: Random walks, electric networks and the transience class problem of sandpiles. SODA 2012: 1593-1611
- [i8]Ashish Chiplunkar, Sundar Vishwanathan: Metrical Service Systems with Multiple Servers. CoRR abs/1206.5392 (2012)
- [i7]Ayush Choure, Sundar Vishwanathan: On graph parameters guaranteeing fast Sandpile diffusion. CoRR abs/1207.0421 (2012)
- [i6]Ayush Choure, Sundar Vishwanathan: Improved bounds on the sandpile diffusions on Grid graphs. CoRR abs/1210.4327 (2012)
- 2011
- [i5]Ayush Choure, Sundar Vishwanathan: Random Walks, Electric Networks and The Transience Class problem of Sandpiles. CoRR abs/1105.3368 (2011)
- 2010
- [j19]Sreyash Kenkre, Sundar Vishwanathan: Approximation algorithms for the Bipartite Multicut problem. Inf. Process. Lett. 110(8-9): 282-287 (2010)
- [c9]Sashank Jakkam Reddi, Sunita Sarawagi, Sundar Vishwanathan: MAP estimation in Binary MRFs via Bipartite Multi-cuts. NIPS 2010: 955-963
2000 – 2009
- 2009
- [j18]Dhruv Mubayi, Sundar Vishwanathan: Bipartite Coverings and the Chromatic Number. Electr. J. Comb. 16(1) (2009)
- 2008
- [j17]Sreyash Kenkre, Sundar Vishwanathan: The common prefix problem on trees. Inf. Process. Lett. 105(6): 245-248 (2008)
- [j16]Sundar Vishwanathan: A polynomial space proof of the Graham-Pollak theorem. J. Comb. Theory, Ser. A 115(4): 674-676 (2008)
- [j15]K. S. Sudeep, Sundar Vishwanathan: Matched-Factor $d$-Domatic Coloring of Graphs. SIAM J. Discrete Math. 21(4): 1071-1082 (2008)
- [j14]Sundar Vishwanathan: On hard instances of approximate vertex cover. ACM Transactions on Algorithms 5(1) (2008)
- [i4]Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan: Circumference, Chromatic Number and Online Coloring. CoRR abs/0809.1710 (2008)
- 2007
- [j13]K. S. Sudeep, Sundar Vishwanathan: Some results in square-free and strong square-free edge-colorings of graphs. Discrete Mathematics 307(14): 1818-1824 (2007)
- [j12]Sreyash Kenkre, Sundar Vishwanathan: A bound on the chromatic number using the longest odd cycle length. Journal of Graph Theory 54(4): 267-276 (2007)
- 2006
- [i3]Sreyash Kenkre, Sundar Vishwanathan: Approximation Algorithms for the Bipartite Multi-cut Problem. CoRR abs/cs/0609031 (2006)
- [i2]
- 2005
- [j11]K. S. Sudeep, Sundar Vishwanathan: A technique for multicoloring triangle-free hexagonal graphs. Discrete Mathematics 300(1-3): 256-259 (2005)
- 2004
- [j10]Sundar Vishwanathan: An approximation algorithm for finding long paths in Hamiltonian graphs. J. Algorithms 50(2): 246-256 (2004)
- 2003
- [j9]Sundar Vishwanathan: On 2-coloring certain k-uniform hypergraphs. J. Comb. Theory, Ser. A 101(1): 168-172 (2003)
- 2001
- [j8]Amitabh Chaudhary, Sundar Vishwanathan: Approximation Algorithms for the Achromatic Number. J. Algorithms 41(2): 404-416 (2001)
- [i1]Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan: Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem. CoRR cs.DM/0110031 (2001)
- 2000
- [c8]Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan: Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. FSTTCS 2000: 176-187
- [c7]Sundar Vishwanathan: An approximation algorithm for finding a long path in Hamiltonian graphs. SODA 2000: 680-685
1990 – 1999
- 1999
- [j7]Arvind Sankar, Sundar Vishwanathan: Multilinear Polynomials and a Conjecture of Frankl and Füredi. J. Comb. Theory, Ser. A 86(1): 182-186 (1999)
- 1998
- [j6]Rina Panigrahy, Sundar Vishwanathan: An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. J. Algorithms 27(2): 259-268 (1998)
- [j5]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): 447-462 (1998)
- 1997
- [c6]Amitabh Chaudhary, Sundar Vishwanathan: Approximation Algorithms for the Achromatic Number. SODA 1997: 558-563
- 1996
- [c5]Sundar Vishwanathan: An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. SODA 1996: 1-5
- 1995
- [j4]Barun Chandra, Sundar Vishwanathan: Constructing Reliable Communication Networks of Small Weight Online. J. Algorithms 18(1): 159-175 (1995)
- 1993
- [c4]
- 1992
- [j3]Sundar Vishwanathan: An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two. Inf. Process. Lett. 44(6): 297-302 (1992)
- [j2]
- 1991
- [j1]Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: New Results on Server Problems. SIAM J. Discrete Math. 4(2): 172-181 (1991)
- [c3]Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan: Competitive Algorithms for Layered Graph Traversal. FOCS 1991: 288-297
- 1990
- [c2]
- [c1]Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: title=New Results on Server Problems. SODA 1990: 291-300
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:16 CEST by the dblp team