{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T04:32:20Z","timestamp":1720499540185},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,5,1]],"date-time":"2006-05-01T00:00:00Z","timestamp":1146441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s10732-006-4294-9","type":"journal-article","created":{"date-parts":[[2006,4,3]],"date-time":"2006-04-03T21:35:32Z","timestamp":1144100132000},"page":"143-153","source":"Crossref","is-referenced-by-count":6,"title":["An analysis of some linear graph layout heuristics"],"prefix":"10.1007","volume":"12","author":[{"given":"Robert","family":"Cimikowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4294_CR1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"Bernhart, F. and P.C. Kainen. (1979). \u201cThe Book Thickness of a Graph.\u201d J. Comb. Theory B 27, 320\u2013331.","journal-title":"J. Comb. Theory B"},{"key":"4294_CR2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S.N. Bhatt","year":"1984","unstructured":"Bhatt, S.N. and F.T. Leighton. (1984). \u201cA Framework for Solving VLSI Graph Layout Problems.\u201d J. Comput. & Sys. Sci. 28, 300\u2013343.","journal-title":"J. Comput. & Sys. Sci."},{"issue":"2","key":"4294_CR3","first-page":"134","volume":"139","author":"T. Bilski","year":"1992","unstructured":"Bilski, T. (1992). \u201cEmbedding Graphs in Books: A Survey.\u201d IEE Proc. E 139(2), 134\u2013138.","journal-title":"IEE Proc. E"},{"key":"4294_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P.Z. Chinn","year":"1982","unstructured":"Chinn, P.Z., L. Chv\u00e1talov\u00e1, A.K. Dewdney, and N.E. Gibbs. (1982). \u201cThe Bandwidth Problem for Graphs and Matrices\u2013a Survey.\u201d J. Graph Theory 6, 223\u2013253.","journal-title":"J. Graph Theory"},{"key":"4294_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"F.R.K. Chung","year":"1987","unstructured":"Chung, F.R.K., F.T. Leighton, and A.L. Rosenberg. (1987). \u201cEmbedding Graphs in Books: A Layout Problem with Applications to VLSI Design.\u201d SIAM J. Alg. & Discrete Methods 8, 33\u201358.","journal-title":"SIAM J. Alg. & Discrete Methods"},{"issue":"1\u20133","key":"4294_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0166-218X(01)00314-6","volume":"122","author":"R. Cimikowski","year":"2002","unstructured":"Cimikowski, R. (2002). \u201cAlgorithms for the Fixed Linear Crossing Number Problem.\u201d Discrete Applied Mathematics 122(1\u20133), 93\u2013115.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"4294_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/72.485670","volume":"7","author":"R. Cimikowski","year":"1996","unstructured":"Cimikowski, R. and P. Shope. (1996). \u201cA Neural Network Algorithm for a Graph Layout Problem.\u201d IEEE Trans. Neural Networks 7(2) 341\u2013345.","journal-title":"IEEE Trans. Neural Networks"},{"key":"4294_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Di Battista","year":"1994","unstructured":"Di Battista, G., Eades, P., Tamassia, R., and I.G. Tollis. (1994). \u201cAlgorithms for Drawing Graphs: An Annotated Bibliography.\u201d Comput. Geom.: Theory & Appl. 4, 235\u2013282.","journal-title":"Comput. Geom.: Theory & Appl."},{"key":"4294_CR9","volume-title":"Graph Drawing","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., and I.G. Tollis. (1999). Graph Drawing. NJ: Prentice-Hall, Upper Saddle River."},{"key":"4294_CR10","doi-asserted-by":"crossref","unstructured":"Gilbert, R.S. and W.K. Klein\u00f6der. (1985). \u201cCNMgraf\u2014Graphic Presentation Services for Network Management.\u201d In Proc. 9th. Symp. on Data Comm. Vancouver, B.C., Canada, pp. 199\u2013206.","DOI":"10.1145\/319056.319049"},{"issue":"1","key":"4294_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M. and P. Mutzel. (1997). \u201c2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.\u201d J. Graph Algorithms & Appl. 1(1) 1\u201325.","journal-title":"J. Graph Algorithms & Appl."},{"key":"4294_CR12","unstructured":"Kainen, P.C. (1990). \u201cThe Book Thickness of a Graph, II.\u201d Congressus Numerantium 71, 127\u2013132."},{"issue":"1","key":"4294_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"S.M. Malitz","year":"1994","unstructured":"Malitz, S.M. (1994). \u201cOn the Page Number of Graphs.\u201d J. Algorithms 17(1), 71\u201384.","journal-title":"J. Algorithms"},{"issue":"1","key":"4294_CR14","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S. Masuda","year":"1990","unstructured":"Masuda, S., K. Nakajima, T. Kashiwabara, and T. Fujisawa. (1990) \u201cCrossing Minimization in Linear Embeddings of Graphs.\u201d IEEE Trans. Comput. 39(1), 124\u2013127.","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"4294_CR15","first-page":"21","volume":"115","author":"T.A.J. Nicholson","year":"1968","unstructured":"Nicholson, T.A.J. (1968). \u201cPermutation Procedure for Minimising the Number of Crossings in a Network.\u201d Proc. IEE 115(1), 21\u201326.","journal-title":"Proc. IEE"},{"issue":"3","key":"4294_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/TC.1983.1676213","volume":"C-32","author":"R. Raghavan","year":"1983","unstructured":"Raghavan, R. and S. Sahni. (1983). \u201cSingle-Row Routing.\u201d IEEE Trans. Comput. C-32(3), 209\u2013220","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"4294_CR17","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"C-32","author":"A.L. Rosenberg","year":"1983","unstructured":"Rosenberg, A.L. (1983). \u201cThe DIOGENES Approach to Testable Fault-Tolerant Arrays of Processors.\u201d IEEE Trans. Comput. C-32(10), 902\u2013910.","journal-title":"IEEE Trans. Comput."},{"key":"4294_CR18","unstructured":"Shahrokhi, F., O. S\u00fdkora, L.A. Sz\u00e9kely, and I. Vrto. (1997) \u201cCrossing Numbers: Bounds and Applications.\u201d In I. Barany, K. Boroczky, (eds.), Intuitive Geometry Bolyai Soc. Math. Studies 6, Akademia Kiado, Budapest,\u201d pp. 179\u2013206."},{"issue":"4","key":"4294_CR19","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.0.CO;2-S","volume":"21","author":"F. Shahrokhi","year":"1996","unstructured":"Shahrokhi, F., L.A. Sz\u00e9kely, O. S\u00fdkora, and I. Vrto. (1996). \u201cThe Book Crossing Number of a Graph.\u201d J. Graph Theory 21(4), 413\u2013424.","journal-title":"J. Graph Theory"},{"key":"4294_CR20","doi-asserted-by":"crossref","unstructured":"Shahrokhi, F., O. S\u00fdkora, L.A. Sz\u00e9kely, and I. Vrto. (1995) \u201cBook Embeddings and Crossing Number.\u201d In Proc. 20th. Int. Workshop on Graph-Theoretic Concepts in Comput. Sci WG\u201994, Lecture Notes in Comput. Sci., 903, Berlin Springer-Verlag, pp. 256\u2013268.","DOI":"10.1007\/3-540-59071-4_53"},{"key":"4294_CR21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., G. Di Battista, and C. Batini. (1988) \u201cAutomatic Graph Drawing and Readability of Diagrams.\u201d IEEE Trans. Sys., Man, and Cyber. 18, 61\u201379.","journal-title":"IEEE Trans. Sys., Man, and Cyber."},{"key":"4294_CR22","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E. (1972) \u201cSorting Using Networks of Queues and Stacks.\u201d J. Assoc. Comput. Mach. 19, 341\u2013346.","journal-title":"J. Assoc. Comput. Mach."},{"key":"4294_CR23","volume-title":"Computational aspects of VLSI","author":"J.D. Ullman","year":"1984","unstructured":"Ullman, J.D. (1984). Computational aspects of VLSI. Computer Science Press, Rockville, MD."},{"key":"4294_CR24","doi-asserted-by":"crossref","unstructured":"Yannakakis, M. (1986). \u201cLinear and Book Embeddings of Graphs.\u201d In Proc. Aegean Workshop on Computing, LNCS 227, Berlin Springer Verlag,\u201d pp. 229\u2013240.","DOI":"10.1007\/3-540-16766-8_20"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-006-4294-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-006-4294-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-006-4294-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:27Z","timestamp":1559242467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-006-4294-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["4294"],"URL":"https:\/\/doi.org\/10.1007\/s10732-006-4294-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5]]}}}