PUBLICATIONS

Accepted to appear in refereed journals

  • A. Brandstädt, V. B. Le, and R. Sritharan, Structure and linear time recognition of 4-leaf powers, To appear in ACM Transactions on Algorithms.

Published in refereed journals

  • R. Sritharan, Chordal bipartite completion of colored graphs, Discrete Mathematics 308 (2008), 2581-2588.
  • D. Kratsch, J. P. Spinrad, and R. Sritharan, A new characterization of hh-free graphs, Discrete Mathematics 308 (2008), 4833-4835.
  • K. Cameron, E. M. Eschen, C. T. Hoàng, and R. Sritharan, The complexity of the list partition problem for graphs, SIAM Journal on Discrete Mathematics 21 (2007), 900-929.
  • R. B. Hayward, J. P. Spinrad, and R. Sritharan, Improved algorithms for weakly chordal graphs, ACM Transactions on Algorithms 3 (2007), no. 2, 19 pp.
  • E. M. Eschen, C. T. Hoàng, and R. Sritharan, An O(n3)-time recognition algorithm for hhds-free graphs, Graphs and Combinatorics 23 (2007), suppl. 1, 209-231.
  • C. M. H. de Figueiredo, L. Faria, S. Klein, and R. Sritharan, On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs, Theoretical Computer Science 381 (2007), 57-67.
  • A. Brandstädt, E. M. Eschen, and R. Sritharan, The induced matching and chain subgraph cover problems for convex bipartite graphs, Theoretical Computer Science 381 (2007), 260-265.
  • K. Cameron, E. M. Eschen, C. T. Hoàng, and R. Sritharan, Recognition of perfect circular-arc graphs,  Graph Theory in Paris, Trends in Mathematics, Birkhäuser, 2007, 97-108.
  • A. Abueida and R. Sritharan, Cycle extendability and Hamiltonian cycles in chordal graph classes, SIAM Journal on Discrete Mathematics 20 (2006), 669-681.
  • A. Abueida and R. Sritharan, A note on the recognition of bisplit graphs, Discrete Mathematics 306 (2006), 2108-2110.
  • E. M. Eschen, C. T. Hoàng, M. Petrick, and R. Sritharan, Disjoint clique cutsets in graphs without long holes, Journal of Graph Theory 48 (2005), 277-298.
  • E. M. Eschen, W. Klostermeyer, and R. Sritharan, Planar domination graphs, Discrete Mathematics 268 (2003), 129-137.
  • K. Cameron, R. Sritharan, and Y. Tang, Finding a maximum induced matching in weakly chordal graphs, Discrete Mathematics 266 (2003), 133-142.
  • E. M. Eschen, J. Johnson, J. P. Spinrad, and R. Sritharan, Recognition of some perfectly orderable graph classes, Discrete Applied Mathematics 128 (2003), 355-373.
  • V. Chvátal, I. Rusu, and R. Sritharan, Dirac-type characterizations of graphs without long chordless cycles, Discrete Mathematics 256 (2002), 445-448.
  • C. T.  Hoàng and R. Sritharan, Finding houses and holes in graphs, Theoretical Computer Science 259 (2001), no. 1-2, 233-244.
  • E. M. Eschen, R. B. Hayward, J. P. Spinrad, and R. Sritharan, Weakly triangulated comparability graphs, SIAM Journal on Computing 29 (1999), no. 2, 378-386.
  • R. Sritharan, A linear time algorithm to recognize circular permutation graphs, Networks 27 (1996) no. 3, 171-174.
  • E. M. Eschen and R. Sritharan, A characterization of some graph classes with no long holes, Journal of Combinatorial Theory Series B 65 (1995), 156-162.
  • J. P. Spinrad and R. Sritharan, Algorithms for weakly triangulated graphs, Discrete Applied Mathematics 59 (1995), 181-191.

Published in refereed conference proceedings

  • K. Cameron, E. M. Eschen, C. T. Hoàng, and R. Sritharan, The list partition problem for graphs, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 384-392, 2004.
  • R. B. Hayward, J. P. Spinrad, and R. Sritharan, Weakly chordal graph algorithms via handles, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 42-49, 2000.

Submitted to refereed journals

  • A. Abueida, A. H. Busch, and R. Sritharan, A min-max theorem for chordal bipartite graphs with applications, Submitted to Graphs and Combinatorics.

Theses

  • Algorithms for some classes of perfect and intersection graphs, Doctoral dissertation, Vanderbilt University, August 1995.

 

PRESENTATIONS AT CONFERENCES

By invitation

  • Graph sandwich problem for strongly chordal and chordal bipartite graphs, Mini-symposium on ‘Chordal graphs and their relatives’, 13th SIAM Conference on Discrete Mathematics, Victoria, Canada, June 2006.
  • The graph sandwich problem for strongly chordal graphs and chordal bipartite graphs, Special session on ‘Structured graph classes: algorithms and min-max theorems’, CORS / Optimization Days 2006 Joint Conference, Montreal, Canada, May 2006.
  • Cycle extendability in chordal graph classes, Special session on ‘Graph/Design Theory’ at the AMS/MAA Joint Meeting, Atlanta, Georgia, January 2005.
  • List partition problem for graphs, Special Session on ‘Graph and Design Theory’, AMS Meeting #985, Indiana University, Bloomington, April 2003.
  • Classes of graphs without long holes, Mini-symposium on ‘Perfect graphs’, 9th SIAM Conference on Discrete Mathematics, Toronto, Canada, July 1998.

