R. Sritharan

Publication Activity (10 Years)

Years Active: 1995-2022
Publications (10 Years): 5

Top Topics

Bipartite Graph

Graph Clustering

Mutual Reinforcement

Top Venues

Discret. Appl. Math.

SIAM J. Discret. Math.

Electron. Notes Discret. Math.

Publications

Elaine M. Eschen, R. Sritharan
Bipartite completion of colored graphs avoiding chordless cycles of given lengths. Discret. Appl. Math. 318 (2022)
Arthur H. Busch, R. Sritharan
Some completion problems for graphs without chordless cycles of prescribed lengths. Discret. Appl. Math. 268 (2019)
Danilo Artigas, R. Sritharan
On the contour of bipartite graphs. Discret. Appl. Math. 245 (2018)
Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang
Completing colored graphs to meet a target property. Discret. Appl. Math. 223 (2017)
R. Sritharan
Graph modification problem for some classes of graphs. J. Discrete Algorithms (2016)
Danilo Artigas, R. Sritharan
Geodeticity of the contour of chordal bipartite graphs. Electron. Notes Discret. Math. 50 (2015)
Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan
Finding and listing induced paths and cycles. Discret. Appl. Math. 161 (4-5) (2013)
Atif A. Abueida, Arthur H. Busch, R. Sritharan
Hamiltonian Spider Intersection Graphs Are Cycle Extendable. SIAM J. Discret. Math. 27 (4) (2013)
Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang
Completing Colored Graphs to Meet a Target Property. WG (2013)
Chandra Mohan Krishnamurthy, R. Sritharan
Maximum induced matching problem on hhd-free graphs. Discret. Appl. Math. 160 (3) (2012)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
Finding a Sun in Building-Free Graphs. Graphs Comb. 28 (3) (2012)
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. Discret. Math. 311 (6) (2011)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
or a diamond. Discret. Appl. Math. 159 (7) (2011)
Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22 (3) (2011)
Atif A. Abueida, Arthur H. Busch, R. Sritharan
A Min-Max Property of Chordal Bipartite Graphs with Applications. Graphs Comb. 26 (3) (2010)
Arthur H. Busch, Feodor F. Dragan, R. Sritharan
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. COCOA (2) (2010)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
On graphs without a C4 or a diamond CoRR (2009)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
Finding a sun in building-free graphs CoRR (2009)
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 (2009)
Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON (2009)
Dieter Kratsch, Jeremy P. Spinrad, R. Sritharan
A new characterization of HH-free graphs. Discret. Math. 308 (20) (2008)
Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
Leaf Powers and Their Properties: Using the Trees. ISAAC (2008)
R. Sritharan
Chordal bipartite completion of colored graphs. Discret. Math. 308 (12) (2008)
Andreas Brandstädt, Van Bang Le, R. Sritharan
Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms 5 (1) (2008)
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) (2007)
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
)-Time Recognition Algorithm for hhds-free Graphs. Graphs Comb. 23 (Supplement-1) (2007)
Celina M. H. de Figueiredo, Luérbio 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) (2007)
Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan
Improved algorithms for weakly chordal graphs. ACM Trans. Algorithms 3 (2) (2007)
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
The Complexity of the List Partition Problem for Graphs. SIAM J. Discret. Math. 21 (4) (2007)
Atif A. Abueida, R. Sritharan
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes. SIAM J. Discret. Math. 20 (3) (2006)
Atif A. Abueida, R. Sritharan
A note on the recognition of bisplit graphs. Discret. Math. 306 (17) (2006)
Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
Disjoint clique cutsets in graphs without long holes. J. Graph Theory 48 (4) (2005)
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
The list partition problem for graphs. SODA (2004)
Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan
Recognition of Some Perfectly Orderable Graph Classes. Discret. Appl. Math. 128 (2-3) (2003)
Elaine M. Eschen, William Klostermeyer, R. Sritharan
Planar domination graphs. Discret. Math. 268 (1-3) (2003)
Kathie Cameron, R. Sritharan, Yingwen Tang
Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266 (1-3) (2003)
Vasek Chvátal, Irena Rusu, R. Sritharan
Dirac-type characterizations of graphs without long chordless cycles. Discret. Math. 256 (1-2) (2002)
Chính T. Hoàng, R. Sritharan
Finding houses and holes in graphs. Theor. Comput. Sci. 259 (1-2) (2001)
Ryan Hayward, Jeremy P. Spinrad, R. Sritharan
Weakly chordal graph algorithms via handles. SODA (2000)
Elaine M. Eschen, Ryan Hayward, Jeremy P. Spinrad, R. Sritharan
Weakly Triangulated Comparability Graphs. SIAM J. Comput. 29 (2) (1999)
R. Sritharan
A linear time algorithm to recognize circular permutation graphs. Networks 27 (3) (1996)
Jeremy P. Spinrad, R. Sritharan
Algorithms for Weakly Triangulated Graphs. Discret. Appl. Math. 59 (2) (1995)
Elaine M. Eschen, R. Sritharan
A Characterization of Some Graph Classes with No Long Holes. J. Comb. Theory, Ser. B 65 (1) (1995)