default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArdeshir Dolati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Ehsan Jafari, Ardeshir Dolati, Kamran Layeghi:
Object tracking using local structural information and energy minimization. J. Supercomput. 80(4): 5255-5278 (2024)- 2023
- [j11]Ehsan Jafari, Ardeshir Dolati, Kamran Layeghi:
Object tracking using fuzzy-based improved graph, interesting patches and multi-label MRF optimization. Multim. Syst. 29(3): 1431-1451 (2023) - 2022
- [j10]Hossein Karimi, Ardeshir Dolati, Kamran Layeghi:
Stereo matching by using a new local descriptor based on sign and order in belief propagation algorithm. Displays 75: 102300 (2022) - 2021
- [j9]Mohammad Hashem Faezi, Shahriar Bijani, Ardeshir Dolati:
DEGAN: Decentralized generative adversarial networks. Neurocomputing 419: 335-343 (2021) - [j8]Saeid Hanifehnezhad, Ardeshir Dolati:
Cut Star of an Undirected Graph. J. Interconnect. Networks 21(2): 2150006:1-2150006:8 (2021) - 2020
- [j7]Saeid Hanifehnezhad, Ardeshir Dolati:
Symmetric submodular system: Contractions and Gomory-Hu tree. Inf. Comput. 271: 104479 (2020)
2010 – 2019
- 2018
- [j6]Neda Sangsefidi, Amir Hossein Foruzan
, Ardeshir Dolati:
Balancing the data term of graph-cuts algorithm to improve segmentation of hepatic vascular structures. Comput. Biol. Medicine 93: 117-126 (2018) - 2017
- [c5]Neda Sangsefidi, Amir Hossein Foruzan, Ardeshir Dolati, Yen-Wei Chen:
Incorporating a locally estimated appearance model in the graphcuts algorithm to extract small hepatic vessels. ICIP 2017: 2324-2328 - [c4]Ardeshir Dolati:
A Characterization of Horoidal Digraphs. TTCS 2017: 11-25 - [c3]Saeid Hanifehnezhad, Ardeshir Dolati:
Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System. TTCS 2017: 26-33 - [c2]Mobarakeh Karimi, Massoud Aman, Ardeshir Dolati:
Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance. TTCS 2017: 34-40 - 2012
- [j5]Ardeshir Dolati, Somayyeh Golalizadeh:
The Tight Upper Bound for the Number of Matchings of Tricyclic Graphs. Electron. J. Comb. 19(1): 69 (2012) - [j4]Ardeshir Dolati, Somayyeh Golalizadeh:
Sharp bounds for the number of matchings in generalized-theta-graphs. Discuss. Math. Graph Theory 32(4): 771-782 (2012) - 2011
- [j3]Ardeshir Dolati:
On the number of independent sets in cycle-separated tricyclic graphs. Comput. Math. Appl. 61(6): 1542-1546 (2011) - 2010
- [j2]Ardeshir Dolati, Imaneh Motevalian, Akram Ehyaee:
Szeged index, edge Szeged index, and semi-star trees. Discret. Appl. Math. 158(8): 876-881 (2010)
2000 – 2009
- 2008
- [j1]Ardeshir Dolati, S. Mehdi Hashemi:
On the sphericity testing of single source digraphs. Discret. Math. 308(11): 2175-2181 (2008) - [c1]Ardeshir Dolati:
Digraph Embedding on Th. CTW 2008: 11-14
Coauthor Index
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-04-24 23:06 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:
