{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:11:52Z","timestamp":1740100312520,"version":"3.37.3"},"reference-count":6,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:00:00Z","timestamp":1638662400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006190","name":"Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,5]]},"DOI":"10.1109\/dac18074.2021.9586307","type":"proceedings-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T23:30:34Z","timestamp":1636414234000},"page":"1368-1369","source":"Crossref","is-referenced-by-count":0,"title":["Late Breaking Results: Novel Discrete Dynamic Filled Function Algorithm for Acyclic Graph Partitioning"],"prefix":"10.1109","author":[{"given":"Jianli","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiarui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lichong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"MeTis A software package for partitioning unstructured graphs partitioning meshes and computing fill-reducing orderings of sparse matrices","year":"1998","author":"karypis","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/18M1176865"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0492"},{"key":"ref5","first-page":"371","article-title":"Graph partitioning with acyclicity constraints","author":"moreira","year":"2017","journal-title":"Proceedings of International Symposium on Experimental Algorithms"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744888"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/196244.196609"}],"event":{"name":"2021 58th ACM\/IEEE Design Automation Conference (DAC)","start":{"date-parts":[[2021,12,5]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2021,12,9]]}},"container-title":["2021 58th ACM\/IEEE Design Automation Conference (DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9585997\/9586083\/09586307.pdf?arnumber=9586307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:55Z","timestamp":1652201755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9586307\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,5]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1109\/dac18074.2021.9586307","relation":{},"subject":[],"published":{"date-parts":[[2021,12,5]]}}}