The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sundar Vishwanathan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
    Competitive Algorithms for Layered Graph Traversal [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:288-297 [Conf]
  2. Sundar Vishwanathan
    Randomized Online Graph Coloring (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:464-469 [Conf]
  3. Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
    Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:176-187 [Conf]
  4. Amitabh Chaudhary, Sundar Vishwanathan
    Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:558-563 [Conf]
  5. Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
    title=New Results on Server Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:291-300 [Conf]
  6. Sundar Vishwanathan
    An approximation algorithm for finding a long path in Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:680-685 [Conf]
  7. Sundar Vishwanathan
    An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:1-5 [Conf]
  8. Mario Szegedy, Sundar Vishwanathan
    Locality based graph coloring. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:201-207 [Conf]
  9. Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
    Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  10. K. S. Sudeep, Sundar Vishwanathan
    A technique for multicoloring triangle-free hexagonal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:256-259 [Journal]
  11. K. S. Sudeep, Sundar Vishwanathan
    Some results in square-free and strong square-free edge-colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:14, pp:1818-1824 [Journal]
  12. Sundar Vishwanathan
    An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:6, pp:297-302 [Journal]
  13. Barun Chandra, Sundar Vishwanathan
    Constructing Reliable Communication Networks of Small Weight Online. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:159-175 [Journal]
  14. Amitabh Chaudhary, Sundar Vishwanathan
    Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:404-416 [Journal]
  15. Rina Panigrahy, Sundar Vishwanathan
    An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:2, pp:259-268 [Journal]
  16. Sundar Vishwanathan
    An approximation algorithm for finding long paths in Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:2, pp:246-256 [Journal]
  17. Sundar Vishwanathan
    Randomized Online Graph Coloring. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:4, pp:657-669 [Journal]
  18. Arvind Sankar, Sundar Vishwanathan
    Multilinear Polynomials and a Conjecture of Frankl and Füredi. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:86, n:1, pp:182-186 [Journal]
  19. Sundar Vishwanathan
    On 2-coloring certain k-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:101, n:1, pp:168-172 [Journal]
  20. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
    Competitive Algorithms for Layered Graph Traversal. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:447-462 [Journal]
  21. Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
    New Results on Server Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:172-181 [Journal]
  22. Sreyash Kenkre, Sundar Vishwanathan
    A bound on the chromatic number using the longest odd cycle length. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:4, pp:267-276 [Journal]
  23. Sreyash Kenkre, Sundar Vishwanathan
    The Common Prefix Problem On Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  24. Sreyash Kenkre, Sundar Vishwanathan
    Approximation Algorithms for the Bipartite Multi-cut Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  25. Circumference, Chromatic Number and Online Coloring [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002