C. Subramanian

activity

20112019

most citedCartesian Product and Acyclic Edge Colouring

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2019

Approximating MIS over equilateral $B_{1}$ -VPG graphs

Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian

We present an approximation algorithm for the maximum independent set (MIS) problem over the class of equilateral $B_{1}$ -VPG graphs. These are intersection graphs of $L$ -shaped plan…

math.CO2015★ 1 cited

Cartesian Product and Acyclic Edge Colouring

Rahul Muthu, C. R. Subramanian

The acyclic chromatic index, denoted by $a^{'} (G)$ , of a graph $G$ is the minimum number of colours used in any proper edge colouring of $G$ such that the union of any two colour clas…

math.CO2011

New lower bounds for the independence number of sparse graphs and hypergraphs

Kunal Dutta, Dhruv Mubayi, C. R. Subramanian

We obtain new lower bounds for the independence number of $K_{r}$ -free graphs and linear $k$ -uniform hypergraphs in terms of the degree sequence. This answers some old questions rais…

Approximating MIS over equilateral B1​-VPG graphs

Cartesian Product and Acyclic Edge Colouring

New lower bounds for the independence number of sparse graphs and hypergraphs

Approximating MIS over equilateral $B_{1}$ -VPG graphs