Touring Polygons: An Approximation Algorithm. - Amirhossein Mozafari; Alireza Zarei (IWOCA, 2012)

Touring Disjoint Polygons Problem Is NP-Hard. - Arash Ahadi; Amirhossein Mozafari; Alireza Zarei (COCOA, 2013)

Touring a sequence of disjoint polygons: Complexity and extension. - Arash Ahadi; Amirhossein Mozafari; Alireza Zarei (Theor. Comput. Sci., 2014)

Touring a Sequence of Line Segments in Polygonal Domain Fences. - Amirhossein Mozafari; Alireza Zarei (CCCG, 2015)

Touring Convex Polygons in Polygonal Domain Fences. - Arash Ahadi; Amirhossein Mozafari; Alireza Zarei (COCOA (2), 2017)

Transmitting Particles in a Polygonal Domain by Repulsion. - Amirhossein Mozafari; Thomas C. Shermer (COCOA, 2018)

A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. - Binay Bhattacharya; Tsunehiko Kameda; Amirhossein Mozafari (CCCG, 2022)

An Efficient Algorithm for the Proximity Connected Two Center Problem. - Binay Bhattacharya; Amirhossein Mozafari; Thomas C. Shermer (IWOCA, 2022)

A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. - Binay Bhattacharya; Amirhossein Mozafari; Thomas C. Shermer (COCOON (2), 2023)