Brief CV
Educational records
#
Course
University
City
Country
Graduation Date
Total mean
1
B.S
Amir Kabir University of Technology
2
M.S
Sharif University of Technology
3
Ph.D
Sharif University of Technology
Research interests
#
Title
Start date
1
Theoretical Computer Science
2
Coding Theory
3
Complexity of Graph Problems
4
Computational Geometry
Journal Referee
#
Magazine Title
Date of Cooperation & Explanations
1
Theoretical Computer Science
2
Information Processing Letters
Published articles
#
Paper title
Writer
Magazine title
Publish year
Publish type
Article type
1
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
GRAPHS AND COMBINATORICS
2022
Full Text
2
On the Proper Arc Labeling of Directed Graphs
Ali Dehghan, Arash Ahadi
GRAPHS AND COMBINATORICS
2021
Full Text
3
(2/2/3)-SAT problem and its applications in dominating set problems
Arash Ahadi, Ali Dehghan
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
2019
Full Text
4
Connecting guards with minimum Steiner points inside simple polygons
Arash Ahadi, Alireza Zarei
THEORETICAL COMPUTER SCIENCE
2019
Full Text
5
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
Ali Dehghan, Sadeghi Mohammad-Reza, Arash Ahadi
ALGORITHMICA
2018
Full Text
6
Sigma Partitioning: Complexity and Random Graphs
Ali Dehghan, Mohammad-Reza Sedeghi, Arash Ahadi
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
2018
Full Text
7
Is there any polynomial upper bound for the universal labeling of graphs?
Arash Ahadi, Ali Dehghan, Morteza Sagafian
JOURNAL OF COMBINATORIAL OPTIMIZATION
2017
Full Text
8
Algorithmic complexity of weakly semiregular partitioning and the representation number
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
THEORETICAL COMPUTER SCIENCE
2017
Full Text
9
The inapproximability for the (0, 1)-additive number
Arash Ahadi, Ali Dehghan
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
2015
Full Text
10
On the Complexity of Deciding Whether the Regular Number is at Most Two
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
GRAPHS AND COMBINATORICS
2015
Full Text
11
Touring a sequence of disjoint polygons: Complexity and extension
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
THEORETICAL COMPUTER SCIENCE
2014
Full Text
12
Algorithmic complexity of proper labeling problems
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
THEORETICAL COMPUTER SCIENCE
2013
Full Text
13
The complexity of the proper orientation number
Arash Ahadi, Ali Dehghan
INFORMATION PROCESSING LETTERS
2013
Full Text
14
Silver block intersection graphs of steiner 2-designs
Arash Ahadi, Nazli Besharati, Seyyed Ebadollah Mahmoodian, Masood Mortezaeefar
GRAPHS AND COMBINATORICS
2013
Full Text
15
Computation of lucky number of planar graphs is NP-hard
Arash Ahadi, Ali Dehghan, Mohammadreza Kazemi, Esmaeil Mollaahmadi
INFORMATION PROCESSING LETTERS
2012
Full Text
16
On the difference between chromatic number and dynamic chromatic number of graphs
Ali Dehghan, Arash Ahadi, Saeed Akbari, Mryam Ghanbari
DISCRETE MATHEMATICS
2012
Full Text
17
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Ali Dehghan, Arash Ahadi
DISCRETE APPLIED MATHEMATICS
2012
Full Text
Presented articles
#
Title
Writer
Conference
Date
Presentation type
1
Touring Convex Polygons in Polygonal Domain Fences
Arash Ahadi, Amirhossein Mozaffari, Alireza Zarei
INTERNATIONAL CONFERENCE ON COMBINATORIAL OPTIMIZATION AND APPLICATIONS - China
1396/09/25
Oral
2
On Connecting with Neighborhoods: Complexity and Algorithms
Arash Ahadi, Alireza Zarei
Iran, Amir Kabir University of Thechnology
1394/08/28
Oral
3
Touring Disjoint Polygons Problem Is NP-Hard
Alireza Zarei, Arash Ahadi, Amirhossein Mozaffari
International Conference on Combinatorial Optimization and Applications - China
1392/09/21
Oral