2 papers
cs.DS2019
Approximating MIS over equilateral -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 -VPG graphs. These are intersection graphs of -shaped plan…
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 -free graphs and linear -uniform hypergraphs in terms of the degree sequence. This answers some old questions rais…