{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:01Z","timestamp":1725489241784},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_18","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"175-185","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Constrained Crossing Minimization Problem"],"prefix":"10.1007","author":[{"given":"Petra","family":"Mutzel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303\u2013326, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"18_CR2","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 J. Alg. Disc. Meth., Vol.4, No.3: 312\u2013316, 1983.","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S. Masuda","year":"1990","unstructured":"S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa. Crossing Minimization in Linear Embeddings of Graphs. In: IEEE Transactions on Computers, Vol.39, No.1: 124\u2013127, 1990.","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR4","unstructured":"P. Mutzel and T. Ziegler. The Constrained Crossing Minimization Problem-A First Approach. In: P. Kall, H.-J. L\u00fcthi (Eds.): Operations Research Proceedings 1998, Springer-Verlag, pp. 125\u2013134, 1999."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"P. Mutzel and T. Ziegler. The Constrained Crossing Minimization Problem. Forth-coming Technical Report, MPI Informatik, Saarbr\u00fccken, Germany, 1999.","DOI":"10.1007\/978-3-642-58409-1_11"},{"key":"18_CR6","first-page":"96","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: A platform for combinatorial and geometric computing. Comm. Assoc. Comput. Mach., 38:96\u2013102, 1995.","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"18_CR7","unstructured":"M. J\u00fcnger and S. Thienel. Introduction to ABACUS-A Branch-And-CUt System. Technical Report No.97.263, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1997, to appear in Operations Research Letters, 1999."}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:15:13Z","timestamp":1585934113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_18","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"}]}}