Skip to main content

4 Result(s)

within Joydeep Mukherjee Remove this filter English Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Computer Graphics Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Connected Feedback VertexSet on AT-Free Graphs

    A connected feedback vertex set of a graph is a connected subgraph of the graph whose removal makes the graph cycle free. In this paper, we give an approximation algorithm that computes a connected feedback ve...

    Joydeep Mukherjee, Tamojit Saha in Combinatorial Algorithms (2023)

  2. No Access

    Chapter and Conference Paper

    Finding a Largest-Area Triangle in a Terrain in Near-Linear Time

    A terrain is an x-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in ...

    Sergio Cabello, Arun Kumar Das, Sandip Das… in Algorithms and Data Structures (2021)

  3. 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)

  4. 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)