4 citations · 7 across the 8 of their papers we have counts for
23 papers
Shortest Beer Path Queries in Outerplanar Graphs
Joyce Bacic, Saeed Mehrabi, Michiel Smid
A \emph{beer graph} is an undirected graph , in which each edge has a positive weight and some vertices have a beer store. A \emph{beer path} between two vertices and in…
Bottleneck Convex Subsets: Finding Large Convex Sets in a Point Set
Stephane Durocher, J. Mark Keil, Saeed Mehrabi +1
Chvátal and Klincsek (1980) gave an -time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set of points in the plane.…
Upward Point Set Embeddings of Paths and Trees
Elena Arseneva, Pilar Cano, Linda Kleist +4
We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set has size at least the number of vertices in the tree. For the…
(Faster) Multi-Sided Boundary Labelling
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
A 1-bend boundary labelling problem consists of an axis-aligned rectangle , points (called sites) in the interior, and points (called ports) on the labels along the boun…
Parameterized Complexity of Two-Interval Pattern Problem
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
A \emph{2-interval} is the union of two disjoint intervals on the real line. Two 2-intervals and are \emph{disjoint} if their intersection is empty (i.e., no interval o…
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…