default search action
H. Salehi Fathabadi
Person information
- affiliation: University of Tehran, School of Mathematics, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j10]Mohammad A. Raayatpanah, H. Salehi Fathabadi, H. Bahramgiri, Panos M. Pardalos:
Optimal-constrained multicast sub-graph over coded packet networks. J. Comb. Optim. 29(4): 723-738 (2015) - 2014
- [j9]Farhaneh Hamzezadeh, Hassan Salehi Fathabadi:
Capacity Expansion and Reliability Evaluation on the Networks Flows with Continuous Stochastic Functional Capacity. J. Appl. Math. 2014: 876260:1-876260:9 (2014) - [j8]Mohammad A. Raayatpanah, H. Salehi Fathabadi, Babak H. Khalaj, Salman Khodayifar, Panos M. Pardalos:
Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks. J. Netw. Comput. Appl. 41: 217-227 (2014) - 2013
- [j7]Mohammad A. Raayatpanah, H. Salehi Fathabadi, Babak H. Khalaj, Salman Khodayifar:
Minimum cost multiple multicast network coding with quantized rates. Comput. Networks 57(5): 1113-1123 (2013) - 2012
- [j6]H. Salehi Fathabadi, Marzieh Khodaei:
Reliability evaluation of network flows with stochastic capacity and cost constraint. Int. J. Math. Oper. Res. 4(4): 439-452 (2012) - 2011
- [j5]Hassan Salehi Fathabadi, Vahid Hashemi:
Circular and radial design comparison of survivability in asymmetrical hierarchical networks. Int. J. Comput. Math. 88(14): 2926-2935 (2011) - 2010
- [j4]Seyed Ahmad Hosseini, Hassan Salehi Fathabadi:
Minimum Cost Flow Problem on Dynamic Multi Generative Network flows. Algorithmic Oper. Res. 5(1): 39-48 (2010)
2000 – 2009
- 2009
- [j3]H. Salehi Fathabadi, Majid Forghani-elahabad:
A note on "A simple approach to search for all d-MCs of a limited-flow network". Reliab. Eng. Syst. Saf. 94(11): 1878-1880 (2009) - 2007
- [j2]Hassan Salehi Fathabadi, Mehdi Ghiyasvand:
A new algorithm for solving the feasibility problem of a network flow. Appl. Math. Comput. 192(2): 429-438 (2007)
1990 – 1999
- 1995
- [j1]H. Salehi Fathabadi, H. Ahrabian:
A new algorithm for minimum spanning tree using depth-first-search in an undirected graph. Int. J. Comput. Math. 57(3-4): 157-161 (1995)
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 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint