|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
Finding a Sun in Building-Free Graphs.  |
Graphs and Combinatorics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Mohan Krishnamurthy, R. Sritharan |
Maximum induced matching problem on hhd-free graphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan |
Strongly chordal and chordal bipartite graphs are sandwich monotone. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
On graphs without a C4 or a diamond. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Atif A. Abueida, Arthur H. Busch, R. Sritharan |
A Min-Max Property of Chordal Bipartite Graphs with Applications. |
Graphs and Combinatorics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur H. Busch, Feodor F. Dragan, R. Sritharan |
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
On graphs without a C4 or a diamond |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
Finding a sun in building-free graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan |
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Sritharan |
Chordal bipartite completion of colored graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Jeremy Spinrad, R. Sritharan |
A new characterization of HH-free graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Van Bang Le, R. Sritharan |
Structure and linear-time recognition of 4-leaf powers. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
squares of trees, trees, phylogenetic trees, leaf powers, Graph powers |
| 1 | Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle |
Leaf Powers and Their Properties: Using the Trees. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Celina M. Herrera de Figueiredo, Luerbio Faria, Sulamita Klein, R. Sritharan |
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Elaine M. Eschen, R. Sritharan |
The induced matching and chain subgraph cover problems for convex bipartite graphs. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan B. Hayward, Jeremy Spinrad, R. Sritharan |
Improved algorithms for weakly chordal graphs. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
weakly chordal, graph algorithms, recognition, coloring, Perfect graphs |
| 1 | Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan |
The Complexity of the List Partition Problem for Graphs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Atif A. Abueida, R. Sritharan |
A note on the recognition of bisplit graphs. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Atif A. Abueida, R. Sritharan |
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan |
Disjoint clique cutsets in graphs without long holes. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan |
The list partition problem for graphs. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, William Klostermeyer, R. Sritharan |
Planar domination graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, R. Sritharan, Yingwen Tang |
Finding a maximum induced matching in weakly chordal graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Julie L. Johnson, Jeremy Spinrad, R. Sritharan |
Recognition of Some Perfectly Orderable Graph Classes. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasek Chvátal, Irena Rusu, R. Sritharan |
Dirac-type characterizations of graphs without long chordless cycles. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, R. Sritharan |
Finding houses and holes in graphs. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Hayward, Jeremy Spinrad, R. Sritharan |
Weakly chordal graph algorithms via handles. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan |
Weakly Triangulated Comparability Graphs. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Sritharan |
A linear time algorithm to recognize circular permutation graphs. |
Networks |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, R. Sritharan |
A Characterization of Some Graph Classes with No Long Holes. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad, R. Sritharan |
Algorithms for Weakly Triangulated Graphs. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")