default search action
R. Sritharan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j34]Elaine M. Eschen
, R. Sritharan:
Bipartite completion of colored graphs avoiding chordless cycles of given lengths. Discret. Appl. Math. 318: 97-112 (2022)
2010 – 2019
- 2019
- [j33]Arthur H. Busch, R. Sritharan:
Some completion problems for graphs without chordless cycles of prescribed lengths. Discret. Appl. Math. 268: 21-34 (2019) - 2018
- [j32]Danilo Artigas
On the contour of bipartite graphs. Discret. Appl. Math. 245: 148-154 (2018) - 2017
- [j31]Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang:
Completing colored graphs to meet a target property. Discret. Appl. Math. 223: 39-51 (2017) - 2016
- [j30]R. Sritharan:
Graph modification problem for some classes of graphs. J. Discrete Algorithms 38-41: 32-37 (2016) - 2015
- [j29]Danilo Artigas
Geodeticity of the contour of chordal bipartite graphs. Electron. Notes Discret. Math. 50: 237-242 (2015) - 2013
- [j28]Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan:
Finding and listing induced paths and cycles. Discret. Appl. Math. 161(4-5): 633-641 (2013) - [j27]Atif A. Abueida, Arthur H. Busch, R. Sritharan:
Hamiltonian Spider Intersection Graphs Are Cycle Extendable. SIAM J. Discret. Math. 27(4): 1913-1923 (2013) - [c6]Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang:
Completing Colored Graphs to Meet a Target Property. WG 2013: 189-200 - 2012
- [j26]Chandra Mohan Krishnamurthy, R. Sritharan:
Maximum induced matching problem on hhd-free graphs. Discret. Appl. Math. 160(3): 224-230 (2012) - [j25]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
Finding a Sun in Building-Free Graphs. Graphs Comb. 28(3): 347-364 (2012) - 2011
- [j24]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
On graphs without a C4 or a diamond. Discret. Appl. Math. 159(7): 581-587 (2011) - [j23]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): 431-434 (2011) - [j22]Pinar Heggernes
Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22(3): 438-456 (2011) - 2010
- [j21]Atif A. Abueida, Arthur H. Busch, R. Sritharan:
A Min-Max Property of Chordal Bipartite Graphs with Applications. Graphs Comb. 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
2000 – 2009
- 2009
- [c4]Pinar Heggernes
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 P. 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 P. Spinrad, R. Sritharan:
Finding a sun in building-free graphs. CoRR abs/0910.1808 (2009) - 2008
- [j20]R. Sritharan:
Chordal bipartite completion of colored graphs. Discret. Math. 308(12): 2581-2588 (2008) - [j19]Dieter Kratsch, Jeremy P. Spinrad, R. Sritharan:
A new characterization of HH-free graphs. Discret. Math. 308(20): 4833-4835 (2008) - [j18]Andreas Brandstädt, Van Bang Le, R. Sritharan:
Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms 5(1): 11:1-11:22 (2008) - [c3]Michael R. Fellows
Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413 - 2007
- [j17]Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
An O(n 3)-Time Recognition Algorithm for hhds-free Graphs. Graphs Comb. 23(Supplement-1): 209-231 (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. Discret. Math. 21(4): 900-929 (2007) - [j15]Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan:
Improved algorithms for weakly chordal graphs. ACM Trans. Algorithms 3(2): 14 (2007) - [j14]Celina M. H. de Figueiredo
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. Discret. Math. 306(17): 2108-2110 (2006) - [j11]Atif A. Abueida, R. Sritharan:
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes. SIAM J. Discret. 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. J. 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 P. Spinrad, R. Sritharan:
Recognition of Some Perfectly Orderable Graph Classes. Discret. Appl. Math. 128(2-3): 355-373 (2003) - [j8]Kathie Cameron, R. Sritharan, Yingwen Tang:
Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266(1-3): 133-142 (2003) - [j7]Elaine M. Eschen, William Klostermeyer, R. Sritharan:
Planar domination graphs. Discret. Math. 268(1-3): 129-137 (2003) - 2002
- [j6]Vasek Chvátal, Irena Rusu, R. Sritharan:
Dirac-type characterizations of graphs without long chordless cycles. Discret. Math. 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 P. Spinrad, R. Sritharan:
Weakly chordal graph algorithms via handles. SODA 2000: 42-49
1990 – 1999
- 1999
- [j4]Elaine M. Eschen, Ryan Hayward, Jeremy P. 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 P. Spinrad, R. Sritharan:
Algorithms for Weakly Triangulated Graphs. Discret. Appl. Math. 59(2): 181-191 (1995) - [j1]Elaine M. Eschen, R. Sritharan:
A Characterization of Some Graph Classes with No Long Holes. J. Comb. Theory B 65(1): 156-162 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: