{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T02:49:33Z","timestamp":1767494973408},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,23]],"date-time":"2015-10-23T00:00:00Z","timestamp":1445558400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"TUBITAK Career Project","award":["111M482"],"award-info":[{"award-number":["111M482"]}]},{"name":"TUBITAK Career Project","award":["111M482"],"award-info":[{"award-number":["111M482"]}]},{"name":"T\u00dcB\u0130TAK","award":["2221"],"award-info":[{"award-number":["2221"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-015-9963-x","type":"journal-article","created":{"date-parts":[[2015,10,23]],"date-time":"2015-10-23T07:43:30Z","timestamp":1445586210000},"page":"250-265","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The maximum cardinality cut problem in co-bipartite chain graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Arman","family":"Boyac\u0131","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T\u0131naz","family":"Ekim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mordechai","family":"Shalom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,23]]},"reference":[{"issue":"3","key":"9963_CR1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona F, Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1988) An application of combinatorial optimization to statistical physics and circuit layout design. Oper Res 36(3):493\u2013513","journal-title":"Oper Res"},{"issue":"2","key":"9963_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0021-9800(70)80019-9","volume":"9","author":"LW Beineke","year":"1970","unstructured":"Beineke LW (1970) Characterizations of derived graphs. J Comb Theory 9(2):129\u2013135","journal-title":"J Comb Theory"},{"issue":"2000","key":"9963_CR3","first-page":"14","volume":"7","author":"HL Bodlaender","year":"2000","unstructured":"Bodlaender HL, Jansen K (2000) On the complexity of the maximum cut problem. Nordic J Comput 7(2000):14\u201331","journal-title":"Nordic J Comput"},{"key":"9963_CR4","unstructured":"Boyac\u0131 A, Ekim T, Shalom M, Zaks S (2014) Graphs of edge-intersecting and non-splitting one bend paths in a grid (submitted)"},{"issue":"13","key":"9963_CR5","doi-asserted-by":"crossref","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 (2007) Max-cut and max-bisection are NP-hard on unit disk graphs. Theor Comput Sci 377(13):271\u2013276","journal-title":"Theor Comput Sci"},{"issue":"23","key":"9963_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0166-218X(99)00056-6","volume":"92","author":"V Guruswami","year":"1999","unstructured":"Guruswami V (1999) Maximum cut on line and total graphs. Discret Appl Math 92(23):217\u2013221","journal-title":"Discret Appl Math"},{"issue":"3","key":"9963_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock F (1975) Finding a maximum cut of a planar graph in polynomial time. SIAM J Comput 4(3):221\u2013225","journal-title":"SIAM J Comput"},{"issue":"1","key":"9963_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"PL Hammer","year":"1990","unstructured":"Hammer PL, Peled UN, Sun X (1990) Difference graphs. Discret Appl Math 28(1):35\u201344","journal-title":"Discret Appl Math"},{"issue":"1\u20132","key":"9963_CR9","first-page":"87","volume":"14","author":"P Heggernes","year":"2007","unstructured":"Heggernes P, Kratsch D (2007) Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nordic J Comput 14(1\u20132):87\u2013108","journal-title":"Nordic J Comput"},{"key":"9963_CR10","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller R, Thatcher J, Bohlinger J (eds) Complexity of computer computations. The IBM research symposia series. Springer, New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9963_CR11","unstructured":"WA LLC (2015) Wolfram\u2014alpha. \n                        http:\/\/tinyurl.com\/qabptkt\n                        \n                    . Accessed March 2015"},{"key":"9963_CR12","unstructured":"WA LLC (2015) Wolfram\u2014alpha. \n                        http:\/\/tinyurl.com\/pyxvpaq\n                        \n                    . Accessed March 2015"},{"key":"9963_CR13","unstructured":"WA LLC (2015) Wolfram\u2014alpha. \n                        http:\/\/tinyurl.com\/ofa4h4c\n                        \n                    . Accessed March 2015"},{"issue":"2","key":"9963_CR14","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis M (1981) Node-deletion problems on bipartite graphs. SIAM J Comput 10(2):310\u2013327","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9963-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9963-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9963-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9963-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:28Z","timestamp":1559262208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9963-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,23]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["9963"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9963-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,23]]}}}