{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:36:32Z","timestamp":1769582192771,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540607236","type":"print"},{"value":"9783540493518","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0021817","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:56:38Z","timestamp":1131864998000},"page":"337-348","source":"Crossref","is-referenced-by-count":22,"title":["Exact and heuristic algorithms for 2-layer straightline crossing minimization"],"prefix":"10.1007","author":[{"given":"Michael","family":"J\u00fcnger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"34_CR1","unstructured":"CPLEX: Using the CPLEX callable library and the CPLEX mixed integer library. CPLEX Optimization Inc. (1993)"},{"key":"34_CR2","first-page":"121","volume-title":"Operations Research Proceedings 1994","author":"S. Dresbach","year":"1994","unstructured":"Dresbach, S.: A New Heuristic Layout Algorithm for DAGs. Derigs, Bachern & Drexl (eds.) Operations Research Proceedings 1994, Springer Verlag, Berlin (1994) 121\u2013126"},{"key":"34_CR3","unstructured":"Dresbach, S.: Personal communication. (1995)"},{"key":"34_CR4","first-page":"89","volume":"21-A","author":"P. Eades","year":"1986","unstructured":"Eades, P., and D. Kelly: Heuristics for Reducing Crossings in 2-Layered Networks. Ars Combinatoria 21-A (1986) 89\u201398","journal-title":"Ars Combinatoria"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"10","author":"P. Eades","year":"1994","unstructured":"Eades, P., and N.C. Wormald: Edge crossings in Drawings of Bipartite Graphs. Algorithmica 10 (1994) 379\u2013403","journal-title":"Algorithmica"},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., and D.S. Johnson: Crossing Number is NP-Complete. SIAM J. on Algebraic and Discrete Methods 4 (1983) 312\u2013316","journal-title":"SIAM J. on Algebraic and Discrete Methods"},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., M. J\u00fcnger, and G. Reinelt: A cutting plane algorithm for the linear ordering problem. Operations Research 32 (1984) 1195\u20131220","journal-title":"Operations Research"},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02932410","volume":"25","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., M. J\u00fcnger, and G. Reinelt: Optimal triangulation of large real world input-output matrices. Statistische Hefte 25 (1984) 261\u2013295","journal-title":"Statistische Hefte"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., M. J\u00fcnger, and G. Reinelt: Facets of the linear ordering polytope. Mathematical Programming 33 (1985) 43\u201360","journal-title":"Mathematical Programming"},{"key":"34_CR10","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"D.E. Knuth","year":"1993","unstructured":"Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, Addison-Wesley Publishing Company (1993) New York"},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., S. Tagawa, and M. Toda: Methods for Visual Understanding of Hierarchical System Structures. IEEE Trans. Syst. Man, Cybern., SMC-11 (1981) 109\u2013125","journal-title":"IEEE Trans. Syst. Man, Cybern."},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TSMC.1977.4309760","volume":"SMC-7","author":"J.N. Warfield","year":"1977","unstructured":"Warfield, J.N.: Crossing Theory and Hierarchy Mapping. IEEE Trans. Syst. Man, Cybern., SMC-7 (1977) 505\u2013523","journal-title":"IEEE Trans. Syst. Man, Cybern."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0021817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T10:17:55Z","timestamp":1549275475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0021817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607236","9783540493518"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0021817","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}