{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:37Z","timestamp":1725569737647},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_4","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T07:48:26Z","timestamp":1289375306000},"page":"15-26","source":"Crossref","is-referenced-by-count":1,"title":["max-cut\u00a0and Containment Relations in Graphs"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Kami\u0144ski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/PL00011425","volume":"90","author":"J. Vondrak","year":"2001","unstructured":"Vondrak, J., Galluccio, A., Loebl, M.: Optimization via enumeration: a new algorithm for the max cut problem. Mathematical Programming\u00a090(2), 273\u2013290 (2001)","journal-title":"Mathematical Programming"},{"issue":"1-3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(03)00387-1","volume":"132","author":"V.E. Alekseev","year":"2003","unstructured":"Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Applied Mathematics\u00a0132(1-3), 17\u201326 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.tcs.2007.09.013","volume":"389","author":"V.E. Alekseev","year":"2007","unstructured":"Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: Np-hard graph problems and boundary classes of graphs. Theor. Comput. Sci.\u00a0389(1-2), 219\u2013236 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2004.04.010","volume":"285","author":"V.E. Alekseev","year":"2004","unstructured":"Alekseev, V.E., Korobitsyn, D.V., Lozin, V.V.: Boundary classes of graphs for the dominating set problem. Discrete Mathematics\u00a0285(1-3), 1\u20136 (2004)","journal-title":"Discrete Mathematics"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0020-0190(88)90144-5","volume":"26","author":"C. Arbib","year":"1988","unstructured":"Arbib, C.: A polynomial characterization of some graph partitioning problems. Inf. Process. Lett.\u00a026(5), 223\u2013230 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","volume":"2","author":"F. Barahona","year":"1983","unstructured":"Barahona, F.: The Max-Cut problem on graphs not contractible to K. Oper. Res. Lett.\u00a02(3), 107\u2013111 (1983)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a forest. J. Comb. Theory, Ser. B\u00a052(2), 274\u2013283 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/3-540-57785-8_189","volume-title":"STACS 94","author":"H.L. Bodlaender","year":"1994","unstructured":"Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 769\u2013780. Springer, Heidelberg (1994)"},{"issue":"1","key":"4_CR9","first-page":"14","volume":"7","author":"H.L. Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. Nordic J. of Computing\u00a07(1), 14\u201331 (2000)","journal-title":"Nordic J. of Computing"},{"key":"4_CR10","first-page":"637","volume-title":"FOCS","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: FOCS, pp. 637\u2013646. IEEE Computer Society, Los Alamitos (2005)"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jcss.2003.12.001","volume":"69","author":"E.D. Demaine","year":"2004","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Nishimura, N., Ragde, P., Thilikos, D.M.: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci.\u00a069(2), 166\u2013195 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45753-4_8","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Thilikos, D.M.: 1.5-approximation for treewidth of graphs excluding a graph with one crossing as a minor. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 67\u201380. Springer, Heidelberg (2002)"},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1125-y","volume":"41","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Thilikos, D.M.: Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors. Algorithmica\u00a041(4), 245\u2013267 (2005)","journal-title":"Algorithmica"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2007.02.013","volume":"377","author":"J. D\u00edaz","year":"2007","unstructured":"D\u00edaz, J., Kami\u0144ski, M.: Max-Cut and Max-Bisection are NP-hard on unit disk graphs. Theoretical Computer Science\u00a0377, 271\u2013276 (2007)","journal-title":"Theoretical Computer Science"},{"key":"4_CR15","volume-title":"Graph Theory, Electronic edn.","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, Electronic edn. Springer, Heidelberg (2005)"},{"key":"4_CR16","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. Congress. Numer., 311\u2013315 (1978)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF02591727","volume":"29","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Nemhauser, G.L.: A polynomial algorithm for the Max-Cut problem on graphs without long odd cycles. Math. Prog.\u00a029, 28\u201340 (1984)","journal-title":"Math. Prog."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the Max-Cut problem. Oper. Res. Lett.\u00a01, 23\u201327 (1981)","journal-title":"Oper. Res. Lett."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/3-540-69346-7_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"B. Guenin","year":"1998","unstructured":"Guenin, B.: A characterization of weakly bipartite graphs. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol.\u00a01412, pp. 9\u201322. Springer, Heidelberg (1998)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S1571-0653(05)80148-9","volume":"5","author":"B. Guenin","year":"2000","unstructured":"Guenin, B.: A characterization of weakly bipartite graphs. Electronic Notes in Discrete Mathematics\u00a05, 149\u2013151 (2000)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jctb.2001.2051","volume":"83","author":"B. Guenin","year":"2001","unstructured":"Guenin, B.: A characterization of weakly bipartite graphs. J. Comb. Theory, Ser. B\u00a083(1), 112\u2013168 (2001)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2-3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0166-218X(99)00056-6","volume":"92","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V.: Maximum cut on line and total graphs. Discrete Applied Mathematics\u00a092(2-3), 217\u2013221 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F. Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput.\u00a04(3), 221\u2013225 (1975)","journal-title":"SIAM J. Comput."},{"key":"4_CR24","doi-asserted-by":"publisher","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: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013104. Plenum Press, New York (1972)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45477-2_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Kr\u00e1l","year":"2001","unstructured":"Kr\u00e1l, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandst\u00e4dt, A., Van Bang, L. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"issue":"6","key":"4_CR26","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.ipl.2008.11.005","volume":"109","author":"V.V. Lozin","year":"2009","unstructured":"Lozin, V.V., Mosca, R.: Maximum independent sets in subclasses of p5-free graphs. Inf. Process. Lett.\u00a0109(6), 319\u2013324 (2009)","journal-title":"Inf. Process. Lett."},{"key":"4_CR27","first-page":"502","volume":"10","author":"G. Orlova","year":"1972","unstructured":"Orlova, G., Dorfman, Y.: Finding the maximum cut in a graph. Tekhnicheskaya Kibernetika (Engineering Cybernetics)\u00a010, 502\u2013506 (1972)","journal-title":"Tekhnicheskaya Kibernetika (Engineering Cybernetics)"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B\u00a035(1), 39\u201361 (1983)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B\u00a041, 92\u2013114 (1986)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"4_CR30","series-title":"Contemporary Mathematics","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1090\/conm\/147\/01206","volume-title":"Graph Structure Theory","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Excluding a graph with one crossing. In: Robertson, N., Seymour, P.D. (eds.) Graph Structure Theory. Contemporary Mathematics, vol.\u00a0147, pp. 669\u2013676. American Mathematical Society, Providence (1991)"},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jctb.2001.2101","volume":"85","author":"A. Schrijver","year":"2002","unstructured":"Schrijver, A.: A short proof of Guenin\u2019s characterization of weakly bipartite graphs. J. Comb. Theory, Ser. B\u00a085(2), 255\u2013260 (2002)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/BF01594196","volume":"114","author":"K. Wagner","year":"1937","unstructured":"Wagner, K.: \u00dcber eine Eigenshaft der ebenen Komplexe. Math. Ann.\u00a0114, 570\u2013590 (1937)","journal-title":"Math. Ann."},{"key":"4_CR33","first-page":"253","volume-title":"STOC","author":"M. Yannakakis","year":"1978","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: STOC, pp. 253\u2013264. ACM, New York (1978)"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:27:29Z","timestamp":1553228849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}