Algorithms for Weakly Triangulated Graphs. - Jeremy P. Spinrad; R. Sritharan (Discret. Appl. Math., 1995)

A Characterization of Some Graph Classes with No Long Holes. - Elaine M. Eschen; R. Sritharan (J. Comb. Theory B, 1995)

A linear time algorithm to recognize circular permutation graphs. - R. Sritharan (Networks, 1996)

Weakly Triangulated Comparability Graphs. - Elaine M. Eschen; Ryan Hayward; Jeremy P. Spinrad; R. Sritharan (SIAM J. Comput., 1999)

Weakly chordal graph algorithms via handles. - Ryan Hayward; Jeremy P. Spinrad; R. Sritharan (SODA, 2000)

Finding houses and holes in graphs. - Chính T. Hoàng; R. Sritharan (Theor. Comput. Sci., 2001)

Dirac-type characterizations of graphs without long chordless cycles. - Vasek Chvátal; Irena Rusu; R. Sritharan (Discret. Math., 2002)

Recognition of Some Perfectly Orderable Graph Classes. - Elaine M. Eschen; Julie L. Johnson; Jeremy P. Spinrad; R. Sritharan (Discret. Appl. Math., 2003)

Finding a maximum induced matching in weakly chordal graphs. - Kathie Cameron; R. Sritharan; Yingwen Tang (Discret. Math., 2003)

Planar domination graphs. - Elaine M. Eschen; William Klostermeyer; R. Sritharan (Discret. Math., 2003)

The list partition problem for graphs. - Kathie Cameron; Elaine M. Eschen; Chính T. Hoàng; R. Sritharan (SODA, 2004)

Disjoint clique cutsets in graphs without long holes. - Elaine M. Eschen; Chính T. Hoàng; Mark D. T. Petrick; R. Sritharan (J. Graph Theory, 2005)

A note on the recognition of bisplit graphs. - Atif A. Abueida; R. Sritharan (Discret. Math., 2006)

Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes. - Atif A. Abueida; R. Sritharan (SIAM J. Discret. Math., 2006)

An O(n 3)-Time Recognition Algorithm for hhds-free Graphs. - Elaine M. Eschen; Chính T. Hoàng; R. Sritharan (Graphs Comb., 2007)

The Complexity of the List Partition Problem for Graphs. - Kathie Cameron; Elaine M. Eschen; Chính T. Hoàng; R. Sritharan (SIAM J. Discret. Math., 2007)

Improved algorithms for weakly chordal graphs. - Ryan B. Hayward; Jeremy P. Spinrad; R. Sritharan (ACM Trans. Algorithms, 2007)

The induced matching and chain subgraph cover problems for convex bipartite graphs. - Andreas Brandstädt; Elaine M. Eschen; R. Sritharan (Theor. Comput. Sci., 2007)

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. - Celina M. H. de Figueiredo; Luérbio Faria; Sulamita Klein; R. Sritharan (Theor. Comput. Sci., 2007)

Leaf Powers and Their Properties: Using the Trees. - Michael R. Fellows; Daniel Meister 001; Frances A. Rosamond; R. Sritharan; Jan Arne Telle (ISAAC, 2008)

A new characterization of HH-free graphs. - Dieter Kratsch; Jeremy P. Spinrad; R. Sritharan (Discret. Math., 2008)

Chordal bipartite completion of colored graphs. - R. Sritharan (Discret. Math., 2008)

Structure and linear-time recognition of 4-leaf powers. - Andreas Brandstädt; Van Bang Le; R. Sritharan (ACM Trans. Algorithms, 2008)

On graphs without a C4 or a diamond - Elaine M. Eschen; Chính T. Hoàng; Jeremy P. Spinrad; R. Sritharan (CoRR, 2009)

New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. - Arthur H. Busch; Feodor F. Dragan; R. Sritharan (COCOA (2), 2010)

A Min-Max Property of Chordal Bipartite Graphs with Applications. - Atif A. Abueida; Arthur H. Busch; R. Sritharan (Graphs Comb., 2010)

On graphs without a C4 or a diamond. - Elaine M. Eschen; Chính T. Hoàng; Jeremy P. Spinrad; R. Sritharan (Discret. Appl. Math., 2011)

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. - Elaine M. Eschen; Chính T. Hoàng; R. Sritharan; Lorna Stewart (Discret. Math., 2011)

Strongly chordal and chordal bipartite graphs are sandwich monotone. - Pinar Heggernes; Federico Mancini 001; Charis Papadopoulos; R. Sritharan (J. Comb. Optim., 2011)

Maximum induced matching problem on hhd-free graphs. - Chandra Mohan Krishnamurthy; R. Sritharan (Discret. Appl. Math., 2012)

Finding a Sun in Building-Free Graphs. - Elaine M. Eschen; Chính T. Hoàng; Jeremy P. Spinrad; R. Sritharan (Graphs Comb., 2012)

Finding and listing induced paths and cycles. - Chính T. Hoàng; Marcin Kaminski 001; Joe Sawada; R. Sritharan (Discret. Appl. Math., 2013)

Hamiltonian Spider Intersection Graphs Are Cycle Extendable. - Atif A. Abueida; Arthur H. Busch; R. Sritharan (SIAM J. Discret. Math., 2013)

Geodeticity of the contour of chordal bipartite graphs. - Danilo Artigas; R. Sritharan (Electron. Notes Discret. Math., 2015)

Graph modification problem for some classes of graphs. - R. Sritharan (J. Discrete Algorithms, 2016)

Completing colored graphs to meet a target property. - Kathryn Cook; Elaine M. Eschen; R. Sritharan; Xiaoqiang Wang 005 (Discret. Appl. Math., 2017)

On the contour of bipartite graphs. - Danilo Artigas; R. Sritharan (Discret. Appl. Math., 2018)

Some completion problems for graphs without chordless cycles of prescribed lengths. - Arthur H. Busch; R. Sritharan (Discret. Appl. Math., 2019)

Bipartite completion of colored graphs avoiding chordless cycles of given lengths. - Elaine M. Eschen; R. Sritharan (Discret. Appl. Math., 2022)

Intersection of chordal graphs and some related partition problems. - Atif A. Abueida; Arthur H. Busch; R. Sritharan (Discret. Appl. Math., 2025)

Verification of a certificate for weakly chordal graphs. - Jeremy P. Spinrad; R. Sritharan (Discret. Appl. Math., 2025)