{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:06:22Z","timestamp":1771455982605,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540245285","type":"print"},{"value":"9783540318439","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_22","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"206-216","source":"Crossref","is-referenced-by-count":9,"title":["A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction"],"prefix":"10.1007","author":[{"given":"Michael","family":"Forster","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Demetrescu, C., Finocchi, I.: Break the \u201cright\u201d cycles and get the \u201cbest\u201d drawing. In: Moret, B., Goldberg, A. (eds.) Proc. ALENEX 2000, pp. 171\u2013182 (2000)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Finocchi, I.: Removing cycles for minimizing crossings. ACM Journal on Experimental Algorithmics (JEA)\u00a06(1) (2001)","DOI":"10.1145\/945394.945396"},{"key":"22_CR3","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista di","year":"1999","unstructured":"di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"22_CR4","unstructured":"Eades, P., McKay, B.D., Wormald, N.C.: On an edge crossing problem. In: Proc. ACSC 1986, Australian National University, pp. 327\u2013334 (1986)"},{"key":"22_CR5","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\u00a011, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-44679-6_39","volume-title":"Computing and Combinatorics","author":"I. Finocchi","year":"2001","unstructured":"Finocchi, I.: Layered drawings of graphs with crossing constraints. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 357\u2013368. Springer, Heidelberg (2001)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-36151-0_26","volume-title":"Graph Drawing","author":"M. Forster","year":"2002","unstructured":"Forster, M.: Applying crossing reduction strategies to layered compound graphs. In: Kobourov, S.G., Goodrich, M.T. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 276\u2013284. Springer, Heidelberg (2002)"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","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\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BFb0021817","volume-title":"Graph Drawing","author":"M. J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P.: Exact and heuristic algorithms for 2-layer straightline crossing minimization. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 337\u2013348. Springer, Heidelberg (1996)"},{"issue":"1","key":"22_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","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. JGAA\u00a01(1), 1\u201325 (1997)","journal-title":"JGAA"},{"key":"22_CR11","unstructured":"Sander, G.: Visualisierungstechniken f\u00fcr den Compilerbau. PhD thesis, University of Saarbr\u00fccken (1996)"},{"key":"22_CR12","unstructured":"Schreiber, F.: Visualisierung biochemischer Reaktionsnetze. PhD thesis, University of Passau (2001)"},{"issue":"2","key":"22_CR13","first-page":"109","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. SMC\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. SMC"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-44541-2_23","volume-title":"Graph Drawing","author":"V. Waddle","year":"2001","unstructured":"Waddle, V.: Graph layout for displaying data structures. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 241\u2013252. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:15Z","timestamp":1605760095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}