Ali Dehghan

Carleton University
Systems and Computer Engineering Department
Email: ali_dehghan@aut.ac.ir

Feb 2015 – Jun 2015:
Researcher at Carleton University
2011 – 2016:
PhD in Mathematics at Amirkabir University of Technology
2009 – 2011:
MSc in Computer Science at Sharif University of Technology
2005 – 2009:
BSc in Computer Science at Sharif University of Technology

1-Arash Ahadi, Ali Dehghan, The inapproximability for the (0, 1)-additive number. Discrete Mathematics & Theoretical Computer Science 17(3): 217-226 (2016)

2-Ali Dehghan, Mohammad-Reza Sadeghi, On the algorithmic complexity of zero-sum edge-coloring. Inf. Process. Lett. 116(11): 660-667 (2016)

3-Ali Dehghan, On strongly planar not-all-equal 3SAT. J. Comb. Optim. 32(3): 721-724 (2016)

4-Ali Dehghan, M.-R. Sadeghi, A. Ahadi, On the Complexity of Deciding Whether the Regular Number is at Most Two. Graphs and Combinatorics 31(5): 1359-1365 (2015)

5-Ali Dehghan, M.-R. Sadeghi, The complexity of the zero-sum 3-flows. Inf. Process. Lett. 115(2): 316-320 (2015)

6-A. Ahadi, Ali Dehghan, The complexity of the proper orientation number. Inf. Process. Lett. 113(19-21): 799-803 (2013)

7-Ali Dehghan, M.-R. Sadeghi, A. Ahadi, Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495: 25-36 (2013)

8-Ali Dehghan, A. Ahadi, Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. Discrete Applied Mathematics 160(15): 2142-2146 (2012)

9-A. Ahadi, S. Akbari, Ali Dehghan, M. Ghanbari, On the difference between chromatic number and dynamic chromatic number of graphs. Discrete Mathematics 312(17): 2579-2583 (2012)

10-A. Ahadi, Ali Dehghan, M. Kazemi, E. Mollaahmadi, Computation of lucky number of planar graphs is NP-hard. Information Processing Letters 112(4): 109-112 (2012)

Submitted

11-A. Ahadi , Ali. Dehghan, M.-R. Sadeghi, B. Stevens, Partitioning the edges of graph into regular, locally regular and/or locally irregular subgraphs is hard no matter which you choose. Submitted.

12-A. Ahadi , Ali. Dehghan, M. Saghafian, Is there any polynomial upper bound for the universal labeling of graphs? Submitted.

13-A. Ahadi , Ali. Dehghan, M.-R. Sadeghi, Sigma Partitioning: Complexity and Random Graphs. Submitted.

14-A. Ahadi , Ali. Dehghan, Complexity of Finding Disjoint Independent Dominating Sets and One-Perfect Codes. Submitted.

BOOK

Ali. Dehghan, N. Ghasem-Aghaee, Mahdi Jaberzadeh Ansari, Fundamentals of computer and programming by C++. Naghoos press, 2007. (in Persian)