{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T06:38:59Z","timestamp":1764225539096,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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":[[2019,5]]},"DOI":"10.1109\/iscas.2019.8702460","type":"proceedings-article","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T21:02:28Z","timestamp":1556744548000},"page":"1-5","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Heuristic Function for A\u2217-Based Path Search in Detailed Routing"],"prefix":"10.1109","author":[{"given":"Stephano M. M.","family":"Goncalves","sequence":"first","affiliation":[{"name":"Technology Development Center, Federal University of Pelotas, Pelotas, Brazil"}]},{"given":"Leomar S.","family":"da Rosa","sequence":"additional","affiliation":[{"name":"Technology Development Center, Federal University of Pelotas, Pelotas, Brazil"}]},{"given":"Felipe","family":"de S. Marques","sequence":"additional","affiliation":[{"name":"Technology Development Center, Federal University of Pelotas, Pelotas, Brazil"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2007.08.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219222"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.224054"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070404"},{"key":"ref14","article-title":"A computer program for optimal routing of printed circuit connectors","author":"mikami","year":"1968","journal-title":"Proceedings of the Internatinal Federation for Informatics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/800260.809014"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2017.8050432"},{"key":"ref17","first-page":"595","article-title":"Section 24.3: Dijkstra’s algorithm","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"year":"2018","key":"ref18","article-title":"ISPD 2018 Contest on Initial Detailed Routing"},{"key":"ref4","first-page":"1","article-title":"A Multi-Commodity Flow based Detailed Router with Efficient Acceleration Techniques","author":"jia","year":"2017","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"ref3","first-page":"674","article-title":"A new FPGA detailed routing approach via search-based Boolean satisfiability","volume":"21","author":"nam","year":"2006","journal-title":"IEEE Trans Comput -Aided Design Integr Circuits Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.1998.655877"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270336"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2385755"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2442087.2442103"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2214491"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2002.1167514"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"}],"event":{"name":"2019 IEEE International Symposium on Circuits and Systems (ISCAS)","start":{"date-parts":[[2019,5,26]]},"location":"Sapporo, Japan","end":{"date-parts":[[2019,5,29]]}},"container-title":["2019 IEEE International Symposium on Circuits and Systems (ISCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8682239\/8702066\/08702460.pdf?arnumber=8702460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T19:15:58Z","timestamp":1674587758000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8702460\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iscas.2019.8702460","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}