|
|
DSpace at IIT Bombay >
Browsing by Author VISHWANATHAN, S
Showing results 1 to 18 of 18
| Issue Date | Title | Author(s) | | 2000 | An approximation algorithm for finding a long path in Hamiltonian graphs | VISHWANATHAN, S |
| 2004 | An approximation algorithm for finding long paths in Hamiltonian graphs | VISHWANATHAN, S |
| 2001 | Approximation algorithms for the achromatic number | CHAUDHARY, A; VISHWANATHAN, S |
| 2010 | Approximation algorithms for the Bipartite Multicut problem | KENKRE, S; VISHWANATHAN, S |
| 2009 | Bipartite Coverings and the Chromatic Number | MUBAYI, D; VISHWANATHAN, S |
| 2007 | A bound on the chromatic number using the longest odd cycle length | KENKRE, S; VISHWANATHAN, S |
| 2008 | The common prefix problem on trees | KENKRE, S; VISHWANATHAN, S |
| 1998 | Competitive algorithms for layered graph traversal | FIAT, A; FOSTER, DP; KARLOFF, H; RABANI, Y; RAVID, Y; VISHWANATHAN, S |
| 1995 | CONSTRUCTING RELIABLE COMMUNICATION-NETWORKS OF SMALL WEIGHT ONLINE | CHANDRA, B; VISHWANATHAN, S |
| 2000 | Depth-3 arithmetic circuits for S-n(2)(X) and extensions of the Graham-Pollack theorem | RADHAKRISHNAN, J; SEN, P; VISHWANATHAN, S |
| 2007 | Matched-factor d-domatic coloring of graphs | SUDEEP, KS; VISHWANATHAN, S |
| 1999 | Multilinear polynomials and a conjecture of Frankl and Furedi | SANKAR, A; VISHWANATHAN, S |
| 1996 | An O(log(*)n) approximation algorithm for the asymmetric p-center problem | VISHWANATHAN, S |
| 1998 | An O(log*n) approximation algorithm for the asymmetric p-center problem | PANIGRAHY, R; VISHWANATHAN, S |
| 2003 | On 2-coloring certain k-uniform hypergraphs | VISHWANATHAN, S |
| 2008 | On Hard Instances of Approximate Vertex Cover | VISHWANATHAN, S |
| 2001 | Query scheduling in multi query optimization | GUPTA, A; SUDARSHAN, S; VISHWANATHAN, S |
| 2005 | A technique for multicoloring triangle-free hexagonal graphs | SUDEEP, KS; VISHWANATHAN, S |
Showing results 1 to 18 of 18
|
