{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:02Z","timestamp":1725489002907},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433095"},{"type":"electronic","value":"9783540458487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_14","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:47:53Z","timestamp":1186843673000},"page":"162-177","source":"Crossref","is-referenced-by-count":8,"title":["Drawing with Fat Edges"],"prefix":"10.1007","author":[{"given":"Christian A.","family":"Duncan","sequence":"first","affiliation":[]},{"given":"Alon","family":"Efrat","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"B. Chazelle. A theorem on polygon cutting with applications. In 23th Annual Symposium on Foundations of Computer Science, pages 339\u2013349, Los Alamitos, Ca., USA, Nov. 1982. IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1982.58"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"R. Cole and A. Siegel. River routing every which way, but loose. In 25th Annual Symposium on Foundations of Computer Science, pages 65\u201373, Los Angeles, Ca., USA, Oct. 1984. IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1984.715902"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"D. Dolev, K. Karplus, A. Siegel, A. Strong, and J. D. Ullman. Optimal wiring between rectangles. In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, pages 312\u2013317, Milwaukee, Wisconsin, 11\u201313 May 1981.","DOI":"10.1145\/800076.802484"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. R\u00fclling, and C. Storb. On continuous homotopic one layer routing. In Proceedings of the Fourth Annual Symposium on Computational Geometry (Urbana-Champaign, IL, June 6-8, 1988), pages 392\u2013402, New York, 1988. ACM, ACM Press.","DOI":"10.1145\/73393.73433"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/0196-6774(86)90016-7","volume":"7","author":"M. Kaufmann","year":"1986","unstructured":"M. Kaufmann and K. Mehlhorn. Routing through a generalized switchbox. Journal of Algorithms, 7(4):510\u2013531, Dec. 1986.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1984","unstructured":"D. T. Lee and F. P. Preparata. Euclidean Shortest Paths in the Presence of Rectilinear Barriers. Networks, 14(3):393\u2013410, 1984.","journal-title":"Networks"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson and F. M. Maley. Algorithms for routing and testing routability of planar VLSI layouts. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 69\u201378, Providence, Rhode Island, 6\u20138 May 1985.","DOI":"10.1145\/22145.22153"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1137\/0212029","volume":"12","author":"C. E. Leiserson","year":"1983","unstructured":"C. E. Leiserson and R. Y. Pinter. Optimal placement for river routing. SIAM Journal on Computing, 12(3):447\u2013462, Aug. 1983.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR9","unstructured":"F. M. Maley. Single-Layer Wire Routing. PhD thesis, Massachusetts Institute of Technology, 1987."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0022-0000(87)90004-3","volume":"34","author":"A. Mirzaian","year":"1987","unstructured":"A. Mirzaian. River routing in VLSI. Journal of Computer and System Sciences, 34(1):43\u201354, Feb. 1987.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"J. Pach and R. Wenger. Embedding planar graphs at fixed vertex locations. In Proc. 6th Int. Symp. Graph Drawing (GD\u2019 98), pages 263\u2013274, 1998.","DOI":"10.1007\/3-540-37623-2_20"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"R. Pinter. River-routing: Methodology and analysis, 1983.","DOI":"10.1007\/978-3-642-95432-0_9"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/TC.1984.1676428","volume":"33","author":"D. Richards","year":"1984","unstructured":"D. Richards. Complexity of single layer routing. IEEE Transactions on Computers, 33:286\u2013288, 1984.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1137\/0404013","volume":"4","author":"A. Schrijver","year":"1991","unstructured":"A. Schrijver. Edge-disjoint homotopic paths in straight-line planar graphs. SIAM Journal on Discrete Mathematics, 4(1):130\u2013138, Feb. 1991.","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:28:17Z","timestamp":1556753297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}