{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T19:50:25Z","timestamp":1774641025628,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,3,15]]},"DOI":"10.1145\/3764386.3779624","type":"proceedings-article","created":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T18:57:27Z","timestamp":1774637847000},"page":"73-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Invited: BonnRoute: Classic Routing Algorithms with Recent Advances"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1588-2186","authenticated-orcid":false,"given":"Jens","family":"Vygen","sequence":"first","affiliation":[{"name":"Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2385755"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01962-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC63849.2025.11132507"},{"key":"e_1_3_2_1_4_1","first-page":"20","volume-title":"30th Annual European Symposium on Algorithms (ESA","author":"Blankenburg Daniel","year":"2022","unstructured":"Daniel Blankenburg. 2022. Resource sharing revisited: Local weak duality and optimal convergence. In 30th Annual European Symposium on Algorithms (ESA 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 20-1."},{"key":"e_1_3_2_1_5_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"Blankenburg Daniel","unstructured":"Daniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim, and Jens Vygen. 2026. An efficient algorithm for minimizing ordered norms in fractional load balancing. In Integer Programming and Combinatorial Optimization. Springer, to appear."},{"key":"e_1_3_2_1_6_1","volume-title":"RC-Aware Routing with the Dijkstra-Steiner Algorithm. Master's thesis","author":"Carlin Louis","unstructured":"Louis Carlin. 2025. RC-Aware Routing with the Dijkstra-Steiner Algorithm. Master's thesis. University of Bonn."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442087.2442103"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2697964"},{"key":"e_1_3_2_1_10_1","first-page":"332","article-title":"A sequential detailed router for huge grid graphs. In Proceedings of Design, Automation and Test in Europe","author":"Hetzel Asmus","year":"1998","unstructured":"Asmus Hetzel. 1998. A sequential detailed router for huge grid graphs. In Proceedings of Design, Automation and Test in Europe. IEEE, 332-338.","journal-title":"IEEE"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-016-0110-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.889373"},{"key":"e_1_3_2_1_13_1","first-page":"129","article-title":"The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits","volume":"2","author":"Kramer Mark R","year":"1984","unstructured":"Mark R Kramer and Jan van Leeuwen. 1984. The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits. Adv. Comput. Res, Vol. 2 (1984), 129-146.","journal-title":"Adv. Comput. Res"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0023-y"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25960-2_24"}],"event":{"name":"ISPD '26: International Symposium on Physical Design","location":"Bonn Germany","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2026 International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3764386.3779624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T18:59:11Z","timestamp":1774637951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3764386.3779624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,15]]},"references-count":16,"alternative-id":["10.1145\/3764386.3779624","10.1145\/3764386"],"URL":"https:\/\/doi.org\/10.1145\/3764386.3779624","relation":{},"subject":[],"published":{"date-parts":[[2026,3,15]]},"assertion":[{"value":"2026-03-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}