{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:47:39Z","timestamp":1744051659702,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1109\/asp-dac47756.2020.9045588","type":"proceedings-article","created":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T12:27:10Z","timestamp":1585312030000},"page":"91-96","source":"Crossref","is-referenced-by-count":5,"title":["Thanos: High-Performance CPU-GPU Based Balanced Graph Partitioning Using Cross-Decomposition"],"prefix":"10.1109","author":[{"given":"Dae Hee","family":"Kim","sequence":"first","affiliation":[]},{"given":"Rakesh","family":"Nagi","sequence":"additional","affiliation":[]},{"given":"Deming","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/asm.3150030406"},{"journal-title":"A Cross-Decomposition Method for Layout Systems and Scheduling Problem","year":"1989","author":"portmann","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091039"},{"journal-title":"Graphchallenge data set stats","year":"2019","key":"ref13"},{"year":"2019","author":"thanos","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.102"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"},{"key":"ref5","volume":"33","author":"hyafil","year":"1973","journal-title":"Graph partitioning and constructing optimal decision trees are polynomial complete problems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/asm.3150010105"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/267665.267674"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147035"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"}],"event":{"name":"2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC)","start":{"date-parts":[[2020,1,13]]},"location":"Beijing, China","end":{"date-parts":[[2020,1,16]]}},"container-title":["2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9036752\/9045099\/09045588.pdf?arnumber=9045588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:44:00Z","timestamp":1656344640000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9045588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/asp-dac47756.2020.9045588","relation":{},"subject":[],"published":{"date-parts":[[2020,1]]}}}