R. Sritharan

45 papers A* 2B 2Misc 1Journal 39Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Intersection of chordal graphs and some related partition problems.
Discret. Appl. Math.
Atif A. Abueida, Arthur H. Busch, R. Sritharan
2025 J jnl
Verification of a certificate for weakly chordal graphs.
Discret. Appl. Math.
Jeremy P. Spinrad, R. Sritharan
2022 J jnl
Bipartite completion of colored graphs avoiding chordless cycles of given lengths.
Discret. Appl. Math.
Elaine M. Eschen, R. Sritharan
2019 J jnl
Some completion problems for graphs without chordless cycles of prescribed lengths.
Discret. Appl. Math.
Arthur H. Busch, R. Sritharan
2018 J jnl
On the contour of bipartite graphs.
Discret. Appl. Math.
Danilo Artigas, R. Sritharan
2017 J jnl
Completing colored graphs to meet a target property.
Discret. Appl. Math.
Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang
2016 J jnl
Graph modification problem for some classes of graphs.
J. Discrete Algorithms
R. Sritharan
2015 J jnl
Geodeticity of the contour of chordal bipartite graphs.
Electron. Notes Discret. Math.
Danilo Artigas, R. Sritharan
2013 B conf
Completing Colored Graphs to Meet a Target Property.
WG
Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang
2013 J jnl
Finding and listing induced paths and cycles.
Discret. Appl. Math.
Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan
2013 J jnl
Hamiltonian Spider Intersection Graphs Are Cycle Extendable.
SIAM J. Discret. Math.
Atif A. Abueida, Arthur H. Busch, R. Sritharan
2012 J jnl
Finding a Sun in Building-Free Graphs.
Graphs Comb.
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
2012 J jnl
Maximum induced matching problem on hhd-free graphs.
Discret. Appl. Math.
Chandra Mohan Krishnamurthy, R. Sritharan
2011 J jnl
On graphs without a C
Discret. Appl. Math.
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
2011 J jnl
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.
Discret. Math.
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
2011 J jnl
Strongly chordal and chordal bipartite graphs are sandwich monotone.
J. Comb. Optim.
Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
2010 J jnl
A Min-Max Property of Chordal Bipartite Graphs with Applications.
Graphs Comb.
Atif A. Abueida, Arthur H. Busch, R. Sritharan
2010 — conf
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs.
COCOA (2)
Arthur H. Busch, Feodor F. Dragan, R. Sritharan
2009 J jnl
Finding a sun in building-free graphs
CoRR
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
2009 J jnl
On graphs without a C4 or a diamond
CoRR
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
2009 J jnl
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
CoRR
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
2009 Misc conf
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone.
COCOON
Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
2008 J jnl
A new characterization of HH-free graphs.
Discret. Math.
Dieter Kratsch, Jeremy P. Spinrad, R. Sritharan
2008 J jnl
Chordal bipartite completion of colored graphs.
Discret. Math.
R. Sritharan
2008 B conf
Leaf Powers and Their Properties: Using the Trees.
ISAAC
Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
2008 J jnl
Structure and linear-time recognition of 4-leaf powers.
ACM Trans. Algorithms
Andreas Brandstädt, Van Bang Le, R. Sritharan
2007 J jnl
An O(
Graphs Comb.
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
2007 J jnl
Improved algorithms for weakly chordal graphs.
ACM Trans. Algorithms
Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan
2007 J jnl
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.
Theor. Comput. Sci.
Celina M. H. de Figueiredo, Luérbio Faria, Sulamita Klein, R. Sritharan
2007 J jnl
The Complexity of the List Partition Problem for Graphs.
SIAM J. Discret. Math.
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
2007 J jnl
The induced matching and chain subgraph cover problems for convex bipartite graphs.
Theor. Comput. Sci.
Andreas Brandstädt, Elaine M. Eschen, R. Sritharan
2006 J jnl
A note on the recognition of bisplit graphs.
Discret. Math.
Atif A. Abueida, R. Sritharan
2006 J jnl
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes.
SIAM J. Discret. Math.
Atif A. Abueida, R. Sritharan
2005 J jnl
Disjoint clique cutsets in graphs without long holes.
J. Graph Theory
Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
2004 A* conf
The list partition problem for graphs.
SODA
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
2003 J jnl
Finding a maximum induced matching in weakly chordal graphs.
Discret. Math.
Kathie Cameron, R. Sritharan, Yingwen Tang
2003 J jnl
Planar domination graphs.
Discret. Math.
Elaine M. Eschen, William Klostermeyer, R. Sritharan
2003 J jnl
Recognition of Some Perfectly Orderable Graph Classes.
Discret. Appl. Math.
Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan
2002 J jnl
Dirac-type characterizations of graphs without long chordless cycles.
Discret. Math.
Vasek Chvátal, Irena Rusu, R. Sritharan
2001 J jnl
Finding houses and holes in graphs.
Theor. Comput. Sci.
Chính T. Hoàng, R. Sritharan
2000 A* conf
Weakly chordal graph algorithms via handles.
SODA
Ryan Hayward, Jeremy P. Spinrad, R. Sritharan
1999 J jnl
Weakly Triangulated Comparability Graphs.
SIAM J. Comput.
Elaine M. Eschen, Ryan Hayward, Jeremy P. Spinrad, R. Sritharan
1996 J jnl
A linear time algorithm to recognize circular permutation graphs.
Networks
R. Sritharan
1995 J jnl
A Characterization of Some Graph Classes with No Long Holes.
J. Comb. Theory B
Elaine M. Eschen, R. Sritharan
1995 J jnl
Algorithms for Weakly Triangulated Graphs.
Discret. Appl. Math.
Jeremy P. Spinrad, R. Sritharan