4 citations · 12 across the 11 of their papers we have counts for
5 papers · 1 filter
Maximum Bipartite Subgraph of Geometric Intersection Graphs
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi +1
We study the Maximum Bipartite Subgraph (MBS) problem, which is defined as follows. Given a set of geometric objects in the plane, we want to compute a maximum-size subset…
Packing Boundary-Anchored Rectangles and Squares
Therese Biedl, Ahmad Biniaz, Anil Maheshwari +1
Consider a set of points on the boundary of an axis-aligned square . We study the boundary-anchored packing problem on in which the goal is to find a set of interior…
Drawing HV-Restricted Planar Graphs
Stephane Durocher, Stefan Felsner, Saeed Mehrabi +1
A strict orthogonal drawing of a graph in is a drawing of such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal…
Constrained Orthogonal Segment Stabbing
Sayan Bandyapadhyay, Saeed Mehrabi
Let and each be a set of orthogonal line segments in the plane. A line segment \emph{stabs} a line segment if . It is known that t…
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
Prosenjit Bose, Paz Carmi, J. Mark Keil +4
A graph with vertices is called an outerstring graph if it has an intersection representation of a set of curves inside a disk such that one endpoint of every curve is…