{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:16Z","timestamp":1759637836852},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00394-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"643-649","source":"Crossref","is-referenced-by-count":16,"title":["On cutting a few vertices from a graph"],"prefix":"10.1016","volume":"127","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[]},{"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0166-218X(02)00394-3_BIB1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","article-title":"Finding good approximate vertex and edge partitions is NP-hard","volume":"42","author":"Bui","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(02)00394-3_BIB2","doi-asserted-by":"crossref","unstructured":"U. Feige, R. Krauthgamer, A polylogarithmic approximation of the minimum bisection, in: 41st Annual IEEE Symposium on Foundations of Computer Science, Redonolo Beach, CA, USA, 2000, pp. 105\u2013115.","DOI":"10.1109\/SFCS.2000.892070"},{"key":"10.1016\/S0166-218X(02)00394-3_BIB3","doi-asserted-by":"crossref","unstructured":"U. Feige, R. Krauthgamer, K. Nissim, Approximating the minimum bisection size, in: 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 2000, pp. 530\u2013536.","DOI":"10.1145\/335305.335370"},{"issue":"3","key":"10.1016\/S0166-218X(02)00394-3_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0166-218X(02)00394-3_BIB5","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/234533.234534","article-title":"A new approach to the minimum cut problem","volume":"43","author":"Karger","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(02)00394-3_BIB6","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003943?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003943?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T13:11:53Z","timestamp":1584018713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02003943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02003943"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00394-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}