{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:13:09Z","timestamp":1725495189679},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_18","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:14:14Z","timestamp":1195215254000},"page":"186-192","source":"Crossref","is-referenced-by-count":0,"title":["Fractional Lengths and Crossing Numbers"],"prefix":"10.1007","author":[{"given":"Ondrej","family":"S\u00fdkora","sequence":"first","affiliation":[]},{"given":"L\u00e1szl\u00f3 A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-45848-4_23","volume-title":"Towards an Aesthetic Invariant for Graph Drawing","author":"J. Adamec","year":"2002","unstructured":"Adamec, J., Ne\u0161et\u0159il, J.: Towards an Aesthetic Invariant for Graph Drawing. In: 9th Intl. Symp. on Graph Drawing. LNCS 2265. Springer. Berlin (2001) 287\u2013296"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S. Bhatt","year":"1984","unstructured":"Bhatt, S., Leighton, F. T.: A Framework for Solving VLSI Graph Layout Problems. J. Computer and System Science 28 (1984) 300\u2013334","journal-title":"J. Computer and System Science"},{"key":"18_CR3","unstructured":"Di Battista, G., Eades, P., Tollis, I., Tamassia, R.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall (1999)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01744433","volume":"17","author":"F. T. Leighton","year":"1984","unstructured":"Leighton, F. T.: New Lower Bound Techniques for VLSI. MathematicalSystems Theory 17 (1984) 47\u201370","journal-title":"MathematicalSystems Theory"},{"key":"18_CR5","unstructured":"Leiserson, C. E.: Area Efficient Graph Layouts (for VLSI). In: 21st AnnualSymp osium on Foundations of Computer Science. IEEE Press (1980) 270\u2013281"},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Which aestethic has the greatest effect on Human Understanding?","author":"H. Purchase","year":"1997","unstructured":"Purchase, H.: Which aestethic has the greatest effect on Human Understanding? In: 5th Intl. Symp. on Draph Drawing. LNCS 1353. Springer. Berlin (1997) 248\u2013261"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1137\/S0097539797331671","volume":"30","author":"F. Shahrokhi","year":"2000","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L. A., Vrt\u2019o, I.: On Bipartite Drawings and the Linear Arrangement Problem. SIAM J. Computing\n                           30 (2000), 1773\u20131789.","journal-title":"SIAM J. Computing"},{"key":"18_CR8","first-page":"1","volume":"III","author":"H. Steinhaus","year":"1954","unstructured":"Steinhaus, H.: Length, Shape and Area. Colloquium Math. III (1954) 1\u201313","journal-title":"Colloquium Math."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Thompson, C. D.: Area-Time Complexity for VLSI. In: 11th Annual ACM Symposium on Theory of Computing. ACM Press (1979) 81\u201389","DOI":"10.1145\/800135.804401"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L. G. Valiant","year":"1981","unstructured":"Valiant, L. G.: Universality Considerations in VLSI Circuits. IEEE Transactions on Computers 30 (1981) 135\u2013140","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T12:17:07Z","timestamp":1551097027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}