{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T07:02:52Z","timestamp":1743663772509},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118043"},{"type":"electronic","value":"9783642118050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_22","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T02:45:33Z","timestamp":1267757133000},"page":"219-231","source":"Crossref","is-referenced-by-count":16,"title":["Orthogonal Connector Routing"],"prefix":"10.1007","author":[{"given":"Michael","family":"Wybrow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/11618058_40","volume-title":"Graph Drawing","author":"M. Wybrow","year":"2006","unstructured":"Wybrow, M., Marriott, K., Stuckey, P.J.: Incremental connector routing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 446\u2013457. Springer, Heidelberg (2006)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-63938-1_68","volume-title":"Graph Drawing","author":"D.P. Dobkin","year":"1997","unstructured":"Dobkin, D.P., Gansner, E.R., Koutsofios, E., North, S.C.: Implementing a general-purpose edge router. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 262\u2013271. Springer, Heidelberg (1997)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11618058_15","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 153\u2013164. Springer, Heidelberg (2006)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-70904-6_44","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2007","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.: Fast node overlap removal\u2014correction. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 446\u2013447. Springer, Heidelberg (2007)"},{"key":"22_CR5","first-page":"297","volume-title":"CASE 1993","author":"K. Miriyala","year":"1993","unstructured":"Miriyala, K., Hornick, S.W., Tamassia, R.: An incremental approach to aesthetic graph layout. In: CASE 1993, pp. 297\u2013308. IEEE Computer Society, Los Alamitos (1993)"},{"key":"22_CR6","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Inc., Englewood Cliffs (1999)"},{"issue":"6","key":"22_CR7","first-page":"553","volume":"10","author":"T.C. Biedl","year":"2000","unstructured":"Biedl, T.C., Madden, B., Tollis, I.G.: The three-phase method: A unified approach to orthogonal graph drawing. IJCGA\u00a010(6), 553\u2013580 (2000)","journal-title":"IJCGA"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(96)80467-7","volume":"70","author":"D. Lee","year":"1996","unstructured":"Lee, D., Yang, C., Wong, C.: Rectilinear paths among rectilinear obstacles. Discrete Applied Mathematics\u00a070(3), 185\u2013216 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, Inc., New York (1990)"},{"issue":"2","key":"22_CR10","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","volume":"EC-10","author":"C.Y. Lee","year":"1961","unstructured":"Lee, C.Y.: An algorithm for path connections and its applications. IRE Transactions on Electronic Computers\u00a0EC-10(2), 346\u2013365 (1961)","journal-title":"IRE Transactions on Electronic Computers"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TC.1987.1676904","volume":"36","author":"Y.F. Wu","year":"1987","unstructured":"Wu, Y.F., Widmayer, P., Schlag, M.D.F., Wong, C.K.: Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles. IEEE Transactions on Computers\u00a036(3), 321\u2013331 (1987)","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-00219-9_33","volume-title":"Graph Drawing","author":"E. Argyriou","year":"2009","unstructured":"Argyriou, E., Bekos, M., Kaufmann, M., Symvonis, A.: Two polynomial time algorithms for the metro-line crossing minimization problem. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 336\u2013347. Springer, Heidelberg (2009)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-77537-9_24","volume-title":"Graph Drawing","author":"M. Bekos","year":"2008","unstructured":"Bekos, M., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 231\u2013242. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11805-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:44:01Z","timestamp":1606167841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}