Sundar vishwanathan
机构: Professor of Computer Science and Engineering, IIT Bombay
每年引用次数
引用次数
引用: 1,562
H-指数: 19
I10-指数 : 26
出版物: 71
New results on server problems
M. Chrobak , H. Karloof , T. Payne , S. Vishwnathan
SIAM Journal on Discrete Mathematics 4 ( 2) 172 -181
194
1991
New ressults on server problems
Marek Chrobak , H Karloof , Tom Payne , Sundar Vishwnathan
SIAM Journal on Discrete Mathematics 4 ( 2) 172 -181
356
1991
An O(log*n) approximation algorithm for the asymmetric p-center problem
Sundar Vishwanathan
symposium on discrete algorithms 27 ( 2) 1 -5
51
1996
An approximation algorithm for finding a long path in Hamiltonian graphs
Sundar Vishwanathan
symposium on discrete algorithms 50 ( 2) 680 -685
21
2000
MAP estimation in Binary MRFs via Bipartite Multi-cuts
Sunita Sarawagi , Sashank J. Reddi , Sundar Vishwanathan
neural information processing systems 23 955 -963
1
2010
On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem
Ashish Chiplunkar , Sundar Vishwanathan
1
2013
Random walks, electric networks and the transience class problem of sandpiles
Ayush Choure , Sundar Vishwanathan
symposium on discrete algorithms 1593 -1611
2012
A coding perspective on the lower bound for diagonal Ramsey numbers.
Sundar Vishwanathan
arXiv: Combinatorics
2021
Approximation Algorithms for the Achromatic Number
Amitabh Chaudhary , Sundar Vishwanathan
Journal of Algorithms 41 ( 2) 404 -416
11
2001
Multilinear Polynomials and a Conjecture of Frankl and Füredi
Arvind Sankar , Sundar Vishwanathan
Journal of Combinatorial Theory, Series A 86 ( 1) 182 -186
3
1999
Bounds for the Graham-Pollak Theorem for Hypergraphs
Anand Babu , Sundar Vishwanathan
Discrete Mathematics 342 ( 11) 3177 -3181
1
2019
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
Sumedh Tirodkar , Sundar Vishwanathan
Algorithmica 79 ( 3) 909 -924
5
2017
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models
Sumedh Tirodkar , Sundar Vishwanathan
Algorithmica 81 ( 11) 4275 -4292
2019
Metrical Service Systems with Multiple Servers
Ashish Chiplunkar , Sundar Vishwanathan
Algorithmica 71 ( 1) 219 -231
1
2015
The common prefix problem on trees
Sreyash Kenkre , Sundar Vishwanathan
Information Processing Letters 105 ( 6) 245 -248
2
2008
Approximation algorithms for the Bipartite Multicut problem
Sreyash Kenkre , Sundar Vishwanathan
Information Processing Letters 110 ( 8) 282 -287
2
2010
On 2-coloring certain k -uniform hypergraphs
Sundar Vishwanathan
Journal of Combinatorial Theory, Series A 101 ( 1) 168 -172
11
2003
On hard instances of approximate vertex cover
Sundar Vishwanathan
ACM Transactions on Algorithms 5 ( 1) 7
7
2008
Matched-Factor $d$-Domatic Coloring of Graphs
K. S. Sudeep , Sundar Vishwanathan
SIAM Journal on Discrete Mathematics 21 ( 4) 1071 -1082
2008
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models
Sumedh Tirodkar , Sundar Vishwanathan
computing and combinatorics conference 504 -515
3
2017