{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:24:41Z","timestamp":1770906281961,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,1,30]],"date-time":"2014-01-30T00:00:00Z","timestamp":1391040000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00453-014-9872-x","type":"journal-article","created":{"date-parts":[[2014,1,29]],"date-time":"2014-01-29T11:47:38Z","timestamp":1390996058000},"page":"778-790","source":"Crossref","is-referenced-by-count":11,"title":["A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization"],"prefix":"10.1007","volume":"72","author":[{"given":"Yasuaki","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"Hisao","family":"Tamaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,30]]},"reference":[{"issue":"5","key":"9872_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 1\u201323 (2008)","journal-title":"J. ACM"},{"key":"9872_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-642-02927-1_6","volume-title":"Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, Part I","author":"N. Alon","year":"2009","unstructured":"Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, Part I. Lecture Notes in Computer Science, vol. 5555, pp. 49\u201358. Springer, Berlin (2009)"},{"key":"9872_CR3","first-page":"1","volume":"11","author":"H. Bodlaender","year":"1993","unstructured":"Bodlaender, H.: A tourist guide through treewidth. Acta Cybern. 11, 1\u201323 (1993)","journal-title":"Acta Cybern."},{"key":"9872_CR4","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1998)"},{"issue":"1","key":"9872_CR5","doi-asserted-by":"crossref","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 40(1), 15\u201331 (2004)","journal-title":"Algorithmica"},{"issue":"2","key":"9872_CR6","doi-asserted-by":"crossref","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. J. Discrete Algorithms 6(2), 313\u2013323 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"9872_CR7","doi-asserted-by":"crossref","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(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"9872_CR8","series-title":"Lecture Notes in Computer Science","first-page":"337","volume-title":"Proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010","author":"H. Fernau","year":"2010","unstructured":"Fernau, H., Fomin, F.V., Lokshtanov, D., Mnich, M., Philip, G., Saurabh, S.: Ranking and drawing in subexponential time. In: Proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010. Lecture Notes in Computer Science, vol. 6460, pp. 337\u2013348. Springer, Berlin (2010)"},{"key":"9872_CR9","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 62, 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"9872_CR10","doi-asserted-by":"crossref","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? J. Comput. Syst. Sci. 63, 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"9872_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"9872_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-17517-6_3","volume-title":"Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, Part I","author":"M. Karpinski","year":"2010","unstructured":"Karpinski, M., Schudy, W.: Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament. In: Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, Part I. Lecture Notes in Computer Science, vol. 6506, pp. 3\u201314. Springer, Berlin (2010)"},{"key":"9872_CR13","first-page":"95","volume-title":"Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC 2007","author":"C. Kenyon-Mathieu","year":"2007","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC 2007, pp. 95\u2013103. ACM, New York (2007)"},{"key":"9872_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/978-3-642-33090-2_59","volume-title":"Proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012","author":"Y. Kobayashi","year":"2012","unstructured":"Kobayashi, Y., Tamaki, H.: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization. In: Proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012. Lecture Notes in Computer Science, vol. 7501, pp. 683\u2013694. Springer, Berlin (2012)"},{"key":"9872_CR15","first-page":"41","volume":"105","author":"D. Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. Eur. Assoc. Theor. Comput. Sci. 105, 41\u201372 (2011)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"9872_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-45848-4_10","volume-title":"Proceedings of the 9th International Symposium on Graph Drawing, GD 2002","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: Proceedings of the 9th International Symposium on Graph Drawing, GD 2002. Lecture Notes in Computer Science, vol. 2265, pp. 115\u2013123. Springer, Berlin (2002)"},{"key":"9872_CR17","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 332, 417\u2013446 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9872_CR18","doi-asserted-by":"crossref","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 Comput. Geom. 33(4), 569\u2013591 (2005)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9872_CR19","doi-asserted-by":"crossref","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. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9872-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9872-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9872-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T14:15:48Z","timestamp":1551190548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9872-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,30]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9872"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9872-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,30]]}}}