{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:36:42Z","timestamp":1742402202826},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_22","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"217-224","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Using Sifting for k-Layer Straightline Crossing Minimization"],"prefix":"10.1007","author":[{"given":"Christian","family":"Matuszewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robby","family":"Sch\u00f6nfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Molitor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"issue":"A","key":"22_CR1","first-page":"89","volume":"21.","author":"P. Eades","year":"1986","unstructured":"P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combin., 21.A:89\u201398, 1986.","journal-title":"Ars Combin."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P. Eades","year":"1994","unstructured":"P. Eades and S. Whitesides. Drawing graphs in two layers. Theoretical Computer Science, 131:361\u2013374, 1994.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"P. Eades and N. C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11(4):379\u2013403, 1994.","journal-title":"Algorithmica"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. R. Garey","year":"1983","unstructured":"M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4:312\u2013316, 1983.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"M. J\u00fcnger and P. Mutzel. 2-Layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl., 1(1):1\u201325, 1997.","journal-title":"J. Graph Algorithms Appl."},{"key":"22_CR6","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"D. E. Knuth","year":"1993","unstructured":"D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading, MA, 1993."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/00207169008803921","volume":"36","author":"E. M\u00e4kinen","year":"1990","unstructured":"E. M\u00e4kinen. Experiments on drawing 2-level hierarchical graphs. Internat. J. Comput. Math., 36:175\u2013181, 1990.","journal-title":"Internat. J. Comput. Math."},{"key":"22_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/3-540-37623-2_44","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u2019 98)","author":"P. Mutzel","year":"1998","unstructured":"P. Mutzel, C. Gutwenger, R. Brockenauer, S. Fialko, G. W. Klau, M. Kr\u00fcger, T. Ziegler, S. N\u00e4her, D. Alberts, D. Ambras, G. Koch, M. J\u00fcnger, C. Buchheim, and S. Leipert. A library of algorithms for graph drawing. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD\u2019 98), volume 1547 of Lecture Notes in Computer Science, pages 456\u2013457. Springer, 1998. Project home page at \nhttp:\/\/www.mpi-sb.mpg.de\/AGD\/\n\n."},{"unstructured":"K. Mehlhorn and S. N\u00e4her. The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at \nhttp:\/\/www.mpi-sb.mpg.de\/LEDA\/\n\n.","key":"22_CR9"},{"unstructured":"R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. International Conf. on Computer-Aided Design (ICCAD), pages 42\u201347, November 1993.","key":"22_CR10"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109\u2013125, February 1981.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:15:36Z","timestamp":1585934136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}