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 math.COShow all

6 papers · 1 filter

math.CO2014

The chromatic discrepancy of graphs

N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep +1

For a proper vertex coloring $c$ of a graph $G$ , let $φ_{c} (G)$ denote the maximum, over all induced subgraphs $H$ of $G$ , the difference between the chromatic number $χ (H)$ and the…

math.CO2010

Boxicity of Line Graphs

L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan

Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for…

math.CO2008★ 2 cited

Lower Bounds for Boxicity

Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan

An axis-parallel $b$ -dimensional box is a Cartesian product $R_{1} \times R_{2} \times ... \times R_{b}$ where $R_{i}$ is a closed interval of the form $[a_{i}, b_{i}]$ on the real line. For a grap…

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}]$ …

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…

math.CO2005

Boxicity and Treewidth

L. Sunil Chandran, Naveen Sivadasan

In this paper, we relate the seemingly unrelated concepts of treewidth and boxicity. Our main result is that, for any graph G, boxicity(G) <= treewidth(G) + 2. We also show that th…