{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:14Z","timestamp":1725544034439},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_7","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T11:03:36Z","timestamp":1265108616000},"page":"70-81","source":"Crossref","is-referenced-by-count":5,"title":["A Global k-Level Crossing Reduction Algorithm"],"prefix":"10.1007","author":[{"given":"Christian","family":"Bachmaier","sequence":"first","affiliation":[]},{"given":"Franz J.","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Brunner","sequence":"additional","affiliation":[]},{"given":"Ferdinand","family":"H\u00fcbner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TVCG.2007.1000","volume":"13","author":"C. Bachmaier","year":"2007","unstructured":"Bachmaier, C.: A radial adaption of the sugiyama framework for visualizing hierarchical information. IEEE Trans. Vis. Comput. Graphics\u00a013(3), 583\u2013594 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-87744-8_12","volume-title":"Algorithms - ESA 2008","author":"C. Bachmaier","year":"2008","unstructured":"Bachmaier, C., Brunner, W.: Linear time planarity testing and embedding of strongly connected cyclic level graphs. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 136\u2013147. Springer, Heidelberg (2008)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 332\u2013343. Springer, Heidelberg (2004)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45848-4_3","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., K\u00f6pf, B.: Fast and simple horizontal coordinate assignment. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 31\u201344. Springer, Heidelberg (2002)"},{"issue":"A","key":"7_CR5","first-page":"89","volume":"21","author":"P. Eades","year":"1986","unstructured":"Eades, P., Kelly, D.: Heuristics for reducing crossings in 2-layered networks. Ars Combinatorica\u00a021(A), 89\u201398 (1986)","journal-title":"Ars Combinatorica"},{"issue":"1","key":"7_CR6","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(1), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"7_CR7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.7155\/jgaa.00111","volume":"9","author":"M. Eiglsperger","year":"2005","unstructured":"Eiglsperger, M., Siebenhaller, M., Kaufmann, M.: An efficient implementation of sugiyama\u2019s algorithm for layered graph drawing. J. Graph Alg. App.\u00a09(3), 305\u2013325 (2005)","journal-title":"J. Graph Alg. App."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-63938-1_46","volume-title":"Graph Drawing","author":"M. J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Lee, E.K., Mutzel, P., Odenthal, T.: A polyhedral approach to the multi-layer crossing minimization problem. In: Di Battista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 13\u201324. Springer, Heidelberg (1997)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46648-7_22","volume-title":"Graph Drawing","author":"C. Matuszewski","year":"1999","unstructured":"Matuszewski, C., Sch\u00f6nfeld, R., Molitor, P.: Using sifting for k-layer straightline crossing minimization. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 217\u2013224. Springer, Heidelberg (1999)"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/ICCAD.1993.580029","volume-title":"Proc. IEEE\/ACM International Conference on Computer Aided Design, ICCAD 1993","author":"R. Rudell","year":"1993","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proc. IEEE\/ACM International Conference on Computer Aided Design, ICCAD 1993, pp. 42\u201347. IEEE Computer Society Press, Los Alamitos (1993)"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"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.\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst., Man, Cybern."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:38Z","timestamp":1606167638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}