{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:34Z","timestamp":1725487294889},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-44541-2_24","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"253-258","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["k-Layer Straightline Crossing Minimization by Speeding Up Sifting"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"G\u00fcnther","sequence":"first","affiliation":[]},{"given":"Robby","family":"Sch\u00f6nfeld","sequence":"additional","affiliation":[]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Molitor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"issue":"8","key":"24_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677\u2013691, 1986.","journal-title":"IEEE Trans. on Comp."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"R. Drechsler and W. G\u00fcnther. Using lower bounds during dynamic BDD minimization. In Design Automation Conf., pages 29\u201332, 1999.","DOI":"10.1145\/309847.309858"},{"key":"24_CR3","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":"1","key":"24_CR4","doi-asserted-by":"crossref","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. Journal of Graph Algorithms and Applications, 1(1):1\u201325, 1997.","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"12","key":"24_CR5","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1016\/S0305-0548(96)00083-4","volume":"24","author":"M. Laguna","year":"1997","unstructured":"M. Laguna, R. Mart\u00ed,, and V. Valls. Arc crossing minimization in hierarchical digraphs with tabu search. Computers and Operations Research, 24(12):1175\u20131186, 1997.","journal-title":"Computers and Operations Research"},{"key":"24_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-46648-7_22","volume-title":"Using sifting for k-layer straightline crossing minimization","author":"C. Matuszewski","year":"1999","unstructured":"C. Matuszewski, R. Sch\u00f6nfeld, and P. Molitor. Using sifting for k-layer straightline crossing minimization. In Graph Drawing Conference, LNCS 1731, pages 217\u2013224, 1999."},{"key":"24_CR7","unstructured":"K. Mehlhorn and S. N\u00e4her. The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at \n                    http:\/\/www.mpi-sb.mpg.de\/LEDA\/\n                    \n                  ."},{"key":"24_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/3-540-37623-2_44","volume-title":"A library of algorithms for graph drawing","author":"P. Mutzel","year":"1998","unstructured":"P. Mutzel, 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 International Symposium on Graph Drawing, LNCS 1547, pages 456\u2013457, 1998. Project home page at \n                    http:\/\/www.mpi-sb.mpg.de\/AGD\/\n                    \n                  ."},{"key":"24_CR9","unstructured":"S. Panda and F. Somenzi. Who are the variables in your neighborhood. In Int\u2019l Conf. on CAD, pages 74\u201377, 1995."},{"key":"24_CR10","unstructured":"R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int\u2019l Conf. on CAD, pages 42\u201347, 1993."}],"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-44541-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T19:30:45Z","timestamp":1558467045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}