10 citations · 25 across the 18 of their papers we have counts for
5 papers · 1 filter
Approximating Weighted Duo-Preservation in Comparative Genomics
Saeed Mehrabi
Motivated by comparative genomics, Chen et al. [9] introduced the Maximum Duo-preservation String Mapping (MDSM) problem in which we are given two strings and from the…
Grid-Obstacle Representations with Connections to Staircase Guarding
Therese Biedl, Saeed Mehrabi
In this paper, we study grid-obstacle representations of graphs where we assign grid-points to vertices and define obstacles such that an edge exists if and only if an -monoton…
A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid
Saeed Mehrabi
A graph is called -VPG, for some constant , if it has a string representation on an axis-parallel grid such that each vertex is a path with at most bends and…
On Guarding Orthogonal Polygons with Bounded Treewidth
Therese Biedl, Saeed Mehrabi
There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along an orthogonal pa…
Approximation Algorithms for Independence and Domination on B-VPG and B-EPG Graphs
Saeed Mehrabi
A graph is called B-VPG (resp., B-EPG), for some constant , if it has a string representation on a grid such that each vertex is an orthogonal path with at mos…