{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:38Z","timestamp":1763467718291,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,8,21]],"date-time":"2005-08-21T00:00:00Z","timestamp":1124582400000},"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":[[2005,8,21]]},"DOI":"10.1145\/1081870.1081948","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"629-634","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":66,"title":["A fast kernel-based multilevel algorithm for graph clustering"],"prefix":"10.1145","author":[{"given":"Inderjit","family":"Dhillon","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}]},{"given":"Yuqiang","family":"Guan","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}]},{"given":"Brian","family":"Kulis","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}]}],"member":"320","published-online":{"date-parts":[[2005,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"445","volume-title":"6th SIAM Conference on Parallel Processing for Scientific Computing","author":"Bui T.","year":"1993","unstructured":"T. Bui and C. Jones . A heuristic for reducing fill-in in sparse matrix factorization . In 6th SIAM Conference on Parallel Processing for Scientific Computing , pages 445 -- 452 , 1993 . T. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In 6th SIAM Conference on Parallel Processing for Scientific Computing, pages 445--452, 1993."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.310898"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014118"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844769"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.175.0420"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/946247.946658"}],"event":{"name":"KDD05: The Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Chicago Illinois USA","acronym":"KDD05"},"container-title":["Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081870.1081948","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1081870.1081948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:38Z","timestamp":1750263518000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081870.1081948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8,21]]},"references-count":8,"alternative-id":["10.1145\/1081870.1081948","10.1145\/1081870"],"URL":"https:\/\/doi.org\/10.1145\/1081870.1081948","relation":{},"subject":[],"published":{"date-parts":[[2005,8,21]]},"assertion":[{"value":"2005-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}