{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T13:57:08Z","timestamp":1765807028134,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214079","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1131-1140","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Many sparse cuts via higher eigenvalues"],"prefix":"10.1145","author":[{"given":"Anand","family":"Louis","sequence":"first","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}]},{"given":"Prasad","family":"Raghavendra","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}]},{"given":"Prasad","family":"Tetali","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.59"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794285983"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.79"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706591.1706593"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00532234"},{"key":"e_1_3_2_2_9_1","first-page":"2","article-title":"Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency","volume":"6","author":"Barnard Stephen T.","year":"1994","unstructured":"Stephen T. Barnard and Horst D . Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency : Practice and Experience 6 ( 1994 ), no. 2 , 101--117. Stephen T. Barnard and Horst D. Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience 6 (1994), no. 2, 101--117.","journal-title":"Practice and Experience"},{"key":"e_1_3_2_2_10_1","volume-title":"Spectral graph theory","author":"Chung Fan","year":"1997","unstructured":"Fan Chung , Spectral graph theory , American Mathematical Society , 1997 . Fan Chung, Spectral graph theory, American Mathematical Society, 1997."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132547"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0916028"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447244"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214078"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033252.2033280"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806792"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806776"},{"key":"e_1_3_2_2_22_1","volume-title":"Manuscript","author":"Raghavendra Prasad","year":"2010","unstructured":"Prasad Raghavendra , David Steurer , and Madhur Tulsiani , Reductions between expansion problems , Manuscript , 2010 . Prasad Raghavendra, David Steurer, and Madhur Tulsiani, Reductions between expansion problems, Manuscript, 2010."},{"key":"e_1_3_2_2_23_1","first-page":"96","volume-title":"IEEE Computer Society","author":"Daniel","year":"1996","unstructured":"Daniel A. Spielman and Shang-Hua Teng, Spectral partitioning works: Planar graphs and finite element meshes, FOCS , IEEE Computer Society , 1996 , pp. 96 -- 105 . Daniel A. Spielman and Shang-Hua Teng, Spectral partitioning works: Planar graphs and finite element meshes, FOCS, IEEE Computer Society, 1996, pp. 96--105."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214079","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:57Z","timestamp":1750238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":23,"alternative-id":["10.1145\/2213977.2214079","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214079","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}