- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j26 |      | Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan: Finding and listing induced paths and cycles. Discrete Applied Mathematics 161(4-5): 633-641 (2013) |
| 2012 | ||
| j25 | | Chandra Mohan Krishnamurthy, R. Sritharan: Maximum induced matching problem on hhd-free graphs. Discrete Applied Mathematics 160(3): 224-230 (2012) |
| j24 | | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: Finding a Sun in Building-Free Graphs. Graphs and Combinatorics 28(3): 347-364 (2012) |
| 2011 | ||
| j23 | | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: On graphs without a C4 or a diamond. Discrete Applied Mathematics 159(7): 581-587 (2011) |
| j22 | | Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart: On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. Discrete Mathematics 311(6): 431-434 (2011) |
| j21 | | Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan: Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22(3): 438-456 (2011) |
| 2010 | ||
| j20 | | Atif A. Abueida, Arthur H. Busch, R. Sritharan: A Min-Max Property of Chordal Bipartite Graphs with Applications. Graphs and Combinatorics 26(3): 301-313 (2010) |
| c5 | | Arthur H. Busch, Feodor F. Dragan, R. Sritharan: New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. COCOA (2) 2010: 207-218 |
| 2009 | ||
| c4 | | Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan: Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON 2009: 398-407 |
| i3 | | Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart: On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. CoRR abs/0907.0691 (2009) |
| i2 | | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: On graphs without a C4 or a diamond. CoRR abs/0909.4719 (2009) |
| i1 | | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: Finding a sun in building-free graphs. CoRR abs/0910.1808 (2009) |
| 2008 | ||
| j19 | | R. Sritharan: Chordal bipartite completion of colored graphs. Discrete Mathematics 308(12): 2581-2588 (2008) |
| j18 | | Dieter Kratsch, Jeremy Spinrad, R. Sritharan: A new characterization of HH-free graphs. Discrete Mathematics 308(20): 4833-4835 (2008) |
| j17 | | Andreas Brandstädt, Van Bang Le, R. Sritharan: Structure and linear-time recognition of 4-leaf powers. ACM Transactions on Algorithms 5(1) (2008) |
| c3 | | 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 |
| 2007 | ||
| j16 | | 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) |
| j15 | | Ryan B. Hayward, Jeremy Spinrad, R. Sritharan: Improved algorithms for weakly chordal graphs. ACM Transactions on Algorithms 3(2) (2007) |
| j14 | | 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) |
| j13 | | 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) |
| 2006 | ||
| j12 | | Atif A. Abueida, R. Sritharan: A note on the recognition of bisplit graphs. Discrete Mathematics 306(17): 2108-2110 (2006) |
| j11 | | Atif A. Abueida, R. Sritharan: Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes. SIAM J. Discrete Math. 20(3): 669-681 (2006) |
| 2005 | ||
| j10 | | 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 | ||
| c2 | | Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan: The list partition problem for graphs. SODA 2004: 391-399 |
| 2003 | ||
| j9 | | 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) |
| j8 | | Kathie Cameron, R. Sritharan, Yingwen Tang: Finding a maximum induced matching in weakly chordal graphs. Discrete Mathematics 266(1-3): 133-142 (2003) |
| j7 | | Elaine M. Eschen, William Klostermeyer, R. Sritharan: Planar domination graphs. Discrete Mathematics 268(1-3): 129-137 (2003) |
| 2002 | ||
| j6 | | 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 | ||
| j5 | | Chính T. Hoàng, R. Sritharan: Finding houses and holes in graphs. Theor. Comput. Sci. 259(1-2): 233-244 (2001) |
| 2000 | ||
| c1 | | Ryan Hayward, Jeremy Spinrad, R. Sritharan: Weakly chordal graph algorithms via handles. SODA 2000: 42-49 |
| 1999 | ||
| j4 | | Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan: Weakly Triangulated Comparability Graphs. SIAM J. Comput. 29(2): 378-386 (1999) |
| 1996 | ||
| j3 | | R. Sritharan: A linear time algorithm to recognize circular permutation graphs. Networks 27(3): 171-174 (1996) |
| 1995 | ||
| j2 | | Jeremy Spinrad, R. Sritharan: Algorithms for Weakly Triangulated Graphs. Discrete Applied Mathematics 59(2): 181-191 (1995) |
| j1 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page