At invitation-based workshops

  • Chordal bipartite completion of colored graphs, Dagstuhl seminar on exact, approximative, robust, and certifying algorithms on particular graph classes, Schloss Dagstuhl, Wadern, Germany, May 2007.
  • Algorithms for biclique separable graphs, Dagstuhl seminar on robust and approximative algorithms on particular graph classes, Schloss Dagstuhl, Wadern, Germany, May 2004.
  • Finding houses and holes in graphs, Dagstuhl seminar on graph decompositions and algorithmic applications, Schloss Dagstuhl, Wadern, Germany, June 2001.
  • New algorithms for weakly chordal graphs, Workshop on structured families of graphs, The Fields Institute, University of Toronto, May 2000.

At conferences

* indicates the co-author that presented the paper

  • A min-max theorem on a class of bipartite graphs with applications, 14th SIAM Conference on Discrete Mathematics, Burlington, VT, June 2008.
  • Graphs without a C4 or a diamond, 14th SIAM Conference on Discrete Mathematics, Burlington, VT, June 2008 (with E. M. Eschen*, C. T. Hoàng, and J. P. Spinrad).
  • Minimum chain subgraph covers and maximum induced matchings in chordal bipartite graphs, 21st Cumberland Conference on Graph Theory, Combinatorics, and Computing, Vanderbilt University, Nashville, TN, May 2008.
  • Structure of 4-leaf powers, Midwestern Graph Theory Conference, University of Detroit Mercy, October 2007.
  • The list partition problem for graphs, 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, January 2004.
  • Algorithms for biclique separable graphs, 12th SIAM Conference on Discrete Mathematics, Nashville, TN, June 2004.
  • The list partition problem for graphs, Dagstuhl seminar on robust and approximative algorithms on particular graph classes, Schloss Dagstuhl, Wadern, Germany, May 2004 (with K. Cameron, E. M. Eschen*, and C. T. Hoàng).
  • Boolean matrix multiplication and graph algorithms, Discrete Mathematics and its Applications, Miami University, Oxford, Ohio, October 2003.
  • On minimal imperfect graphs without long holes, 11th SIAM Conference on Discrete Mathematics, San Diego, August 2002.
  • Planar domination graphs, Dagstuhl seminar on graph decompositions and algorithmic applications, Schloss Dagstuhl, Wadern, Germany, June 2001 (with E. M. Eschen* and W. Klostermeyer).
  • Finding a maximum induced matching in weakly chordal graphs, Horizons in Combinatorics, Vanderbilt University, Nashville, TN, May 2001 (with K. Cameron and Y. Tang*).
  • Planar domination graphs, Horizons in Combinatorics, Vanderbilt University, Nashville, TN, May 2001 (with E. M. Eschen* and W. Klostermeyer).
  • Weakly chordal graph algorithms via handles, 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, January 2000 (with R. B. Hayward and J. P. Spinrad*).
  • New algorithms for weakly chordal graphs, Special Sessions in Graph Theory, AMS Meeting #941, University of Illinois, Urbana, March 1999 (with R. B. Hayward and J. P. Spinrad*).
  • Recognition of HH-free and HHD-free graphs, 30th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, March 1999.
  • The relationship between weakly triangulated comparability graphs and chordal bipartite graphs, 9th SIAM Conference on Discrete Mathematics, Toronto, Canada, July 1998 (with E. M. Eschen*, R. B. Hayward, and J. P. Spinrad).
  • Transitive closure and transitive reduction of weakly triangulated partial orders, 12th Midwestern Conference on Combinatorics, Cryptography, and Computing, Indiana State University, Terre Haute, October 1997 (with E. M. Eschen*, R. B. Hayward, and J. P. Spinrad).
  • A Dirac-type theorem on graphs without long holes, 12th  Midwestern Conference on Combinatorics, Cryptography, and Computing, Indiana State University, Terre Haute,  October 1997.
  • Presence of good edges in graphs without long induced cycles, MIGHTY XXVII, University of Wisconsin, Oshkosh, May 1997.
  • Weakly triangulated comparability graphs, 28th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, March 1997.
  • Verification of weakly triangulated graphs, 8th SIAM Conference on Discrete Mathematics, Baltimore, MD, June 1996.
  • A characterization of some graph classes with no long holes, 7th Cumberland Conference on Combinatorics, Graph Theory, and Computing, University of Alabama, Huntsville, May 1994 (with E. M. Eschen*).
  • Recognition of weakly triangulated graphs, 6th SIAM Conference on Discrete Mathematics, Vancouver, B.C., June 1992.