![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
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...
-
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 ...
-
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 ...
-
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\) ...