default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArash Ahadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i13]Hazhar Rahmani
, Arash Ahadi, Jie Fu:
Optimal Sensor Deception to Deviate from an Allowed Itinerary. CoRR abs/2308.00911 (2023)- 2022
- [j17]Ali Dehghan, Arash Ahadi:
On the Proper Arc Labeling of Directed Graphs. Graphs Comb. 38(1): 1 (2022) - [j16]Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan:
On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard. Graphs Comb. 38(3): 52 (2022) - 2021
- [i12]Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan:
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard. CoRR abs/2102.00535 (2021)
2010 – 2019
- 2019
- [j15]Arash Ahadi, Ali Dehghan:
(2/2/3)-SAT problem and its applications in dominating set problems. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j14]Arash Ahadi, Alireza Zarei:
Connecting guards with minimum Steiner points inside simple polygons. Theor. Comput. Sci. 775: 26-31 (2019) - 2018
- [j13]Ali Dehghan, Mohammad-Reza (Rafsanjani) Sadeghi, Arash Ahadi:
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. Algorithmica 80(12): 3704-3727 (2018) - [j12]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Sigma Partitioning: Complexity and Random Graphs. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [i11]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. CoRR abs/1801.04472 (2018) - [i10]Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi, Brett Stevens:
On the algorithmic complexity of decomposing graphs into regular/irregular structures. CoRR abs/1801.08876 (2018) - 2017
- [j11]Arash Ahadi, Ali Dehghan, Morteza Saghafian:
Is there any polynomial upper bound for the universal labeling of graphs? J. Comb. Optim. 34(3): 760-770 (2017) - [j10]Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei:
Algorithmic complexity of weakly semiregular partitioning and the representation number. Theor. Comput. Sci. 674: 60-72 (2017) - [c2]Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring Convex Polygons in Polygonal Domain Fences. COCOA (2) 2017: 61-75 - [i9]Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei:
Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number. CoRR abs/1701.05934 (2017) - [i8]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Algorithmic complexity of proper labeling problems. CoRR abs/1701.06669 (2017) - [i7]Arash Ahadi, Ali Dehghan, Morteza Saghafian:
Is there any polynomial upper bound for the universal labeling of graphs? CoRR abs/1701.06685 (2017) - 2016
- [j9]Arash Ahadi, Ali Dehghan:
The inapproximability for the (0, 1)-additive number. Discret. Math. Theor. Comput. Sci. 17(3): 217-226 (2016) - [i6]Arash Ahadi, Ali Dehghan:
(2/2/3)-SAT problem and its applications in dominating set problems. CoRR abs/1605.01319 (2016) - 2015
- [j8]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
On the Complexity of Deciding Whether the Regular Number is at Most Two. Graphs Comb. 31(5): 1359-1365 (2015) - 2014
- [j7]Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring a sequence of disjoint polygons: Complexity and extension. Theor. Comput. Sci. 556: 45-54 (2014) - [i5]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
On the complexity of deciding whether the regular number is at most two. CoRR abs/1403.1182 (2014) - [i4]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
The Complexity of the Sigma Chromatic Number of Cubic Graphs. CoRR abs/1403.6288 (2014) - 2013
- [j6]Arash Ahadi, Nazli Besharati, Ebadollah S. Mahmoodian, M. Mortezaeefar:
Silver Block Intersection Graphs of Steiner 2-Designs. Graphs Comb. 29(4): 735-746 (2013) - [j5]Arash Ahadi, Ali Dehghan:
The complexity of the proper orientation number. Inf. Process. Lett. 113(19-21): 799-803 (2013) - [j4]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495: 25-36 (2013) - [c1]Arash Ahadi, Amirhossein Mozafari, Alireza Zarei:
Touring Disjoint Polygons Problem Is NP-Hard. COCOA 2013: 351-360 - [i3]Arash Ahadi, Ali Dehghan:
The Complexity of the Proper Orientation Number. CoRR abs/1305.6432 (2013) - [i2]Arash Ahadi, Ali Dehghan:
The Inapproximability for the (0, 1)-additive number. CoRR abs/1306.0182 (2013) - 2012
- [j3]Ali Dehghan, Arash Ahadi:
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. Discret. Appl. Math. 160(15): 2142-2146 (2012) - [j2]Arash Ahadi, Saieed Akbari, Ali Dehghan, Maryam Ghanbari:
On the difference between chromatic number and dynamic chromatic number of graphs. Discret. Math. 312(17): 2579-2583 (2012) - [j1]Arash Ahadi, Ali Dehghan, Mohammad Reza Kazemi, E. Mollaahmadi:
Computation of lucky number of planar graphs is NP-hard. Inf. Process. Lett. 112(4): 109-112 (2012)
2000 – 2009
- 2009
- [i1]Arash Ahadi, Ali Dehghan:
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. CoRR abs/0911.4199 (2009)
Coauthor Index
aka: Mohammad-Reza (Rafsanjani) Sadeghi
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
