23 citations · 51 across the 26 of their papers we have counts for
28 papers
An Efficient Construction of Yao-Graph in Data-Distributed Settings
Sepideh Aghamolaei, Mohammad Ghodsi
A sparse graph that preserves an approximation of the shortest paths between all pairs of points in a plane is called a geometric spanner. Using range trees of sublinear size, we d…
A parallel algorithm for Delaunay triangulation of moving points on the plane
Nazanin Hadiniya, Mohammad Ghodsi
Delaunay Triangulation(DT) is one of the important geometric problems that is used in various branches of knowledge such as computer vision, terrain modeling, spatial clustering an…
Trajectory Range Visibility
Seyed Mohammad Hussein Kazemi, Arash Vaezi, Mohammad Ali Abam +1
Consider two entities with constant but not necessarily equal velocities, moving on two given piece-wise linear trajectories inside a simple polygon . The Trajectory Range Visib…
A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery
Arash Vaezi, Mohammad Ghodsi
Given a simple polygon , in the Art Gallery problem the goal is to find the minimum number of guards needed to cover the entire , where a guard is a point and can s…
Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits
Mohammad Ghodsi, Amirmahdi Mirfakhar
The classic cake-cutting problem provides a model for addressing the fair and efficient allocation of a divisible, heterogeneous resource among agents with distinct preferences. Fo…
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades +1
The -center problem is to choose a subset of size from a set of points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\l…
Art Gallery Plus Single Specular-reflection
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
Given a simple polygon , in the Art Gallery problem, the goal is to find the minimum number of guards needed to cover the entire , where a guard is a point and can…
Computing The Packedness of Curves
Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi +1
A polygonal curve with vertices is -packed, if the sum of the lengths of the parts of the edges of the curve that are inside any disk of radius is at most , for…
Visibility Extension via Reflection
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
This paper studies a variant of the Art Gallery problem in which the ``walls" can be replaced by \emph{reflecting edges}, which allows the guards to see further and thereby see a l…
Parsisanj: a semi-automatic component-based approach towards search engine evaluation
Amin Heydari Alashti, Ahmad Asgharian Rezaei, Alireza Elahi +2
Accessing to required data on the internet is wide via search engines in the last two decades owing to the huge amount of available data and the high rate of new data is generating…
Approximating The p-Mean Curve of Large Data-Sets
Sepideh Aghamolaei, Mohammad Ghodsi
A set of piecewise linear functions, called polylines, each with at most vertices can be simplified into a polyline with vertices, such that the Fréche…
A Composable Coreset for k-Center in Doubling Metrics
Sepideh Aghamolaei, Mohammad Ghodsi
A set of points in a metric space and a constant integer are given. The -center problem finds points as centers among , such that the maximum distance of any poin…
On the Distortion Value of the Elections with Abstention
Mohammad Ghodsi, Mohamad Latifian, Masoud Seddighin
In Spatial Voting Theory, distortion is a measure of how good the winner is. It is proved that no deterministic voting mechanism can guarantee a distortion better than , even fo…
Visibility Extension via Reflective Edges to an Exact Quantity
Arash Vaezi, Mohammad Ghodsi
We consider extending the visibility polygon of a given point , inside a simple polygon by converting some edges of to mirrors. We will show that several variations of t…
Fair Allocation of Indivisible Items With Externalities
Mohammad Ghodsi, Hamed Saleh, Masoud Seddighin
One of the important yet insufficiently studied subjects in fair allocation is the externality effect among agents. For a resource allocation problem, externalities imply that a bu…
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi +2
The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another…
Expanding Visibility Polygons by Mirrors upto at least K units
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi +1
We consider extending visibility polygon of a given point , inside a simple polygon by converting some edges of to mirrors. We will show that several va…
Fair Allocation of Indivisible Goods to Asymmetric Agents
Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi +5
We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings.…
Fair Allocation of Indivisible Goods: Improvement and Generalization
Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Masoud Seddighin +2
We study the problem of fair allocation for indivisible goods. We use the the maxmin share paradigm introduced by Budish as a measure for fairness. Procaccia and Wang (EC'14) were…
Approximate Minimum Diameter
Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is…
Clearing an Orthogonal Polygon Using Sliding Robots
Mohammad Ghodsi, Salma Sadat Mahdavi, Ali Narenji Sheshkalani
In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In this paper, we consider a new…
An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
Sharareh Alipour, Mohammad Ghodsi, Amir Jafari
Given a set of disjoint line segments in , the visibility counting problem (VCP) is to preprocess such that the number of segments in visible from a…
Randomized Strategy for Walking in Streets for a Simple Robot
Azadeh Tabatabaei, Mohammad Ghodsi
We consider the problem of walking in an unknown street, for a robot that has a minimal sensing capability. The robot is equipped with a sensor that only detects the discontinuitie…
Weak Visibility Queries of Line Segments in Simple Polygons and Polygonal Domains
Mojtaba Nouri Bygi, Mohammad Ghodsi
In this paper we consider the problem of computing the weak visibility polygon of any query line segment (or ) inside a given polygon . Our first non-trivial algor…