R. Sritharan

According to our database1, R. Sritharan authored at least 39 papers between 1995 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Bipartite completion of colored graphs avoiding chordless cycles of given lengths.
Discret. Appl. Math., 2022

2019
Some completion problems for graphs without chordless cycles of prescribed lengths.
Discret. Appl. Math., 2019

2018
On the contour of bipartite graphs.
Discret. Appl. Math., 2018

2017
Completing colored graphs to meet a target property.
Discret. Appl. Math., 2017

2016
Graph modification problem for some classes of graphs.
J. Discrete Algorithms, 2016

2015
Geodeticity of the contour of chordal bipartite graphs.
Electron. Notes Discret. Math., 2015

2013
Hamiltonian Spider Intersection Graphs Are Cycle Extendable.
SIAM J. Discret. Math., 2013

Finding and listing induced paths and cycles.
Discret. Appl. Math., 2013

2012
Finding a Sun in Building-Free Graphs.
Graphs Comb., 2012

Maximum induced matching problem on hhd-free graphs.
Discret. Appl. Math., 2012

2011
Strongly chordal and chordal bipartite graphs are sandwich monotone.
J. Comb. Optim., 2011

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.
Discret. Math., 2011

On graphs without a C<sub>4</sub> or a diamond.
Discret. Appl. Math., 2011

2010
A Min-Max Property of Chordal Bipartite Graphs with Applications.
Graphs Comb., 2010

New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
On graphs without a C4 or a diamond
CoRR, 2009

2008
Structure and linear-time recognition of 4-leaf powers.
ACM Trans. Algorithms, 2008

Chordal bipartite completion of colored graphs.
Discret. Math., 2008

A new characterization of HH-free graphs.
Discret. Math., 2008

Leaf Powers and Their Properties: Using the Trees.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.
Theor. Comput. Sci., 2007

The induced matching and chain subgraph cover problems for convex bipartite graphs.
Theor. Comput. Sci., 2007

Improved algorithms for weakly chordal graphs.
ACM Trans. Algorithms, 2007

The Complexity of the List Partition Problem for Graphs.
SIAM J. Discret. Math., 2007

An O(<i>n</i> <sup>3</sup>)-Time Recognition Algorithm for hhds-free Graphs.
Graphs Comb., 2007

2006
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes.
SIAM J. Discret. Math., 2006

A note on the recognition of bisplit graphs.
Discret. Math., 2006

2005
Disjoint clique cutsets in graphs without long holes.
J. Graph Theory, 2005

2004
The list partition problem for graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Planar domination graphs.
Discret. Math., 2003

Finding a maximum induced matching in weakly chordal graphs.
Discret. Math., 2003

Recognition of Some Perfectly Orderable Graph Classes.
Discret. Appl. Math., 2003

2002
Dirac-type characterizations of graphs without long chordless cycles.
Discret. Math., 2002

2001
Finding houses and holes in graphs.
Theor. Comput. Sci., 2001

2000
Weakly chordal graph algorithms via handles.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Weakly Triangulated Comparability Graphs.
SIAM J. Comput., 1999

1996
A linear time algorithm to recognize circular permutation graphs.
Networks, 1996

1995
A Characterization of Some Graph Classes with No Long Holes.
J. Comb. Theory B, 1995

Algorithms for Weakly Triangulated Graphs.
Discret. Appl. Math., 1995


  Loading...