Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Dominating Set on Overlap Graphs of Rectangles Intersecting a Line

    A graph \(G = (V, E)\) is called a rectangle overlap graph if there is a bijection between V and a set ...

    Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee in Computing and Combinatorics (2019)

  2. No Access

    Chapter and Conference Paper

    Maximum Independent Set on \(B_1\) -VPG Graphs

    We present two approximation algorithms for the maximum independent set (MIS) problem over the class of \(B_1\) ...

    Abhiruk Lahiri, Joydeep Mukherjee in Combinatorial Optimization and Applications (2015)