Sundar vishwanathan
机构: Professor of Computer Science and Engineering, IIT Bombay
每年引用次数
引用次数
引用: 1,562
H-指数: 19
I10-指数 : 26
出版物: 71
On Randomized Memoryless Algorithms for the Weighted K-Server Problem
Ashish Chiplunkar , Sundar Vishwanathan
2013 IEEE 54th Annual Symposium on Foundations of Computer Science 11 -19
4
2013
Randomized Memoryless Algorithms for the Weighted and the Generalized k-server Problems
Ashish Chiplunkar , Sundar Vishwanathan
ACM Transactions on Algorithms 16 ( 1) 1 -28
2
2019
Bipartite Coverings and the Chromatic Number
Dhruv Mubayi , Sundar Vishwanathan
Electronic Journal of Combinatorics 16 ( 1) 34
4
2009
On Graph Parameters Guaranteeing Fast Sandpile Diffusion
Ayush Choure , Sundar Vishwanathan
Electronic Journal of Combinatorics 22 ( 1) 1 -44
2015
An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
Sundar Vishwanathan
Information Processing Letters 44 ( 6) 297 -302
42
1992
Circumference, chromatic number and online coloring
Ajit A. Diwan , Sreyash Kenkre , Sundar Vishwanathan
Combinatorica 33 ( 3) 319 -334
6
2013
Randomized online graph coloring
Sundar Vishwanathan
Journal of Algorithms 13 ( 4) 657 -669
48
1992
Locality based graph coloring
Márió Szegedy , Sundar Vishwanathan
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 201 -207
79
1993
A technique for multicoloring triangle-free hexagonal graphs
K.S. Sudeep , Sundar Vishwanathan
Discrete Mathematics 300 ( 1-3) 256 -259
33
2005
A polynomial space proof of the Graham--Pollak theorem
Sundar Vishwanathan
Journal of Combinatorial Theory, Series A 115 ( 4) 674 -676
25
2008
On Randomized Algorithms for Matching in the Online Preemptive Model
Ashish Chiplunkar , Sumedh Tirodkar , Sundar Vishwanathan
european symposium on algorithms 325 -336
10
2015
An approximation algorithm for finding long paths in Hamiltonian graphs
Sundar Vishwanathan
Journal of Algorithms 50 ( 2) 246 -256
2004
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
Rina Panigrahy , Sundar Vishwanathan
Journal of Algorithms 27 ( 2) 259 -268
1998
A bound on the chromatic number using the longest odd cycle length
Sreyash Kenkre , Sundar Vishwanathan
Journal of Graph Theory 54 ( 4) 267 -276
2007
Ghosh, Shubhashis, 62 Goemans, Michel X., 194
Gregory Gutin , Amihood Amir , Matthew Andrews , László Babai
Journal of Algorithms 50 277 -277
2004
Alexander Below, Jesús A. De Loera, and Jürgen Richter-Gebert. The complexity of
Sundar Vishwanathan , William Evans , David Kirkpatrick , Matthew Andrews
Journal of Algorithms 50 132 -132
2004
Competitive algorithms for layered graph traversal
Amos Fiat , Dean P Foster , Howard Karloff , Yuval Rabani
SIAM Journal on Computing 28 ( 2) 447 -462
78
1998
Albers, Susanne, 75
Gruia Calinescu , Timothy M Chan , Avner Dor , Cristina G Fernandes
Journal of Algorithms 27 358 -358
1998
Robust Incremental k-Median Clustering.
Atish Das Sarma , Sundar Vishwanathan
2005
Depth-3 Arithmetic Circuits for S innsu2 (X) and Extensions of the Graham-Pollack Theorem
Jaikumar Radhakrishnan , Pranab Sen , Sundar Vishwanathan
Springer Berlin Heidelberg 176 -187
17
2000