default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohsen Koohi Esfahani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Qasim Abbas
, Mohsen Koohi Esfahani, Ian M. Overton, Hans Vandierendonck:
QClique: Optimizing Performance and Accuracy in Maximum Weighted Clique. Euro-Par (3) 2024: 88-102- [i2]Mohsen Koohi Esfahani, Marco D'Antonio, Syed Ibtisam Tauhidi, Son Thai Mai, Hans Vandierendonck:
Selective Parallel Loading of Large-Scale Compressed Graphs with ParaGrapher. CoRR abs/2404.19735 (2024) - 2023
- [c9]Mohsen Koohi Esfahani, Paolo Boldi, Hans Vandierendonck, Peter Kilpatrick, Sebastiano Vigna:
On Overcoming HPC Challenges of Trillion-Scale Real-World Graph Datasets. IEEE Big Data 2023: 215-220 - [c8]Mohsen Koohi Esfahani, Paolo Boldi, Hans Vandierendonck, Peter Kilpatrick, Sebastiano Vigna:
Dataset Announcement: MS-BioGraphs, Trillion-Scale Public Real-World Sequence Similarity Graphs. IISWC 2023: 193-195 - [i1]Mohsen Koohi Esfahani, Paolo Boldi, Hans Vandierendonck, Peter Kilpatrick, Sebastiano Vigna:
MS-BioGraphs: Sequence Similarity Graph Datasets. CoRR abs/2308.16744 (2023) - 2022
- [c7]Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck:
MASTIFF: structure-aware minimum spanning tree/forest. ICS 2022: 9:1-9:13 - [c6]Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck:
SAPCo Sort: optimizing Degree-Ordering for Power-Law Graphs. ISPASS 2022: 138-140 - [c5]Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck:
LOTUS: locality optimizing triangle counting. PPoPP 2022: 219-233 - 2021
- [c4]Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck:
Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs. CLUSTER 2021: 226-237 - [c3]Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck:
Exploiting in-Hub Temporal Locality in SpMV-based Graph Processing. ICPP 2021: 42:1-42:10 - [c2]Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck:
Locality Analysis of Graph Reordering Algorithms. IISWC 2021: 101-112 - [c1]Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck:
How Do Graph Relabeling Algorithms Improve Memory Locality? ISPASS 2021: 84-86
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-09-10 02:07 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:
