The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

R. Sritharan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
    The list partition problem for graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:391-399 [Conf]
  2. Ryan Hayward, Jeremy Spinrad, R. Sritharan
    Weakly chordal graph algorithms via handles. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:42-49 [Conf]
  3. Elaine M. Eschen, Julie L. Johnson, Jeremy Spinrad, R. Sritharan
    Recognition of Some Perfectly Orderable Graph Classes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:355-373 [Journal]
  4. Jeremy Spinrad, R. Sritharan
    Algorithms for Weakly Triangulated Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:2, pp:181-191 [Journal]
  5. Kathie Cameron, R. Sritharan, Yingwen Tang
    Finding a maximum induced matching in weakly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:133-142 [Journal]
  6. Vasek Chvátal, Irena Rusu, R. Sritharan
    Dirac-type characterizations of graphs without long chordless cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:445-448 [Journal]
  7. Elaine M. Eschen, William Klostermeyer, R. Sritharan
    Planar domination graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:129-137 [Journal]
  8. Atif A. Abueida, R. Sritharan
    A note on the recognition of bisplit graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:17, pp:2108-2110 [Journal]
  9. Elaine M. Eschen, R. Sritharan
    A Characterization of Some Graph Classes with No Long Holes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:65, n:1, pp:156-162 [Journal]
  10. R. Sritharan
    A linear time algorithm to recognize circular permutation graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:3, pp:171-174 [Journal]
  11. Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan
    Weakly Triangulated Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:378-386 [Journal]
  12. Chính T. Hoàng, R. Sritharan
    Finding houses and holes in graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:233-244 [Journal]
  13. Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
    Disjoint clique cutsets in graphs without long holes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:277-298 [Journal]
  14. Ryan B. Hayward, Jeremy Spinrad, R. Sritharan
    Improved algorithms for weakly chordal graphs. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]
  15. Andreas Brandstädt, Elaine M. Eschen, R. Sritharan
    The induced matching and chain subgraph cover problems for convex bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:260-265 [Journal]
  16. Celina M. Herrera de Figueiredo, Luerbio Faria, Sulamita Klein, R. Sritharan
    On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:57-67 [Journal]

  17. Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. [Citation Graph (, )][DBLP]


  18. Leaf Powers and Their Properties: Using the Trees. [Citation Graph (, )][DBLP]


  19. On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two [Citation Graph (, )][DBLP]


  20. On graphs without a C4 or a diamond [Citation Graph (, )][DBLP]


  21. Finding a sun in building-free graphs [Citation Graph (, )][DBLP]


  22. Chordal bipartite completion of colored graphs. [Citation Graph (, )][DBLP]


  23. A new characterization of HH-free graphs. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.019secs
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