{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:12Z","timestamp":1761611172517,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_1","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"1-12","source":"Crossref","is-referenced-by-count":14,"title":["Crossings and Permutations"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Franz J.","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: STOC, pp. 684\u2013693 (2005)","DOI":"10.1145\/1060590.1060692"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0377-2217(89)90442-6","volume":"42","author":"J.P. Barthelemy","year":"1989","unstructured":"Barthelemy, J.P., Guenoche, A., Hudry, O.: Median linear orders: heuristics and a branch and bound algorithm. Europ. J. Oper. Res.\u00a042, 313\u2013325 (1989)","journal-title":"Europ. J. Oper. Res."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welfare\u00a06, 157\u2013165 (1989)","journal-title":"Soc. Choice Welfare"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0012-365X(96)00166-5","volume":"165\/166","author":"I. Charon","year":"1997","unstructured":"Charon, I., Guenoche, A., Hudry, O., Woirgard, F.: New results on the computation of median orders. Discrete Math.\u00a0165\/166, 139\u2013153 (1997)","journal-title":"Discrete Math."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.tcs.2004.02.043","volume":"325","author":"F.Y.L. Chin","year":"2004","unstructured":"Chin, F.Y.L., Deng, X., Feng, Q., Zhu, S.: Approximate and dynamic rank aggregation. Theoret. Comput. Sci.\u00a0325, 409\u2013424 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Finochi, I.: Breaking cycles for minimizing crossings. Electronic J. Algorithm Engineering\u00a06(2) (2001)","DOI":"10.1145\/945394.945396"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P. Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.: Spearman\u2019s footrule as a measure for disarray. Journal of the Royal Statistical Society, Series B\u00a039, 262\u2013268 (1977)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"1_CR8","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":"1_CR9","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Noar, M., Sivakumar, D.: Rank aggregation methods for the Web. In: Proc. WWW 10, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"1_CR10","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":"1_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020, 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"1_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"1_CR13","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 J. Alg. Disc. Meth.\u00a04, 312\u2013316 (1983)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"1_CR14","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. J. Graph Alg. Appl.\u00a01, 1\u201325 (1997)","journal-title":"J. Graph Alg. Appl."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs: Methods and Models","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs: Methods and Models. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"1_CR16","first-page":"577","volume":"88","author":"J.G. Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus\u00a088, 577\u2013591 (1959)","journal-title":"Daedalus"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-45848-4_10","volume-title":"Graph Drawing","author":"X. Munos","year":"2002","unstructured":"Munos, X., Unger, W., Vrto, I.: One sided crossing minimization is NP-hard for sparse graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 115\u2013123. Springer, Heidelberg (2002)"},{"key":"1_CR18","volume-title":"Topics on Tournaments","author":"J.W. Moon","year":"1968","unstructured":"Moon, J.W.: Topics on Tournaments. Holt, New York (1968)"},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s00454-005-1168-0","volume":"33","author":"H. Nagamochi","year":"2005","unstructured":"Nagamochi, H.: An Improved approximation to the One-Sided Bilayer Drawing. Discr. Comp. Geometry\u00a033(4), 569\u2013591 (2005)","journal-title":"Discr. Comp. Geometry"},{"key":"1_CR20","first-page":"109","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical systems structures. IEEE Trans. SMC\u00a011, 109\u2013125 (1981)","journal-title":"IEEE Trans. SMC"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-46648-7_6","volume-title":"Graph Drawing","author":"V. Waddle","year":"1999","unstructured":"Waddle, V., Malhotra, A.: An E logE line crossing algorithm for leveled graphs. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 59\u201370. Springer, Heidelberg (1999)"},{"key":"1_CR22","first-page":"565","volume":"33","author":"A. Yamaguchi","year":"2005","unstructured":"Yamaguchi, A., Sugimoto, A.: An approximation algorithm for the two-layered graph drawing problem. Discrete Comput. Geom.\u00a033, 565\u2013591 (2005)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T08:08:34Z","timestamp":1736237314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11618058_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}