{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:08Z","timestamp":1760202608482},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1137\/080729256","type":"journal-article","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T22:20:19Z","timestamp":1303942819000},"page":"567-596","source":"Crossref","is-referenced-by-count":47,"title":["Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut"],"prefix":"10.1137","volume":"40","author":[{"given":"Christoph","family":"Amb\u00fchl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monaldo","family":"Mastrolilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","reference":[{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90056-L"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/1361192.1361199"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0210-9"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1199"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.07.009"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447037"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90133-W"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00333-0"},{"key":"R28","first-page":"articl","volume":"17","author":"Raghavendra P.","year":"2010","journal-title":"Electron. Colloq. Comput. Complexity"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702413197"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/080729256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T17:12:19Z","timestamp":1485709939000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/080729256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["10.1137\/080729256"],"URL":"https:\/\/doi.org\/10.1137\/080729256","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}