{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:35Z","timestamp":1725890075018},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639381"},{"type":"electronic","value":"9783540696742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63938-1_46","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T11:35:47Z","timestamp":1153222547000},"page":"13-24","source":"Crossref","is-referenced-by-count":28,"title":["A polyhedral approach to the multi-layer crossing minimization problem"],"prefix":"10.1007","author":[{"given":"Michael","family":"J\u00fcnger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva K.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Odenthal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: An annotated bibliography. Computational Geometry: Theory and Applications 4 (1994) 235\u2013282.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"2_CR2","first-page":"89","volume":"21-A","author":"P. Eades","year":"1986","unstructured":"Eades, P., Kelly, D.: Heuristics for Reducing Crossings in 2-Layered Networks. Ars Combinatoria 21-A (1986) 89\u201398.","journal-title":"Ars Combinatoria"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge Crossings in Drawings of Bipartite Graphs. Algorithmica 11 (1994) 379\u2013403.","journal-title":"Algorithmica"},{"key":"2_CR4","unstructured":"Eades, P., McKay, B.D., Wormald, N.C.: On an edge crossing problem. Proc. 9th Australian Computer Science Conference, Australian National University (1986) 327\u2013334."},{"key":"2_CR5","unstructured":"Fukuda, K.: Face Lattices. Personal Communication (1996)."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing Number is NP-Complete. SIAM Journal on Algebraic and Discrete Methods 4 (1983) 312\u2013316.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Facets of the linear ordering polytope. Mathematical Programming 33 (1985) 43\u201360.","journal-title":"Mathematical Programming"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1080\/0025570X.1969.11975950","volume":"42","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Determinants, permanents and bipartite graphs. Mathematical Magazine 42 (1969) 146\u2013148.","journal-title":"Mathematical Magazine"},{"key":"2_CR9","first-page":"203","volume":"1","author":"F. Harary","year":"1972","unstructured":"Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Utilitas Mathematica 1 (1972) 203\u2013209.","journal-title":"Utilitas Mathematica"},{"key":"2_CR10","unstructured":"Himsolt, M.: Personal Communication (1997)."},{"issue":"1","key":"2_CR11","first-page":"125","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. Journal of Graph Algorithms and Applications (JGAA), (http:\/\/www.cs.brown.edu\/publications\/jgaa\/), No. 1, Vol. 1, (1997) 125.","journal-title":"Journal of Graph Algorithms and Applications (JGAA)"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1109\/21.400508","volume":"25","author":"A. Kusiak","year":"1995","unstructured":"Kusiak, A., Wang, J.: Dependency Analysis in Constraint Negotiation. IEEE Trans. Sys. Man, Cybern. 25 (1995) 1301\u20131313.","journal-title":"IEEE Trans. Sys. Man, Cybern."},{"issue":"1","key":"2_CR13","first-page":"85","volume":"17","author":"M. May","year":"1988","unstructured":"May, M., Szkatula, K.: On the bipartite crossing number. Control and Cybernetics 17 No.1 (1988) 85\u201397.","journal-title":"Control and Cybernetics"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-62495-3_57","volume":"1190","author":"P. Mutzel","year":"1997","unstructured":"Mutzel, P.: An Alternative Method for Crossing Minimization. Lecture Notes in Computer Science LNCS 1190 (1997) 318\u2013333.","journal-title":"Lecture Notes in Computer Science LNCS"},{"key":"2_CR15","unstructured":"Richter, B.R., Thomassen, C.: A survey on crossing numbers. Manuscript, Carleton University and The Technical University of Denmark (1994)."},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/3-540-58950-3_364","volume":"894","author":"F. Shahrokhi","year":"1995","unstructured":"Shahrokhi, F., Szelky, L.A., Vrt\u00f4, L: Crossing Number of Graphs, Lower Bound Techniques and Algorithms: A Survey. Lecture Notes in Computer Science LNCS 894 (1995) 131\u2013142.","journal-title":"Lecture Notes in Computer Science LNCS"},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/BFb0021831","volume":"1027","author":"F. Shieh","year":"1996","unstructured":"Shieh, F., McCreary, C.,: Directed Graphs Drawing by Clan-Based Decomposition. Lecture Notes in Computer Science LNCS 1027 (1996) 472\u2013482.","journal-title":"Lecture Notes in Computer Science LNCS"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: 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":"2_CR19","first-page":"1","volume":"EC77-38","author":"N. Tomii","year":"1977","unstructured":"Tomii, N., Kambayashi, Y., Shunzo, Y.: On Planarization Algorithms of 2-Level Graphs. Papers of tech. group on electronic computers, IECEJ, EC77-38 (1977) 1\u201312.","journal-title":"IECEJ"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0377-2217(95)00356-8","volume":"90","author":"V. Valls","year":"1996","unstructured":"Valls, V., Marti, R., Lino, P.: A Branch and Bound Algorithm for Minimizing the Number of Crossing Arcs in Bipartite Graphs. Journal of Operational Research 90 (1996a) 303\u2013319.","journal-title":"Journal of Operational Research"},{"key":"2_CR21","first-page":"223","volume":"83","author":"V. Valls","year":"1996","unstructured":"Valls, V., Marti, R., Lino, P.: A tabu thresholding algorithm for arc crossing minimization in bipartite graphs. Annals of Operations Research 83 (1996b) 223\u2013251.","journal-title":"Annals of Operations Research"},{"key":"2_CR22","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."},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1111\/j.1749-6632.1970.tb56499.x","volume":"175","author":"M.E. Watkins","year":"1970","unstructured":"Watkins, M.E.: A special crossing number for bipartite graphs: a research problem. Annals of New York Academy of Sciences 175 (1970) 405\u2013410.","journal-title":"Annals of New York Academy of Sciences"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63938-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T16:38:59Z","timestamp":1549211939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}