{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:11:59Z","timestamp":1743088319290,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_38","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"479-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for Max-Cut via Semidefinite Programming"],"prefix":"10.1007","author":[{"given":"Charles","family":"Carlson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Kolla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ray","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitya","family":"Mani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01261315","volume":"16","author":"N Alon","year":"1996","unstructured":"Alon, N.: Bipartite subgraphs. Combinatorica 16, 301\u2013311 (1996)","journal-title":"Combinatorica"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0095-8956(03)00036-4","volume":"88","author":"N Alon","year":"2003","unstructured":"Alon, N., Bollob\u00e1s, B., Krivelevich, M., Sudakov, B.: Maximum cuts and judicious partitions in graphs without short cycles. J. Combin. Theory Ser. B 88, 329\u2013346 (2003)","journal-title":"J. Combin. Theory Ser. B"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S0963548305007017","volume":"14","author":"N Alon","year":"2005","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Max cut in $$H$$-free graphs. Combin. Prob. Comput. 14, 629\u2013647 (2005)","journal-title":"Combin. Prob. Comput."},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0012-365X(97)00041-1","volume":"181","author":"N Alon","year":"1998","unstructured":"Alon, N., Halperin, E.: Bipartite subgraphs of integer weighted graphs. Discret. Math. 181, 19\u201329 (1998)","journal-title":"Discret. Math."},{"key":"38_CR5","series-title":"Bolyai Society Mathematical Studies","first-page":"185","volume-title":"Contemporary Combinatorics","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B., Scott, A.D.: Better bounds for max cut. In: Bollob\u00e1s, B. (ed.) Contemporary Combinatorics. Bolyai Society Mathematical Studies, pp. 185\u2013246. Springer, Heidelberg (2002)"},{"issue":"1","key":"38_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11856-019-1897-z","volume":"233","author":"D Conlon","year":"2019","unstructured":"Conlon, D., Fox, J., Kwan, M., Sudakov, B.: Hypergraph cuts above the average. Isr. J. Math. 233(1), 67\u2013111 (2019). https:\/\/doi.org\/10.1007\/s11856-019-1897-z","journal-title":"Isr. J. Math."},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"3","author":"CS Edwards","year":"1973","unstructured":"Edwards, C.S.: Some extremal properties of bipartite subgraphs. Canad. J. Math. 3, 475\u2013485 (1973)","journal-title":"Canad. J. Math."},{"key":"38_CR8","unstructured":"Edwards, C.S.: An improved lower bound for the number of edges in a largest bipartite subgraph. In: Proceedings of the 2nd Czechoslovak Symposium on Graph Theory, Prague, pp. 167\u2013181 (1975)"},{"key":"38_CR9","first-page":"283","volume":"18","author":"P Erd\u0151s","year":"1967","unstructured":"Erd\u0151s, P.: On even subgraphs of graphs. Mat. Lapok 18, 283\u2013288 (1967)","journal-title":"Mat. Lapok"},{"key":"38_CR10","unstructured":"Erd\u0151s, P.: Problems and results in graph theory and combinatorial analysis. In: Proceedings of the 5th British Combinatorial Conference, pp. 169\u2013192 (1975)"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0095-8956(88)90057-3","volume":"45","author":"P Erd\u0151s","year":"1988","unstructured":"Erd\u0151s, P., Faudree, R., Pach, J., Spencer, J.: How to make a graph bipartite. J. Combin. Theory Ser. B 45, 86\u201398 (1988)","journal-title":"J. Combin. Theory Ser. B"},{"key":"38_CR12","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Wu, Y.: An optimal SDP algorithm for Max-Cut, and equally optimal long code tests. In: Proceedings of the 40th ACM Symposium on Theory of Computing, pp. 335\u2013344 (2008)","DOI":"10.1145\/1374376.1374425"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Poljak, S. Tuza, Zs.: Bipartite subgraphs of triangle-free graphs. SIAM J. Discret. Math. 7, 307\u2013313 (1994)","DOI":"10.1137\/S0895480191196824"},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/rsa.3240030211","volume":"3","author":"J Shearer","year":"1992","unstructured":"Shearer, J.: A note on bipartite subgraphs of triangle-free graphs. Rand. Struct. Alg. 3, 223\u2013226 (1992)","journal-title":"Rand. Struct. Alg."},{"key":"38_CR17","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00493-007-2238-0","volume":"27","author":"B Sudakov","year":"2007","unstructured":"Sudakov, B.: Making a $$K_4$$-free graph bipartite. Combinatorica 27, 509\u2013518 (2007)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:44:00Z","timestamp":1606945440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}