{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:13Z","timestamp":1725744913510},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_43","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"505-516","source":"Crossref","is-referenced-by-count":8,"title":["Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","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":"43_CR2","series-title":"Theory, algorithms and applications","volume-title":"Springer Monographs in Mathematics","author":"J. Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs. In: Springer Monographs in Mathematics, 2nd edn. Theory, algorithms and applications, Springer-Verlag London Ltd., London (2009)","edition":"2"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P.Z. Chinn","year":"1982","unstructured":"Chinn, P.Z., Chv\u00e1talov\u00e1, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices \u2014 a survey. J. Graph Theory\u00a06, 223\u2013254 (1982)","journal-title":"J. Graph Theory"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jctb.2011.05.001","volume":"102","author":"M. Chudnovsky","year":"2012","unstructured":"Chudnovsky, M., Fradkin, A., Seymour, P.: Tournament immersion and cutwidth. J. Comb. Theory Ser. B\u00a0102, 93\u2013101 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"key":"43_CR5","unstructured":"Chudnovsky, M., Scott, A., Seymour, P.: Vertex disjoint paths in tournaments (2011) (manuscript)"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jctb.2010.10.003","volume":"101","author":"M. Chudnovsky","year":"2011","unstructured":"Chudnovsky, M., Seymour, P.D.: A well-quasi-order for tournaments. J. Comb. Theory, Ser. B\u00a0101, 47\u201353 (2011)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.J.: A survey of graph layout problems. ACM Comput. Surv.\u00a034, 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1968802","volume":"43","author":"P. Erd\u0151s","year":"1942","unstructured":"Erd\u0151s, P.: On an elementary proof of some asymptotic formulas in the theory of partitions. Annals of Mathematics (2)\u00a043, 437\u2013450 (1942)","journal-title":"Annals of Mathematics (2)"},{"key":"43_CR9","unstructured":"Feige, U.: Faster FAST (Feedback Arc Set in Tournaments), CoRR, abs\/0911.5094 (2009)"},{"key":"43_CR10","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing. In: Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.\u00a020, pp. 32\u201343. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Pilipczuk, M.: Jungles, bundles, and fixed parameter tractability. In: Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 396\u2013413. SIAM (2012)","DOI":"10.1137\/1.9781611973105.29"},{"key":"43_CR12","unstructured":"Fradkin, A., Seymour, P.: Edge-disjoint paths in digraphs with bounded independence number (2010) (manuscript)"},{"key":"43_CR13","unstructured":"Fradkin, A., Seymour, P.: height 2pt depth -1.6pt width 23pt, Tournament pathwidth and topological containment. J. Comb. Theory Ser. B (in press, 2013)"},{"key":"43_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-31155-0_10","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"E. Ghosh","year":"2012","unstructured":"Ghosh, E., Kolay, S., Kumar, M., Misra, P., Panolan, F., Rai, A., Ramanujan, M.S.: Faster parameterized algorithms for deletion to split graphs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 107\u2013118. Springer, Heidelberg (2012)"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proceedings of the London Mathematical Society\u00a0s2-17, 75\u2013115 (1918)","DOI":"10.1112\/plms\/s2-17.1.75"},{"key":"43_CR16","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":"43_CR17","unstructured":"Kim, I., Seymour, P.: Tournament minors, CoRR, abs\/1206.3135 (2012)"},{"key":"43_CR18","unstructured":"Pilipczuk, M.: Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. In: Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.\u00a020, pp. 197\u2013208. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:10:31Z","timestamp":1558026631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}