activity
20092023
most citedFinding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete

6 citations · 9 across the 7 of their papers we have counts for

collaborators

7 papers

cs.CV2023

Multi-Modal Evaluation Approach for Medical Image Segmentation

Seyed M. R. Modaresi, Aomar Osmani, Mohammadreza Razzazi +1

Manual segmentation of medical images (e.g., segmenting tumors in CT scans) is a high-effort task that can be accelerated with machine learning techniques. However, selecting the r…

cs.MA2022★ 1 cited

Natural Way of Solving a Convex Hull Problem

Sina Saadati, Mohammadreza Razzazi

In this article, a new solution for the convex hull problem has been presented. The convex hull is a widely known problem in computational geometry. As nature is a rich source of i…

cs.CC2017★ 6 cited

Finding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete

Mohammadreza Razzazi, Abdolah Sepahvand

Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, l…

cs.DS2017

Inferring protein-protein interaction and protein-DNA interaction directions based on cause-effect pairs in undirected and mixed networks

Mehdy Roayaei, MohammadReza Razzazi

We consider the following problem: Given an undirected (mixed) network and a set of ordered source-target, or cause-effect pairs, direct all edges so as to maximize the number of p…

cs.RO2017★ 2 cited

Improper Filter Reduction

Fatemeh Zahra Saberifar, Ali Mohades, Mohammadreza Razzazi +1

Combinatorial filters have been the subject of increasing interest from the robotics community in recent years. This paper considers automatic reduction of combinatorial filters to…

cs.CG2013

Output sensitive algorithm for covering many points

Hossein Ghasemalizadeh, Mohammadreza Razzazi

A set of points and a positive integer are given and our goal is to cover the maximum number of these point with disks. We devise the first output sensitive algorithm for t…

cs.CG2009

Complexity of Planar Embeddability of Trees inside Simple Polygons

Alireza Bagheri, Mohammadreza Razzazi

Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a s…