| 2008 |
|---|
| 25 | EE | Sreyash Kenkre,
Sundar Vishwanathan:
The common prefix problem on trees.
Inf. Process. Lett. 105(6): 245-248 (2008) |
| 2007 |
|---|
| 24 | EE | 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) |
| 23 | EE | 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 |
|---|
| 22 | EE | Sreyash Kenkre,
Sundar Vishwanathan:
Approximation Algorithms for the Bipartite Multi-cut Problem
CoRR abs/cs/0609031: (2006) |
| 21 | EE | Sreyash Kenkre,
Sundar Vishwanathan:
The Common Prefix Problem On Trees
CoRR abs/cs/0612060: (2006) |
| 2005 |
|---|
| 20 | EE | K. S. Sudeep,
Sundar Vishwanathan:
A technique for multicoloring triangle-free hexagonal graphs.
Discrete Mathematics 300(1-3): 256-259 (2005) |
| 2004 |
|---|
| 19 | EE | Sundar Vishwanathan:
An approximation algorithm for finding long paths in Hamiltonian graphs.
J. Algorithms 50(2): 246-256 (2004) |
| 2003 |
|---|
| 18 | EE | Sundar Vishwanathan:
On 2-coloring certain k-uniform hypergraphs.
J. Comb. Theory, Ser. A 101(1): 168-172 (2003) |
| 2001 |
|---|
| 17 | EE | 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) |
| 16 | EE | Amitabh Chaudhary,
Sundar Vishwanathan:
Approximation Algorithms for the Achromatic Number.
J. Algorithms 41(2): 404-416 (2001) |
| 2000 |
|---|
| 15 | EE | Jaikumar Radhakrishnan,
Pranab Sen,
Sundar Vishwanathan:
Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem.
FSTTCS 2000: 176-187 |
| 14 | EE | Sundar Vishwanathan:
An approximation algorithm for finding a long path in Hamiltonian graphs.
SODA 2000: 680-685 |
| 1999 |
|---|
| 13 | EE | 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 |
|---|
| 12 | | Rina Panigrahy,
Sundar Vishwanathan:
An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem.
J. Algorithms 27(2): 259-268 (1998) |
| 11 | | 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 |
|---|
| 10 | | Amitabh Chaudhary,
Sundar Vishwanathan:
Approximation Algorithms for the Achromatic Number.
SODA 1997: 558-563 |
| 1996 |
|---|
| 9 | | Sundar Vishwanathan:
An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem.
SODA 1996: 1-5 |
| 1995 |
|---|
| 8 | | Barun Chandra,
Sundar Vishwanathan:
Constructing Reliable Communication Networks of Small Weight Online.
J. Algorithms 18(1): 159-175 (1995) |
| 1993 |
|---|
| 7 | EE | Mario Szegedy,
Sundar Vishwanathan:
Locality based graph coloring.
STOC 1993: 201-207 |
| 1992 |
|---|
| 6 | | Sundar Vishwanathan:
An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two.
Inf. Process. Lett. 44(6): 297-302 (1992) |
| 5 | | Sundar Vishwanathan:
Randomized Online Graph Coloring.
J. Algorithms 13(4): 657-669 (1992) |
| 1991 |
|---|
| 4 | | Amos Fiat,
Dean P. Foster,
Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid,
Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal
FOCS 1991: 288-297 |
| 3 | | Marek Chrobak,
Howard J. Karloff,
T. H. Payne,
Sundar Vishwanathan:
New Results on Server Problems.
SIAM J. Discrete Math. 4(2): 172-181 (1991) |
| 1990 |
|---|
| 2 | | Sundar Vishwanathan:
Randomized Online Graph Coloring (Preliminary Version)
FOCS 1990: 464-469 |
| 1 | | Marek Chrobak,
Howard J. Karloff,
T. H. Payne,
Sundar Vishwanathan:
title=New Results on Server Problems.
SODA 1990: 291-300 |
