Amirhossein Mozafari

According to our database, Amirhossein Mozafari authored at least 9 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons.

Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

An Efficient Algorithm for the Proximity Connected Two Center Problem.

Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic.

Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2018

Transmitting Particles in a Polygonal Domain by Repulsion.

Amirhossein Mozafari, Thomas C. Shermer

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Touring Convex Polygons in Polygonal Domain Fences.

Arash Ahadi, Amirhossein Mozafari, Alireza Zarei

Proceedings of the Combinatorial Optimization and Applications, 2017

2015

Touring a Sequence of Line Segments in Polygonal Domain Fences.

Amirhossein Mozafari, Alireza Zarei

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Touring a sequence of disjoint polygons: Complexity and extension.

Arash Ahadi, Amirhossein Mozafari, Alireza Zarei

Theor. Comput. Sci., 2014

2013

Touring Disjoint Polygons Problem Is NP-Hard.

Arash Ahadi, Amirhossein Mozafari, Alireza Zarei

Proceedings of the Combinatorial Optimization and Applications, 2013

2012

Touring Polygons: An Approximation Algorithm.

Amirhossein Mozafari, Alireza Zarei

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012