default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFatemeh Esfahani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j2]Yang Guo
, Fatemeh Esfahani, Xiaojian Shao, Venkatesh Srinivasan, Alex Thomo, Li Xing, Xuekui Zhang:
Integrative COVID-19 biological network inference with probabilistic core decomposition. Briefings Bioinform. 23(1) (2022)- [j1]Fatemeh Esfahani, Mahsa Daneshmand, Venkatesh Srinivasan, Alex Thomo, Kui Wu:
Scalable probabilistic truss decomposition using central limit theorem and H-index. Distributed Parallel Databases 40(2-3): 299-333 (2022) - [c6]Fatemeh Esfahani, Venkatesh Srinivasan, Alex Thomo, Kui Wu:
Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms. ICDE 2022: 218-231 - 2021
- [b1]Fatemeh Esfahani:
Dense subgraph mining in probabilistic graphs. University of Victoria, Canada, 2021 - [c5]Yang Guo, Xuekui Zhang, Fatemeh Esfahani, Venkatesh Srinivasan, Alex Thomo, Li Xing:
Multi-stage graph peeling algorithm for probabilistic core decomposition. ASONAM 2021: 532-539 - [c4]Masuda Akter Tonima, Fatemeh Esfahani, Austin Dehart, Youmin Zhang:
Lightweight Combinational Machine Learning Algorithm for Sorting Canine Torso Radiographs. ICPS 2021: 347-352 - [c3]Fatemeh Esfahani, Mahsa Daneshmand, Venkatesh Srinivasan, Alex Thomo, Kui Wu:
Truss Decomposition on Large Probabilistic Networks using H-Index. SSDBM 2021: 145-156 - [i3]Masuda Akter Tonima, Fatemeh Esfahani, Austin Dehart, Youmin Zhang:
Lightweight Combinational Machine Learning Algorithm for Sorting Canine Torso Radiographs. CoRR abs/2102.11385 (2021) - [i2]Yang Guo, Xuekui Zhang, Fatemeh Esfahani, Venkatesh Srinivasan, Alex Thomo, Li Xing:
Multi-Stage Graph Peeling Algorithm for Probabilistic Core Decomposition. CoRR abs/2108.06094 (2021) - 2020
- [i1]Fatemeh Esfahani, Venkatesh Srinivasan, Alex Thomo, Kui Wu:
Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms. CoRR abs/2006.01958 (2020)
2010 – 2019
- 2019
- [c2]Fatemeh Esfahani, Venkatesh Srinivasan, Alex Thomo, Kui Wu:
Efficient Computation of Probabilistic Core Decomposition at Web-Scale. EDBT 2019: 325-336 - [c1]Fatemeh Esfahani, Jian Wu, Venkatesh Srinivasan, Alex Thomo, Kui Wu:
Fast Truss Decomposition in Large-scale Probabilistic Graphs. EDBT 2019: 722-725
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:57 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:
