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 2006Show all

4 papers · 1 filter

math.CO2006

Boxicity and Maximum degree

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

An axis-parallel $d$ --dimensional box is a Cartesian product $R_{1} \times R_{2} \times ... \times R_{d}$ where $R_{i}$ (for $1 \leq i \leq d$ ) is a closed interval of the form $[a_{i}, b_{i}]$ …

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…

math.CO2006★ 1 cited

On the Boxicity and Cubicity of Hypercubes

L. Sunil Chandran, Naveen Sivadasan

For a graph $G$ , its \emph{cubicity} $c u b (G)$ is the minimum dimension $k$ such that $G$ is representable as the intersection graph of (axis--parallel) cubes in $k$ --dimensional sp…

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…