{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:13:11Z","timestamp":1770754391859,"version":"3.50.0"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"DFG","award":["SA 933\/10-2"],"award-info":[{"award-number":["SA 933\/10-2"]}]},{"name":"DFG","award":["SCHU 2567\/1-2"],"award-info":[{"award-number":["SCHU 2567\/1-2"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2020,11,1]]},"DOI":"10.1109\/tpds.2020.3001645","type":"journal-article","created":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T20:12:33Z","timestamp":1591906353000},"page":"2710-2722","source":"Crossref","is-referenced-by-count":33,"title":["High-Quality Shared-Memory Graph Partitioning"],"prefix":"10.1109","volume":"31","author":[{"given":"Yaroslav","family":"Akhremtsev","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2823-3506","authenticated-orcid":false,"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3309206"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74466-5_72"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_24"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90074-J"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585498"},{"key":"ref30","article-title":"Some graph partitioning problems related to program segmentation","author":"kernighan","year":"1969"},{"key":"ref37","article-title":"Intel threading building blocks","year":"0"},{"key":"ref36","first-page":"9:1","article-title":"In-place parallel super scalar samplesort (IPSSSSo)","author":"axtmann","year":"2017","journal-title":"Proc 25th Annu Eur Symp Algorithms"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2390633"},{"key":"ref34","article-title":"Parallel and external high quality graph partitioning","author":"akhremtsev","year":"2019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2851496"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487696"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-016-9315-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816682"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.95"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/15M1026183"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.153"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236208"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2007.12.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369103"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/2486159.2486189","article-title":"Reducing contention through priority updates","author":"shun","year":"2013","journal-title":"Proc ACM Symp Parallelism Algorithms Architect"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2016.34"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.50"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588\/11699"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433461"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2671868"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_30"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4203\/csets.17.2"},{"key":"ref5","first-page":"491","article-title":"Graph partitioning for high performance scientific simulations","author":"schloegel","year":"2003","journal-title":"The Sourcebook of Parallel Computing"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77525-8_312"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48971-0_40"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00043"},{"key":"ref45","article-title":"Datasets","author":"laboratory of web algorithms","year":"0"},{"key":"ref48","author":"bader","year":"2013","journal-title":"10th DIMACS Implementation Challenge-Graph Partitioning and Graph Clustering 2011"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6170-8_23"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25209-0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993638"},{"key":"ref44","article-title":"SNAP Datasets: Stanford large network dataset collection","author":"leskovec","year":"2014"},{"key":"ref43","year":"0"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/9098997\/09115228.pdf?arnumber=9115228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:40:37Z","timestamp":1651070437000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9115228\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,1]]},"references-count":54,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2020.3001645","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"value":"1045-9219","type":"print"},{"value":"1558-2183","type":"electronic"},{"value":"2161-9883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,1]]}}}