{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:16:59Z","timestamp":1725603419504},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_43","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"561-575","source":"Crossref","is-referenced-by-count":6,"title":["The Computational Complexity of Disconnected Cut and 2K 2-Partition"],"prefix":"10.1007","author":[{"given":"Barnaby","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(00)00197-9","volume":"105","author":"A. Brandst\u00e4dt","year":"2000","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, V.B., Szymczak, T.: On stable cutsets in graphs. Discrete Appl. Math.\u00a0105, 39\u201350 (2000)","journal-title":"Discrete Appl. Math."},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings of LICS 2003, pp. 321\u2013330 (2003)","DOI":"10.1109\/LICS.2003.1210072"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing\u00a034, 720\u2013742 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1137\/060666238","volume":"21","author":"K. Cameron","year":"2007","unstructured":"Cameron, K., Eschen, E.M., Ho\u00e1ng, C.T., Sritharan, R.: The complexity of the list partition problem for graphs. SIAM J. Discrete Math.\u00a021, 900\u2013929 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.disc.2009.11.030","volume":"310","author":"K. Cook","year":"2010","unstructured":"Cook, K., Dantas, S., Eschen, E.M., Faria, L., de Figueiredo, C.M.H., Klein, S.: 2K\n                  2 vertex-set partition into nonempty parts. Discrete Math.\u00a0310, 1259\u20131264 (2010)","journal-title":"Discrete Math."},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V. Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Recognizing decomposable graphs. J. Graph Theory\u00a08, 51\u201353 (1984)","journal-title":"J. Graph Theory"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1051\/ita:2005008","volume":"39","author":"S. Dantas","year":"2005","unstructured":"Dantas, S., de Figueiredo, C.M.H., Gravier, S., Klein, S.: Finding H-partitions efficiently. RAIRO-Theoret. Inf. Appl.\u00a039, 133\u2013144 (2005)","journal-title":"RAIRO-Theoret. Inf. Appl."},{"key":"43_CR8","unstructured":"Dantas, S., Maffray, F., Silva, A.: 2K\n                  2-partition of some classes of graphs. Discrete Applied Mathematics (to appear)"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jctb.1997.1812","volume":"72","author":"T. Feder","year":"1998","unstructured":"Feder, T., Hell, P.: List homomorphisms to reflexive graphs. J. Combin. Theory Ser. B\u00a072, 236\u2013250 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1137\/S0895480100384055","volume":"16","author":"T. Feder","year":"2003","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: List partitions. SIAM J. Discrete Math.\u00a016, 449\u2013478 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"de Figueiredo, C.M.H.: The P versus NP-complete dichotomy of some challenging problems in graph theory. Discrete Applied Mathematics (to appear)","DOI":"10.1016\/j.dam.2010.12.014"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1016\/j.tcs.2008.12.059","volume":"410","author":"H. Fleischner","year":"2009","unstructured":"Fleischner, H., Mujuni, E., Paulusma, D., Szeider, S.: Covering graphs with few complete bipartite subgraphs. Theoret. Comput. Sci.\u00a0410, 2045\u20132053 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-20712-9_20","volume-title":"Computer Science \u2013 Theory and Applications","author":"P.A. Golovach","year":"2011","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: Computing vertex-surjective homomorphisms to partially reflexive trees. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651, pp. 261\u2013274. Springer, Heidelberg (2011)"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-colouring. Journal of Combinatorial Theory, Series B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-642-10631-6_62","volume-title":"Algorithms and Computation","author":"T. Ito","year":"2009","unstructured":"Ito, T., Kami\u0144ski, M., Paulusma, D., Thilikos, D.M.: Parameterizing Cut Sets in a Graph by the Number of Their Components. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 605\u2013615. Springer, Heidelberg (2009)"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Ito, T., Kaminski, M., Paulusma, D., Thilikos, D.M.: On disconnected cuts and separators. Discrete Applied Mathematics (to appear)","DOI":"10.1016\/j.dam.2011.04.027"},{"key":"43_CR17","unstructured":"Martin, B., Paulusma, D.: The Computational Complexity of Disconnected Cut and 2K2-Partition, \n                    \n                      http:\/\/arxiv.org\/abs\/1104.4779"},{"key":"43_CR18","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.dam.2010.03.015","volume":"159","author":"R.B. Teixeira","year":"2011","unstructured":"Teixeira, R.B., Dantas, S., de Figueiredo, C.M.H.: The external constraint 4 nonempty part sandwich problem. Discrete Applied Mathematics\u00a0159, 661\u2013673 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/S0097539701383522","volume":"32","author":"N. Vikas","year":"2002","unstructured":"Vikas, N.: Computational complexity of compaction to reflexive cycles. SIAM Journal on Computing\u00a032, 253\u2013280 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR20","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/S0097539701397801","volume":"33","author":"N. Vikas","year":"2004","unstructured":"Vikas, N.: Compaction, Retraction, and Constraint Satisfaction. SIAM Journal on Computing\u00a033, 761\u2013782 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR21","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jcss.2004.07.003","volume":"71","author":"N. Vikas","year":"2005","unstructured":"Vikas, N.: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. J. Comput. Syst. Sci.\u00a071, 406\u2013439 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"43_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","volume":"12","author":"S.H. Whitesides","year":"1981","unstructured":"Whitesides, S.H.: An algorithm for finding clique cut-sets. Inform. Process. Lett.\u00a012, 31\u201332 (1981)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T16:26:42Z","timestamp":1554136002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}