{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:15Z","timestamp":1725701655138},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_59","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"683-694","source":"Crossref","is-referenced-by-count":3,"title":["A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization"],"prefix":"10.1007","author":[{"given":"Yasuaki","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"Hisao","family":"Tamaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information:Ranking and clustering. Journal of the ACM\u00a055(5): Article No. 23 (2008)","DOI":"10.1145\/1411509.1411513"},{"key":"59_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-02927-1_6","volume-title":"Automata, Languages and Programming","author":"N. Alon","year":"2009","unstructured":"Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I, LNCS, vol.\u00a05555, pp. 49\u201358. Springer, Heidelberg (2009)"},{"key":"59_CR3","first-page":"1","volume":"11","author":"H. Bodlaender","year":"1993","unstructured":"Bodlaender, H.: A Tourist Guide through Treewidth. Acta Cybernetica\u00a011, 1\u201323 (1993)","journal-title":"Acta Cybernetica"},{"issue":"3","key":"59_CR4","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/s00224-011-9312-0","volume":"50","author":"H. Bodlaender","year":"2012","unstructured":"Bodlaender, H., Fomin, F., Kratsch, D., Thilikos, D.: A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory of Computing Systems\u00a050(3), 420\u2013432 (2012)","journal-title":"Theory of Computing Systems"},{"key":"59_CR5","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1998)"},{"issue":"2","key":"59_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jda.2006.12.008","volume":"6","author":"V. Dujmovi\u0107","year":"2008","unstructured":"Dujmovi\u0107, V., Fernau, H., Kaufmann, M.: Fixed parameter algorithms for one-sided crossing minimization revisited. Journal of Discrete Algorithms\u00a06(2), 313\u2013323 (2008)","journal-title":"Journal of Discrete Algorithms"},{"issue":"1","key":"59_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00453-004-1093-2","volume":"40","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Whitesides, S.: An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Algorithmica\u00a040(1), 15\u201331 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"59_CR8","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(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"59_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-19222-7_34","volume-title":"Combinatorial Algorithms","author":"H. Fernau","year":"2011","unstructured":"Fernau, H., Fomin, F.V., Lokshtanov, D., Mnich, M., Philip, G., Saurabh, S.: Ranking and Drawing in Subexponential Time. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 337\u2013348. Springer, Heidelberg (2011)"},{"key":"59_CR10","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics\u00a010, 196\u2013210 (1962)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"59_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. Journal of Computer and System Sciences\u00a062, 367\u2013375 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"59_CR12","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences\u00a063, 512\u2013530 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"59_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-17517-6_3","volume-title":"Algorithms and Computation","author":"M. Karpinski","year":"2010","unstructured":"Karpinski, M., Schudy, W.: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I, LNCS, vol.\u00a06506, pp. 3\u201314. Springer, Heidelberg (2010)"},{"key":"59_CR15","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the Exponential Time Hypothesis, The Complexity Column by Arvind V. Bulletin of the EATCS, pp. 41\u201372 (2011)"},{"key":"59_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.tcs.2004.10.042","volume":"332","author":"H. Nagamochi","year":"2005","unstructured":"Nagamochi, H.: On the one-sided crossing minimization in a bipartite graph with large degree. Theoretical Computer Science\u00a0332, 417\u2013446 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"59_CR17","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 bound on the one-sided minimum crossing number in two-layered drawings. Discrete and Computational Geometry\u00a033(4), 569\u2013591 (2005)","journal-title":"Discrete and Computational Geometry"},{"key":"59_CR18","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. Mu\u00f1oz","year":"2002","unstructured":"Mu\u00f1oz, X., Unger, W., Vrt\u2019o, 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)"},{"issue":"2","key":"59_CR19","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 Transactions on Systems, Man, and Cybernetics\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:55:03Z","timestamp":1620114903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}