List of publications

PUBLICATIONS

Book chapter

    • C. T. Hoàng and R. Sritharan, Perfect graphs, in Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, K. Thulasiraman, S. Arumugam, A. Brandstaedt, and A. Nishizeki (ed.), 706-747, Chapman&Hall/CRC Press, 2015.

Published in refereed journals

    • E. M. Eschen and R. Sritharan, Bipartite completion of colored graphs avoiding chordless cycles of given lengths, Discrete Applied Mathematics 318 (2022), 97-112.

    • A. H. Busch and R. Sritharan, Some completion problems for graphs without chordless cycles of prescribed lengths, Discrete Applied Mathematics 268 (2019), 21-34.

    • D. Artigas and R. Sritharan, On the contour of bipartite graphs, Discrete Applied Mathematics 245 (2018), 148-154.

    • K. Cook, E. M. Eschen, R. Sritharan, X. Wang, Completing colored graphs to meet a target property, Discrete Applied Mathematics 223 (2017), 39-51.

    • R. Sritharan, New results on chordal-(k, l) and strongly chordal-(k, l) sandwich problems, Journal of Combinatorial Mathematics and Combinatorial Computing 103 (2017), 127-138.

    • R. Sritharan, Graph modification problem for some classes of graphs, Journal of Discrete Algorithms 38 (2016), 32-37.

    • A. Abueida, A. H. Busch, and R. Sritharan, Hamiltonian spider intersection graphs are cycle extendable, SIAM Journal on Discrete Mathematics 27 (4) (2013), 1913-1923.

    • C. T. Hoàng, M. Kaminski, J. Sawada, and R. Sritharan, Finding and listing induced paths and cycles, Discrete Applied Mathematics 161 (2013), 633-641.

    • E. M. Eschen, C. T. Hoàng, J. P. Spinrad, and R. Sritharan, Finding a sun in building-free graphs, Graphs and Combinatorics 28 (2012), 347-364.

    • C. M. Krishnamurthy and R. Sritharan, Maximum induced matching problem on hhd-free graphs, Discrete Applied Mathematics 160 (2012), 224-230.

    • P. Heggernes, F. Mancini, C. Papodopoulos, and R. Sritharan, Strongly chordal and chordal bipartite graphs are sandwich monotone, Journal of Combinatorial Optimization 22 (2011), 438-456.

    • E. M. Eschen, C. T. Hoàng, R. Sritharan, and L. K. Stewart, On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two, Discrete Mathematics 311 (2011), 431-434.

    • E. M. Eschen, C. T. Hoàng, J. P. Spinrad, and R. Sritharan, On graphs without a C4 or a diamond, Discrete Applied Mathematics 159 (2011), 581-587.

    • A. Abueida, A. H. Busch, and R. Sritharan, A min-max property of chordal bipartite graphs with applications, Graphs and Combinatorics 26 (2010), 301-313.

    • A. Brandstädt, V. B. Le, and R. Sritharan, Structure and linear time recognition of 4-leaf powers, ACM Transactions on Algorithms 5 (2009), no. 1, Art. 11, 22 pp.

    • 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, Art 14, 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.

    • 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

    • D. Artigas and R. Sritharan, Geodeticity of the contour of chordal bipartite graphs, Electronic Notes in Discrete Mathematics, Proceedings of VIII Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS), 237-242, 2015.

    • K. Cook, E. M. Eschen, R. Sritharan, and X. Wang, Completing colored graphs to meet a target property, Proceedings of the 39th workshop on graph theoretic concepts in computer science (WG), Lecture Notes in Computer Science, 8165, 189-200, 2013.

    • A. H. Busch, F. Dragan, and R. Sritharan, New min-max theorems for weakly chordal and dually chordal graphs, Proceedings of The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA), Lecture Notes in Computer Science 6509, 207-218, 2010.

    • P. Heggernes, F. Mancini, C. Papadopoulos, and R. Sritharan, Strongly chordal and chordal bipartite graphs are sandwich monotone, Proceedings of the Fifteenth International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 5609, 398-407, 2009.

    • M. Fellows, D. Meister, F. Rosamond, R. Sritharan, and J. A. Telle, Leaf powers and their properties: using the trees, Proceedings of the Nineteenth International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 5369, 402-413, 2008.

    • 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.

    • 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.

Theses

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