Amirhossein Mozafari

12 papers B 1C 4Journal 3Unranked 4
YearRankTypeTitle / Venue / Authors
2025 B conf
CleverCatch: A Knowledge-Guided Weak Supervision Model for Fraud Detection.
IEEE Big Data
Amirhossein Mozafari, Kourosh Hashemi, Erfan Shafagh, Soroush Motamedi, Azar Taheri Tayebi, Mohammad A. Tayebi
2025 J jnl
CleverCatch: A Knowledge-Guided Weak Supervision Model for Fraud Detection.
CoRR
Amirhossein Mozafari, Kourosh Hashemi, Erfan Shafagh, Soroush Motamedi, Azar Taheri Tayebi, Mohammad A. Tayebi
2023 — conf
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons.
COCOON (2)
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2022 — conf
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic.
CCCG
Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari
2022 C conf
An Efficient Algorithm for the Proximity Connected Two Center Problem.
IWOCA
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2022 J jnl
An Efficient Algorithm for the Proximity Connected Two Center Problem.
CoRR
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2018 C conf
Transmitting Particles in a Polygonal Domain by Repulsion.
COCOA
Amirhossein Mozafari, Thomas C. Shermer
2017 — conf
Touring Convex Polygons in Polygonal Domain Fences.
COCOA (2)
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
2015 — conf
Touring a Sequence of Line Segments in Polygonal Domain Fences.
CCCG
Amirhossein Mozafari, Alireza Zarei
2014 J jnl
Touring a sequence of disjoint polygons: Complexity and extension.
Theor. Comput. Sci.
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
2013 C conf
Touring Disjoint Polygons Problem Is NP-Hard.
COCOA
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
2012 C conf
Touring Polygons: An Approximation Algorithm.
IWOCA
Amirhossein Mozafari, Alireza Zarei