{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T09:07:54Z","timestamp":1760346474896},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00493-015-2944-y","type":"journal-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T13:53:20Z","timestamp":1454334800000},"page":"537-556","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On judicious bipartitions of graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Jie","family":"Ma","sequence":"first","affiliation":[]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,1]]},"reference":[{"key":"2944_CR1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01261315","volume":"16","author":"N. Alon","year":"1996","unstructured":"N. Alon: Bipartite subgraphs, Combinatorica 16 (1996), 301\u2013311.","journal-title":"Combinatorica"},{"key":"2944_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0095-8956(03)00036-4","volume":"88","author":"N. Alon","year":"2003","unstructured":"N. Alon, B. Bollob\u00e1s, M. Krivelevich, and B. Sudakov: Maximum cuts and judicious partitions in graphs without short cycles, J. Combin. Theory Ser. B 88 (2003), 329\u2013346.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2944_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0012-365X(97)00041-1","volume":"181","author":"N. Alon","year":"1998","unstructured":"N. Alon and E. Halperin: Bipartite subgraphs of integer weighted graphs, Discrete Math. 181 (1998), 19\u201329.","journal-title":"Discrete Math"},{"key":"2944_CR4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume":"1644","author":"P. Berman","year":"1999","unstructured":"P. Berman and M. Karpinski: On some tighter inapproximability results, (extended abstract) Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 1644 (1999), 200\u2013209.","journal-title":"(extended abstract) Lecture Notes in Computer Science"},{"key":"2944_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01876314","volume":"26","author":"B. Bollob\u00e1s","year":"1993","unstructured":"B. Bollob\u00e1s and A. D. Scott: On judicious partitions, Period. Math. Hungar. 26 (1993), 127\u2013139.","journal-title":"Period. Math. Hungar."},{"key":"2944_CR6","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s004939970002","volume":"19","author":"B. Bollob\u00e1s","year":"1999","unstructured":"B. Bollob\u00e1s and A. D. Scott: Exact bounds for judicious partitions of graphs, Combinatorica 19 (1999), 473\u2013486.","journal-title":"Combinatorica"},{"key":"2944_CR7","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1002\/rsa.10062","volume":"21","author":"B. Bollob\u00e1s","year":"2002","unstructured":"B. Bollob\u00e1s and A. D. Scott: Problems and results on judicious partitions, Random Structures and Algorithms 21 (2002), 414\u2013430.","journal-title":"Random Structures and Algorithms"},{"key":"2944_CR8","first-page":"185","volume-title":"Contemporary Comb","author":"B. Bollob\u00e1s","year":"2002","unstructured":"B. Bollob\u00e1s and A. D. Scott: Better bounds for Max Cut, in Contemporary Comb, Bolyai Soc Math Stud 10, Janos Bolyai Math Soc, Budapest (2002), 185\u2013246."},{"key":"2944_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.10174","volume":"46","author":"B. Bollob\u00e1s","year":"2004","unstructured":"B. Bollob\u00e1s and A. D. Scott: Judicious partitions of bounded-degree graphs, J. Graph Theory 46 (2004), 131\u2013143.","journal-title":"J. Graph Theory"},{"key":"2944_CR10","doi-asserted-by":"crossref","first-page":"2126","DOI":"10.1016\/j.disc.2010.04.004","volume":"310","author":"B. Bollob\u00e1s","year":"2010","unstructured":"B. Bollob\u00e1s and A. D. Scott: Max k-cut and judicious k-partitions, Discrete Math. 310 (2010), 2126\u20132139.","journal-title":"Discrete Math."},{"key":"2944_CR11","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"25","author":"C. S. Edwards","year":"1973","unstructured":"C. S. Edwards: Some extremal properties of bipartite graphs, Canadian J. math. 25 (1973), 475\u2013485.","journal-title":"Canadian J. math."},{"key":"2944_CR12","first-page":"167","volume-title":"Proc. 2nd Czechoslovak Symposium on Graph Theory","author":"C. S. Edwards","year":"1975","unstructured":"C. S. Edwards: An improved lower bound for the number of edges in a largest bipartite subgraph, In: Proc. 2nd Czechoslovak Symposium on Graph Theory, Prague (1975), 167\u2013181."},{"key":"2944_CR13","volume-title":"Proc. 26 th Southeastern International Conference on Graph Theory","author":"P. Erd\u0151s","year":"1995","unstructured":"P. Erd\u0151s: Some recent problems in Combinatorics and Graph Theory, Proc. 26 th Southeastern International Conference on Graph Theory, Combinatorics and Com- puting, Boca Raton, 1995, Congressus Numerantium."},{"key":"2944_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0196-6774(02)00005-6","volume":"43","author":"U. Feige","year":"2002","unstructured":"U. Feige, M. Karpinski, and M. Langberg: Improved approximation of max-cut on graphs of bounded degree, J. Algorithms 43 (2002), 201\u2013219.","journal-title":"J. Algorithms"},{"key":"2944_CR15","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson: Improved approximation algorithms for maximum cut and satisfiability using semidefinite programming, J. ACM 42 (1995), 1115\u20131145.","journal-title":"J. ACM"},{"key":"2944_CR16","doi-asserted-by":"crossref","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":"R. M. Karp: Reducibility among combinatorial problems, in Complexity of Computer Computations, (R. Miller and J. Thatcher, eds) Plenum Press, New York, (1972), 85\u2013103."},{"key":"2944_CR17","volume-title":"Surveys in Combinatorics (2005)","author":"A. Scott","year":"2005","unstructured":"A. Scott: Judicious partitions and related problems, in Surveys in Combinatorics (2005), 95\u2013117, London Math. Soc. Lecture Note Ser., 327, Cambridge Univ. Press, Cambridge, 2005."},{"key":"2944_CR18","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1017\/S0963548311000204","volume":"20","author":"B. Xu","year":"2011","unstructured":"B. Xu and X. Yu: Better bounds for k-partitions of graphs, Combinatorics, Probability and Computing 20 (2011), 631\u2013640.","journal-title":"Probability and Computing"},{"key":"2944_CR19","first-page":"253","volume-title":"STOC","author":"M. Yannakakis","year":"1978","unstructured":"M. Yannakakis: Node- and Edge-Deletion NP-Complete Problems, STOC (1978), 253\u2013264."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-2944-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-2944-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-2944-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-2944-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:51Z","timestamp":1559093571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-2944-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,1]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["2944"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-2944-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,1]]}}}