10 citations · 25 across the 18 of their papers we have counts for
7 papers · 1 filter
Evacuating Equilateral Triangles and Squares in the Face-to-Face Model
Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan +1
Consider robots initially located at a point inside a region . Each robot can move anywhere in independently of other robots with maximum speed one. The goal of the robo…
Polygon Simplification by Minimizing Convex Corners
Yeganeh Bahoo, Stephane Durocher, J. Mark Keil +3
Let be a polygon with reflex vertices and possibly with holes and islands. A subsuming polygon of is a polygon such that , each connected compone…
On the Minimum Consistent Subset Problem
Ahmad Biniaz, Sergio Cabello, Paz Carmi +4
Let be a set of colored points in the plane. Introduced by Hart (1968), a consistent subset of , is a set such that for every point in ,…
Approximability of Covering Cells with Line Segments
Paz Carmi, Anil Maheshwari, Saeed Mehrabi +1
In COCOA 2015, Korman et al. studied the following geometric covering problem: given a set of line segments in the plane, find a minimum number of line segments such that e…
Boundary Labeling for Rectangular Diagrams
Prosenjit Bose, Paz Carmi, J. Mark Keil +2
Given a set of points (sites) inside a rectangle and points (label locations or ports) on its boundary, a boundary labeling problem seeks ways of connecting every site…
Geodesic Obstacle Representation of Graphs
Prosenjit Bose, Paz Carmi, Vida Dujmovic +4
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-li…
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi +1
We consider the Minimum Dominating Set (MDS) problem on the intersection graphs of geometric objects. Even for simple and widely-used geometric objects such as rectangles, no sub-l…