N. Sivadasan

activity

20052025

most citedKmerlight: fast and accurate k-mer abundance estimation

11 citations · 32 across the 20 of their papers we have counts for

collaborators

Showing cs.DMShow all

5 papers · 1 filter

cs.DM2014★ 3 cited

Approximating the Cubicity of Trees

Jasine Babu, Manu Basavaraju, L Sunil Chandran +2

Cubicity of a graph $G$ is the smallest dimension $d$ , for which $G$ is a unit disc graph in $R^{d}$ , under the $l^{\infty}$ metric, i.e. $G$ can be represented as an inters…

cs.DM2008

On the cubicity of bipartite graphs

L. Sunil Chandran, Anita Das, Naveen Sivadasan

{\it A unit cube in $k$ -dimension (or a $k$ -cube) is defined as the cartesian product $R_{1} \times R_{2} \times ... \times R_{k}$ , where each $R_{i}$ is a closed interval on the real line…

cs.DM2008

On the cubicity of AT-free graphs and circular-arc graphs

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

A unit cube in $k$ dimensions ( $k$ -cube) is defined as the the Cartesian product $R_{1} \times R_{2} \times ... \times R_{k}$ where $R_{i}$ (for $1 \leq i \leq k$ ) is a closed interval of the for…

cs.DM2006★ 3 cited

Representing graphs as the intersection of axis-parallel cubes

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

A unit cube in $k$ dimensional space (or \emph{ $k$ -cube} in short) is defined as the Cartesian product $R_{1} \times R_{2} \times ... \times R_{k}$ where $R_{i}$ (for $1 \leq i \leq k$ ) is a clos…

cs.DM2006

Geometric representation of graphs in low dimension

L. Sunil Chandran, Mathew C Francis, Naveen Sivadasan

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (Δ + 2) ln n$ dimensions, where $Δ$ is the maximum degree of G. We…