{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T14:20:27Z","timestamp":1784298027412,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642312229","type":"print"},{"value":"9783642312236","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31223-6_10","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T11:59:20Z","timestamp":1340020760000},"page":"51-64","source":"Crossref","is-referenced-by-count":5,"title":["Orthogonal Hyperedge Routing"],"prefix":"10.1007","author":[{"given":"Michael","family":"Wybrow","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TCAD.2010.2096571","volume":"30","author":"G. Ajwani","year":"2011","unstructured":"Ajwani, G., Chu, C., Mak, W.K.: FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems\u00a030(2), 194\u2013204 (2011)","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10_CR2","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D. Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics\u00a012, 741\u2013748 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D. Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Comput. Graph. Forum\u00a028(3), 983\u2013990 (2009)","journal-title":"Comput. Graph. Forum"},{"key":"10_CR5","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics (1992)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/1231996.1232023","volume-title":"Proc. of the 2007 Int. Symp. on Physical Design, ISPD 2007","author":"C.W. Lin","year":"2007","unstructured":"Lin, C.W., Chen, S.Y., Li, C.F., Chang, Y.W., Yang, C.L.: Efficient obstacle-avoiding rectilinear steiner tree construction. In: Proc. of the 2007 Int. Symp. on Physical Design, ISPD 2007, pp. 127\u2013134. ACM, New York (2007)"},{"issue":"12","key":"10_CR7","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1109\/TCAD.2008.2006098","volume":"27","author":"J. Long","year":"2008","unstructured":"Long, J., Zhou, H., Memik, S.O.: EBOARST: An efficient edge-based obstacle-avoiding rectilinear steiner tree construction algorithm. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems\u00a027(12), 2169\u20132182 (2008)","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-18469-7_30","volume-title":"Graph Drawing","author":"S. Pupyrev","year":"2011","unstructured":"Pupyrev, S., Nachmanson, L., Kaufmann, M.: Improving Layered Graph Layouts with Edge\u00a0Bundling. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 329\u2013340. Springer, Heidelberg (2011)"},{"key":"10_CR9","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":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-11805-0_22","volume-title":"Graph Drawing","author":"M. Wybrow","year":"2010","unstructured":"Wybrow, M., Marriott, K., Stuckey, P.J.: Orthogonal Connector Routing. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 219\u2013231. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Diagrammatic Representation and Inference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31223-6_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:51:59Z","timestamp":1620114719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31223-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312229","9783642312236"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31223-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}