{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:26:30Z","timestamp":1772295990823,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1145\/2488608.2488611","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"11-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Improved Cheeger's inequality"],"prefix":"10.1145","author":[{"given":"Tsz Chiu","family":"Kwok","sequence":"first","affiliation":[{"name":"CUHK, Hong Kong, Hong Kong"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[{"name":"CUHK, Hong Kong, Hong Kong"}]},{"given":"Yin Tat","family":"Lee","sequence":"additional","affiliation":[{"name":"CUHK, Hong Kong, Hong Kong"}]},{"given":"Shayan","family":"Oveis Gharan","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4%3C457::AID-RSA14%3E3.0.CO;2-W"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.59"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.36"},{"key":"e_1_3_2_1_7_1","volume-title":"Approximate clustering without the approximation.In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1068--1077","author":"Balcan M.-F.","year":"2009","unstructured":"M.-F. Balcan , A. Blum , A. Gupta . Approximate clustering without the approximation.In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1068--1077 , 2009 M.-F. Balcan, A. Blum, A. Gupta. Approximate clustering without the approximation.In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1068--1077, 2009"},{"key":"e_1_3_2_1_8_1","volume-title":"Are stable instances easy?In Proceedings of Innovations in Computer Science (ICS), 332--341","author":"Bilu Y.","year":"2010","unstructured":"Y. Bilu , N. Linial . Are stable instances easy?In Proceedings of Innovations in Computer Science (ICS), 332--341 , 2010 . Y. Bilu, N. Linial. Are stable instances easy?In Proceedings of Innovations in Computer Science (ICS), 332--341, 2010."},{"key":"e_1_3_2_1_9_1","volume-title":"On the practically interesting instances of MAXCUT.In arXiv:1205.4893","author":"Bilu Y.","year":"2012","unstructured":"Y. Bilu , A. Daniely , N. Linial , M. Saks . On the practically interesting instances of MAXCUT.In arXiv:1205.4893 , 2012 . Y. Bilu, A. Daniely, N. Linial, M. Saks. On the practically interesting instances of MAXCUT.In arXiv:1205.4893, 2012."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706591.1706593"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488611","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488611"}},"subtitle":["analysis of spectral partitioning algorithms through higher order spectral gap"],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":10,"alternative-id":["10.1145\/2488608.2488611","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488611","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}