{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T05:57:46Z","timestamp":1781157466512,"version":"3.54.1"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:00:00Z","timestamp":1778630400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:00:00Z","timestamp":1778630400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,13]]},"DOI":"10.1109\/fccm68464.2026.00030","type":"proceedings-article","created":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T19:59:45Z","timestamp":1781121585000},"page":"133-141","source":"Crossref","is-referenced-by-count":0,"title":["PathSteiner: Improving PathFinder with Quasi-Optimal Steiner-Tree Initialization"],"prefix":"10.1109","author":[{"given":"Shashwat","family":"Shrivastava","sequence":"first","affiliation":[{"name":"EPFL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luka","family":"Kure\u0161evi\u0107","sequence":"additional","affiliation":[{"name":"EPFL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandros","family":"Poupakis","sequence":"additional","affiliation":[{"name":"EPFL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chirag","family":"Ravishankar","sequence":"additional","affiliation":[{"name":"AMD"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dinesh","family":"Gaitonde","sequence":"additional","affiliation":[{"name":"AMD"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Nikoli\u0107","sequence":"additional","affiliation":[{"name":"University of Novi Sad"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mirjana","family":"Stojilovi\u0107","sequence":"additional","affiliation":[{"name":"EPFL"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/FPGA.1995.242049"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM62733.2025.00060"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3388617"},{"key":"ref4","article-title":"Routability-driven FPGA placement contest","year":"2016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5145-4"},{"key":"ref8","first-page":"529","article-title":"A robust FPGA router with concurrent intra-CLB rerouting","volume-title":"Proceedings of the 28th Asia and South Pacific Design Automation Conference","author":"Wang"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2024.3447218"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323897"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/608362"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123024"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3431920.3439285"},{"key":"ref14","first-page":"85","volume-title":"Reducibility among Combinatorial Problems","author":"Karp","year":"1972"},{"key":"ref15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2006.320159"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/EDTC.1994.326843"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/267665.267682"},{"key":"ref19","article-title":"Placements for ISPD16 benchmarks","author":"Li","year":"2016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3490422.3502356"},{"key":"ref21","article-title":"Flute3: Open-source rectilinear Steiner minimum tree heuristic","year":"2021"},{"key":"ref22","article-title":"PathSteiner\u2014Artifacts","author":"Shrivastava","year":"2026"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/4.75006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/43.127623"},{"key":"ref26","first-page":"215","article-title":"A detailed routing algorithm for allocating wire segments in field-programmable gate arrays","volume-title":"Proceedings of the 4th ACM\/SIGDA Physical Design Workshop","author":"Lemieux"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1988.14757"},{"key":"ref28","article-title":"Architecture and CAD for speed and area optimization of FPGAs","volume-title":"Ph.D. dissertation","author":"Betz","year":"1998"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2011.67"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2980085"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2729349"},{"key":"ref32","first-page":"259","article-title":"An architecture-independent approach to FPGA routing based on multi-weighted graphs","volume-title":"Proceedings of the European Design Automation Conference (EuroDAC94)","author":"Alexander"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2006.887925"}],"event":{"name":"2026 IEEE 34th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","location":"Atlanta, GA, USA","start":{"date-parts":[[2026,5,13]]},"end":{"date-parts":[[2026,5,16]]}},"container-title":["2026 IEEE 34th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11552597\/11552602\/11552651.pdf?arnumber=11552651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T05:06:37Z","timestamp":1781154397000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11552651\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,13]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/fccm68464.2026.00030","relation":{},"subject":[],"published":{"date-parts":[[2026,5,13]]}}}