Skip to main content

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)