
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
Chvátal and Klincsek (1980) gave an O(n^3)time algorithm for the proble...
read it

Upward Point Set Embeddings of Paths and Trees
We study upward planar straightline embeddings (UPSE) of directed trees...
read it

(Faster) MultiSided Boundary Labelling
A 1bend boundary labelling problem consists of an axisaligned rectangl...
read it

Parameterized Complexity of TwoInterval Pattern Problem
A 2interval is the union of two disjoint intervals on the real line. Tw...
read it

Maximum Bipartite Subgraph of Geometric Intersection Graphs
We study the Maximum Bipartite Subgraph(MBS) problem, which is defined a...
read it

Packing BoundaryAnchored Rectangles and Squares
Consider a set P of n points on the boundary of an axisaligned square Q...
read it

Constrained Orthogonal Segment Stabbing
Let S and D each be a set of orthogonal line segments in the plane. A li...
read it

Drawing HVRestricted Planar Graphs
A strict orthogonal drawing of a graph G=(V, E) in R^2 is a drawing of G...
read it

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
A graph G with n vertices is called an outerstring graph if it has an in...
read it

Evacuating Equilateral Triangles and Squares in the FacetoFace Model
Consider k robots initially located at a point inside a region T. Each r...
read it

Polygon Simplification by Minimizing Convex Corners
Let P be a polygon with r>0 reflex vertices and possibly with holes and ...
read it

On the Minimum Consistent Subset Problem
Let P be a set of n colored points in the plane. Introduced by Hart (196...
read it

Approximability of Covering Cells with Line Segments
In COCOA 2015, Korman et al. studied the following geometric covering pr...
read it

Boundary Labeling for Rectangular Diagrams
Given a set of n points (sites) inside a rectangle R and n points (label...
read it

Approximating Dominating Set on Intersection Graphs of Rectangles and Lframes
We consider the Minimum Dominating Set (MDS) problem on the intersection...
read it

Approximating Dominating Set on Intersection Graphs of Lframes
We consider the Dominating Set (DS) problem on the intersection graphs o...
read it

Geodesic Obstacle Representation of Graphs
An obstacle representation of a graph is a mapping of the vertices onto ...
read it

A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid
A graph G is called B_kVPG, for some constant k≥ 0, if it has a string ...
read it

GridObstacle Representations with Connections to Staircase Guarding
In this paper, we study gridobstacle representations of graphs where we...
read it

On Guarding Orthogonal Polygons with Bounded Treewidth
There exist many variants of guarding an orthogonal polygon in an orthog...
read it
Saeed Mehrabi
is this you? claim profile