{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:51Z","timestamp":1725643551240},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003878"},{"type":"electronic","value":"9783642555374"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-642-55537-4_4","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T20:12:30Z","timestamp":1323979950000},"page":"26-32","source":"Crossref","is-referenced-by-count":1,"title":["A Combinatorial Approach to Orthogonal Placement Problems"],"prefix":"10.1007","author":[{"given":"Gunnar W.","family":"Klau","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"7","volume-title":"In Proc. 7th Des","author":"S Akers","year":"1970","unstructured":"S. Akers, M. Geyer, and D. Roberts. IC mask layout with a single conductor layer. In Proc. 7th Des. Autom. Workshop, pages 7\u201316. ACM\/IEEE, 1970."},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"12","author":"C Batini","year":"1986","unstructured":"C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Transactions on Software Engineering, SE-12(4):538\u2013546, 1986.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0925-7721(99)00054-1","volume":"16","author":"S Bridgeman","year":"2000","unstructured":"S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry : Theory and Applications, 16(1):53\u201393, 2000.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"4_CR4","first-page":"193","volume":"87","author":"WW-M Dai","year":"1987","unstructured":"W. W.-M. Dai and E. S. Kuh. Global spacing of building-block layout. In C. H. Sequin, editor, VLSI\u201987, pages 193\u2013205. Elsevier Science, 1987.","journal-title":"In C. H. Sequin, editor"},{"key":"4_CR5","volume-title":"Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Algorithms for the Visualization of Graphs. Prentice Hall, 1999."},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(88)90032-4","volume":"29","author":"F Hoffmann","year":"1988","unstructured":"F. Hoffmann and K. Kriegel. Embedding rectilinear graphs in linear time. Information Processing Letters, 29(2):75\u201379, 1988.","journal-title":"Embedding rectilinear graphs in linear time. Information Processing Letters"},{"key":"4_CR7","volume-title":"Technical Report UCB\/ERL M79\/80, Univ. of California","author":"M-Y Hsueh","year":"1979","unstructured":"M.-Y. Hsueh. Symbolic layout and compaction of integrated circuits. Technical Report UCB\/ERL M79\/80, Univ. of California, Berkeley, CA, U.S.A., 1979."},{"key":"4_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs: Methods and Models, volume 2025 of Lecture Notes in Computer Science","author":"M Kaufmann","year":"2001","unstructured":"M. Kaufmann and D. Wagner, editors. Drawing Graphs: Methods and Models, volume 2025 of Lecture Notes in Computer Science. Springer, 2001."},{"key":"4_CR9","volume-title":"PhD thesis, Univ. d. Saarlandes","author":"GW Klau","year":"2001","unstructured":"G. W. Klau. A Combinatorial Approach to Orthogonal Placement Problems. PhD thesis, Univ. d. Saarlandes, Saarbr\u00fccken, Germany, September 2001."},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","volume":"19","author":"M Patrignani","year":"2001","unstructured":"M. Patrignani. On the complexity of orthogonal compaction. Computational Geometry: Theory and Applications, 19(1):47\u201367, 2001.","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"3","key":"4_CR11","first-page":"421","volume":"16","author":"R Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends.SIAM J. Comput.,16(3):421\u2013444, 1987.","journal-title":"J. Comput."},{"key":"4_CR12","unstructured":"A. Wolff and T. Strijk. The map labeling bibliography. http:\/\/www.math-inf.uni-greifswald.de\/map-labeling\/bibliography."}],"container-title":["Operations Research Proceedings 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55537-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,20]],"date-time":"2019-01-20T00:52:44Z","timestamp":1547945564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55537-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540003878","9783642555374"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55537-4_4","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}