{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:33Z","timestamp":1725490233864},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_11","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"115-126","source":"Crossref","is-referenced-by-count":3,"title":["Multicut on Graphs of Bounded Clique-Width"],"prefix":"10.1007","author":[{"given":"Martin","family":"Lackner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"R\u00fcmmele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"459","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011","author":"N. Bousquet","year":"2011","unstructured":"Bousquet, N., Daligault, J., Thomass\u00e9, S.: Multicut is FPT. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 459\u2013468. ACM, New York (2011)"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0196-6774(03)00073-7","volume":"48","author":"G. Calinescu","year":"2003","unstructured":"Calinescu, G., Fernandes, C.G., Reed, B.: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms\u00a048(2), 333\u2013359 (2003)","journal-title":"J. Algorithms"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"D.G. Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput.\u00a034(4), 825\u2013847 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. Syst. Sci.\u00a046(2), 218\u2013270 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst.\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"1-3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics\u00a0101(1-3), 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput.\u00a023(4), 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Transactions on Circuits and Systems (1988)","DOI":"10.1109\/31.1748"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1137\/070687256","volume":"23","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width is NP-complete. SIAM J. Discrete Math.\u00a023(2), 909\u2013939 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Applied Mathematics\u00a0158(7), 851\u2013867 (2010); Third Workshop on Graph Classes, Optimization and Width Parameters Eugene, Oregon, USA (October 2007)","DOI":"10.1016\/j.dam.2009.10.018"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and Multicut in trees. Algorithmica\u00a018(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ipl.2007.03.005","volume":"103","author":"G. Gottlob","year":"2007","unstructured":"Gottlob, G., Lee, S.T.: A logical approach to Multicut problems. Information Processing Letters\u00a0103(4), 136\u2013141 (2007)","journal-title":"Information Processing Letters"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11611257_28","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"J. Guo","year":"2006","unstructured":"Guo, J., H\u00fcffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and Exact Algorithms for Multicut. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 303\u2013312. Springer, Heidelberg (2006)"},{"key":"11_CR14","unstructured":"Gurski, F.: Graph operations on clique-width bounded graphs. CoRR abs\/cs\/0701185 (2007)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-21064-8_7","volume-title":"The Semanic Web: Research and Applications","author":"C. Gutierrez","year":"2011","unstructured":"Gutierrez, C., Hurtado, C., Vaisman, A.: RDFS Update: From Theory to Practice. In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., De Leenheer, P., Pan, J. (eds.) ESWC 2011, Part II. LNCS, vol.\u00a06644, pp. 93\u2013107. Springer, Heidelberg (2011)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-13562-0_26","volume-title":"Theory and Applications of Models of Computation","author":"P. Heggernes","year":"2010","unstructured":"Heggernes, P., Meister, D., Rotics, U.: Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol.\u00a06108, pp. 284\u2013295. Springer, Heidelberg (2010)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-20712-9_18","volume-title":"Computer Science \u2013 Theory and Applications","author":"P. Heggernes","year":"2011","unstructured":"Heggernes, P., Meister, D., Rotics, U.: Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651, pp. 233\u2013246. Springer, Heidelberg (2011)"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. The Computer Journal\u00a051(3), 326\u2013362 (2008)","journal-title":"The Computer Journal"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","volume":"351","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci.\u00a0351(3), 394\u2013406 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR20","first-page":"469","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011","author":"D. Marx","year":"2011","unstructured":"Marx, D., Razgon, I.: Fixed-parameter tractability of Multicut parameterized by the size of the cutset. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 469\u2013478. ACM, New York (2011)"},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B\u00a096(4), 514\u2013528 (2006)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:40Z","timestamp":1620128860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}