| 2008 |
|---|
| 22 | EE | Michael R. Fellows,
Daniel Meister,
Frances A. Rosamond,
R. Sritharan,
Jan Arne Telle:
Leaf Powers and Their Properties: Using the Trees.
ISAAC 2008: 402-413 |
| 21 | EE | Andreas Brandstädt,
Van Bang Le,
R. Sritharan:
Structure and linear-time recognition of 4-leaf powers.
ACM Transactions on Algorithms 5(1): (2008) |
| 20 | EE | R. Sritharan:
Chordal bipartite completion of colored graphs.
Discrete Mathematics 308(12): 2581-2588 (2008) |
| 19 | EE | Dieter Kratsch,
Jeremy Spinrad,
R. Sritharan:
A new characterization of HH-free graphs.
Discrete Mathematics 308(20): 4833-4835 (2008) |
| 2007 |
|---|
| 18 | EE | Ryan B. Hayward,
Jeremy Spinrad,
R. Sritharan:
Improved algorithms for weakly chordal graphs.
ACM Transactions on Algorithms 3(2): (2007) |
| 17 | EE | Kathie Cameron,
Elaine M. Eschen,
Chính T. Hoàng,
R. Sritharan:
The Complexity of the List Partition Problem for Graphs.
SIAM J. Discrete Math. 21(4): 900-929 (2007) |
| 16 | EE | Andreas Brandstädt,
Elaine M. Eschen,
R. Sritharan:
The induced matching and chain subgraph cover problems for convex bipartite graphs.
Theor. Comput. Sci. 381(1-3): 260-265 (2007) |
| 15 | EE | 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.
Theor. Comput. Sci. 381(1-3): 57-67 (2007) |
| 2006 |
|---|
| 14 | EE | Atif A. Abueida,
R. Sritharan:
A note on the recognition of bisplit graphs.
Discrete Mathematics 306(17): 2108-2110 (2006) |
| 13 | EE | Atif A. Abueida,
R. Sritharan:
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes.
SIAM J. Discrete Math. 20(3): 669-681 (2006) |
| 2005 |
|---|
| 12 | EE | Elaine M. Eschen,
Chính T. Hoàng,
Mark D. T. Petrick,
R. Sritharan:
Disjoint clique cutsets in graphs without long holes.
Journal of Graph Theory 48(4): 277-298 (2005) |
| 2004 |
|---|
| 11 | EE | Kathie Cameron,
Elaine M. Eschen,
Chính T. Hoàng,
R. Sritharan:
The list partition problem for graphs.
SODA 2004: 391-399 |
| 2003 |
|---|
| 10 | EE | Elaine M. Eschen,
Julie L. Johnson,
Jeremy Spinrad,
R. Sritharan:
Recognition of Some Perfectly Orderable Graph Classes.
Discrete Applied Mathematics 128(2-3): 355-373 (2003) |
| 9 | EE | Kathie Cameron,
R. Sritharan,
Yingwen Tang:
Finding a maximum induced matching in weakly chordal graphs.
Discrete Mathematics 266(1-3): 133-142 (2003) |
| 8 | EE | Elaine M. Eschen,
William Klostermeyer,
R. Sritharan:
Planar domination graphs.
Discrete Mathematics 268(1-3): 129-137 (2003) |
| 2002 |
|---|
| 7 | EE | Vasek Chvátal,
Irena Rusu,
R. Sritharan:
Dirac-type characterizations of graphs without long chordless cycles.
Discrete Mathematics 256(1-2): 445-448 (2002) |
| 2001 |
|---|
| 6 | EE | Chính T. Hoàng,
R. Sritharan:
Finding houses and holes in graphs.
Theor. Comput. Sci. 259(1-2): 233-244 (2001) |
| 2000 |
|---|
| 5 | EE | Ryan Hayward,
Jeremy Spinrad,
R. Sritharan:
Weakly chordal graph algorithms via handles.
SODA 2000: 42-49 |
| 1999 |
|---|
| 4 | | Elaine M. Eschen,
Ryan Hayward,
Jeremy Spinrad,
R. Sritharan:
Weakly Triangulated Comparability Graphs.
SIAM J. Comput. 29(2): 378-386 (1999) |
| 1996 |
|---|
| 3 | EE | R. Sritharan:
A linear time algorithm to recognize circular permutation graphs.
Networks 27(3): 171-174 (1996) |
| 1995 |
|---|
| 2 | EE | Jeremy Spinrad,
R. Sritharan:
Algorithms for Weakly Triangulated Graphs.
Discrete Applied Mathematics 59(2): 181-191 (1995) |
| 1 | EE | Elaine M. Eschen,
R. Sritharan:
A Characterization of Some Graph Classes with No Long Holes.
J. Comb. Theory, Ser. B 65(1): 156-162 (1995) |
