{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:42:13Z","timestamp":1755999733920,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,3]],"date-time":"2012-06-03T00:00:00Z","timestamp":1338681600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,3]]},"DOI":"10.1145\/2228360.2228441","type":"proceedings-article","created":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T12:10:51Z","timestamp":1338466251000},"page":"459-464","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Algorithms and data structures for fast and good VLSI routing"],"prefix":"10.1145","author":[{"given":"Michael","family":"Gester","sequence":"first","affiliation":[{"name":"University of Bonn, Bonn"}]},{"given":"Dirk","family":"M\u00fcller","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn"}]},{"given":"Tim","family":"Nieberg","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn"}]},{"given":"Christian","family":"Panten","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn"}]},{"given":"Christian","family":"Schulte","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn"}]},{"given":"Jens","family":"Vygen","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn"}]}],"member":"320","published-online":{"date-parts":[[2012,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735028"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/368058.368167"},{"key":"e_1_3_2_1_4_1","volume-title":"Schneller Algorithmus f\u00fcr k\u00fcrzeste Wege in irregul\u00e4ren Gittergraphen. Diploma Thesis","author":"Humpola J.","year":"2009","unstructured":"J. Humpola . Schneller Algorithmus f\u00fcr k\u00fcrzeste Wege in irregul\u00e4ren Gittergraphen. Diploma Thesis , University of Bonn , 2009 . J. Humpola. Schneller Algorithmus f\u00fcr k\u00fcrzeste Wege in irregul\u00e4ren Gittergraphen. Diploma Thesis, University of Bonn, 2009."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.889373"},{"key":"e_1_3_2_1_6_1","unstructured":"J. Ma\u00dfberg and T. Nieberg. Rectilinear paths with minimum segment lengths. Discrete Appl. Math. to appear.  J. Ma\u00dfberg and T. Nieberg. Rectilinear paths with minimum segment lengths. Discrete Appl. Math. to appear."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233598"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0023-y"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024763"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2007.08.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_13_1","first-page":"615","volume-title":"Handbook of Algorithms for Physical Design Automation","author":"Salowe J.","year":"2009","unstructured":"J. Salowe . Rip-up and reroute . In C. Alpert, D. Mehta, and S. Sapatnekar, editors, Handbook of Algorithms for Physical Design Automation , pages 615 -- 626 . CRC Press , 2009 . J. Salowe. Rip-up and reroute. In C. Alpert, D. Mehta, and S. Sapatnekar, editors, Handbook of Algorithms for Physical Design Automation, pages 615--626. CRC Press, 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25960-2_24"}],"event":{"name":"DAC '12: The 49th Annual Design Automation Conference 2012","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"San Francisco California","acronym":"DAC '12"},"container-title":["Proceedings of the 49th Annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2228360.2228441","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2228360.2228441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:02Z","timestamp":1750236542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2228360.2228441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,3]]},"references-count":13,"alternative-id":["10.1145\/2228360.2228441","10.1145\/2228360"],"URL":"https:\/\/doi.org\/10.1145\/2228360.2228441","relation":{},"subject":[],"published":{"date-parts":[[2012,6,3]]},"assertion":[{"value":"2012-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}