1 citations · 1 across the 3 of their papers we have counts for
4 papers
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Girish Balakrishnan, Sankardeep Chakraborty, N S Narayanaswamy +1
We improve the worst-case information theoretic lower bound of Munro and Wu (ISAAC 2018) for vertex unlabeled chordal graphs when vertex leafage is bounded and leafage is unbou…
Succinct Data Structure for Graphs with -Dimensional -Representation
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo +2
Erdős and West (Discrete Mathematics'85) considered the class of vertex intersection graphs which have a {\em -dimensional} {\em -representation}, that is, each vertex of…
Another Disjoint Compression Algorithm for OCT
R. Krithika, N. S. Narayanaswamy
We describe an elegant O*(2^k) algorithm for the disjoint compression problem for Odd Cycle Transversal based on a reduction to Above Guarantee Vertex Cover. We believe that this a…
Tree t-spanners in Outerplanar Graphs via Supply Demand Partition
N. S. Narayanaswamy, G. Ramakrishna
A tree t-spanner of an unweighted graph G is a spanning tree T such that for every two vertices their distance in T is at most t times their distance in G. Given an unweighted grap…