# R. Sritharan

• SODA
• 2000
We use the notion of handle, introduced by Hayward, to improve algorithms for weakly chordal graphs. For recognition we reduce the time complexity from O(n2m) to O(rn 2) and the space complexity from O(n 3) to O(n + m), and also produce a hole or antihole if the input graph is not weakly chordal. For the optimization problems clique, independent set,(More)
• SODA
• 2004
We consider the problem of partitioning the vertex-set of a graph into at most <i>k</i> parts <i>A<inf>1,</inf> A<inf>2,...,</inf> A<inf>k,</inf></i> where it may be specified that <i>A<inf>i</inf></i> induce a stable set, a clique, or an arbitrary subgraph, and pairs <i>A<inf>i,</inf> A<inf>j</inf> (i &#8800; j)</i> be completely non-adjacent, completely(More)
• Discrete Applied Mathematics
• 2003
This paper presents new algorithms for recognizing several classes of perfectly orderable graphs. Bipolarizable and P4-simplicial graphs are recognized in O(n) time, improving the previous bounds of O(n) and O(n), respectively. Brittle and semi-simplicial graphs are recognized in O(n) time using a randomized algorithm, and O(n logn) time if a deterministic(More)
• 2
• ACM Trans. Algorithms
• 2008
A graph <i>G</i> is the <i>k-leaf power</i> of a tree <i>T</i> if its vertices are leaves of <i>T</i> such that two vertices are adjacent in <i>G</i> if and only if their distance in <i>T</i> is at most <i>k</i>. Then <i>T</i> is a <i>k-leaf root</i> of <i>G</i>. This notion was introduced and studied by Nishimura, Ragde, and Thilikos [2002], motivated by(More)
• SIAM J. Discrete Math.
• 2007
The k-partition problem is as follows: Given a graph G and a positive integer k, partition the vertices of G into at most k parts A1, A2, . . . , Ak, where it may be specified that Ai induces a stable set, a clique, or an arbitrary subgraph, and pairs Ai, Aj (i = j) be completely nonadjacent, completely adjacent, or arbitrarily adjacent. The list(More)