default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaroslav Akhremtsev
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j3]Sebastian Schlag
, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. ACM J. Exp. Algorithmics 27: 1.9:1-1.9:39 (2022)- 2021
- [i5]Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. CoRR abs/2106.08696 (2021) - 2020
- [j2]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
High-Quality Shared-Memory Graph Partitioning. IEEE Trans. Parallel Distributed Syst. 31(11): 2710-2722 (2020)
2010 – 2019
- 2019
- [b1]Yaroslav Akhremtsev:
Parallel and External High Quality Graph Partitioning. Karlsruhe Institute of Technology, Germany, 2019 - 2018
- [c4]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
High-Quality Shared-Memory Graph Partitioning. Euro-Par 2018: 659-671 - 2017
- [j1]Igor Kabiljo, Brian Karrer, Mayank Pundir, Sergey Pupyrev, Alon Shalita, Yaroslav Akhremtsev, Alessandro Presta:
Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner. Proc. VLDB Endow. 10(11): 1418-1429 (2017) - [c3]Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Engineering a direct k-way Hypergraph Partitioning Algorithm. ALENEX 2017: 28-42 - [i4]Igor Kabiljo, Brian Karrer, Mayank Pundir, Sergey Pupyrev, Alon Shalita, Alessandro Presta, Yaroslav Akhremtsev:
Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner. CoRR abs/1707.06665 (2017) - [i3]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
High-Quality Shared-Memory Graph Partitioning. CoRR abs/1710.08231 (2017) - 2016
- [c2]Yaroslav Akhremtsev, Peter Sanders:
Fast Parallel Operations on Search Trees. HiPC 2016: 291-300 - 2015
- [c1]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
(Semi-)External Algorithms for Graph Partitioning and Clustering. ALENEX 2015: 33-43 - [i2]Yaroslav Akhremtsev, Peter Sanders:
Fast Parallel Operations on Search Trees. CoRR abs/1510.05433 (2015) - 2014
- [i1]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
(Semi-)External Algorithms for Graph Partitioning and Clustering. CoRR abs/1404.4887 (2014)
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:19 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:
