{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:30:05Z","timestamp":1763724605978,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530511","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"613-618","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Pursuing more effective graph spectral sparsifiers via approximate trace reduction"],"prefix":"10.1145","author":[{"given":"Zhiqiang","family":"Liu","sequence":"first","affiliation":[{"name":"Tsinghua Univ., Beijing, China"}]},{"given":"Wenjian","family":"Yu","sequence":"additional","affiliation":[{"name":"Tsinghua Univ., Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"volume-title":"2021 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD).","author":"Aghdaei A.","key":"e_1_3_2_1_1_1","unstructured":"A. Aghdaei, Z. Zhao, and Z. Feng. 2021. HyperSF: spectral hypergraph coarsening via flow-based local clustering. In 2021 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)."},{"volume-title":"Proc. ACM STOC. 255--262","author":"Batson J.","key":"e_1_3_2_1_2_1","unstructured":"J. Batson, D. Spielman, and N. Srivastava. 2009. Twice-Ramanujan sparsifiers. In Proc. ACM STOC. 255--262."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898094"},{"key":"e_1_3_2_1_6_1","volume-title":"GRASS: GRAph Spectral Sparsifier. https:\/\/linproxy.fan.workers.dev:443\/https\/sites.google.com\/mtu.edu\/zhuofeng-graphspar\/home","author":"Feng Z.","year":"2018","unstructured":"Z. Feng. 2018. GRASS: GRAph Spectral Sparsifier. https:\/\/linproxy.fan.workers.dev:443\/https\/sites.google.com\/mtu.edu\/zhuofeng-graphspar\/home"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3196114"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.2968543"},{"volume-title":"Proc. ACM STOC. 246--251","author":"Gabow H. N.","key":"e_1_3_2_1_9_1","unstructured":"H. N. Gabow and R. E. Tarjan. 1983. A linear-time algorithm for a special case of disjoint set union. In Proc. ACM STOC. 246--251."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827594276552"},{"volume-title":"Proc. ACM FOCS. 235--244","author":"Koutis I.","key":"e_1_3_2_1_11_1","unstructured":"I. Koutis, G. Miller, and R. Peng. 2010. Approaching optimality for solving SDD linear systems. In Proc. ACM FOCS. 235--244."},{"volume-title":"2021 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD).","author":"Liu Z.","key":"e_1_3_2_1_12_1","unstructured":"Z. Liu and W. Yu. 2021. pGRASS-Solver: a parallel iterative solver for scalable power grid analysis based on graph spectral sparsification. In 2021 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Z. Liu W. Yu and Z. Feng. 2021. feGRASS: fast and effective graph spectral sparsification for scalable power grid analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2021).","DOI":"10.1109\/TCAD.2021.3060647"},{"key":"e_1_3_2_1_14_1","unstructured":"S. R. Nassif. 2008. IBM power grid benchmarks. https:\/\/linproxy.fan.workers.dev:443\/https\/web.ece.ucsb.edu\/~lip\/PGBenchmarks\/ibmpgbench.html"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the International Congress of Mathematicians.","author":"Spielman D.","year":"2010","unstructured":"D. Spielman. 2010. Algorithms, graph theory, and linear equations in Laplacian matrices. In Proceedings of the International Congress of Mathematicians."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"volume-title":"Proceedings of 37th Conference on Foundations of Computer Science. 96--105","author":"Spielman D.","key":"e_1_3_2_1_17_1","unstructured":"D. Spielman and S. Teng. 1996. Spectral partitioning works: planar graphs and finite element meshes. In Proceedings of 37th Conference on Foundations of Computer Science. 96--105."},{"key":"e_1_3_2_1_18_1","unstructured":"J. Yang and Z. Li. 2012. THU power grid benchmarks. https:\/\/linproxy.fan.workers.dev:443\/http\/tiger.cs.tsinghua.edu.cn\/PGBench\/"},{"volume-title":"2012 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD). 653--659","author":"Yang J.","key":"e_1_3_2_1_19_1","unstructured":"J. Yang, Z. Li, Y. Cai, and Q. Zhou. 2012. PowerRush : efficient transient simulation for power grid analysis. In 2012 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD). 653--659."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.microrel.2011.11.012"},{"volume-title":"IEEE\/ACM International Conference On Computer Aided Design (ICCAD).","author":"Zhang Y.","key":"e_1_3_2_1_21_1","unstructured":"Y. Zhang, Z. Zhao, and Z. Feng. 2020. SF-GRASS: solver-free graph spectral sparsification. In IEEE\/ACM International Conference On Computer Aided Design (ICCAD)."}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"location":"San Francisco California","acronym":"DAC '22"},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3489517.3530511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:17Z","timestamp":1750186937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3489517.3530511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":21,"alternative-id":["10.1145\/3489517.3530511","10.1145\/3489517"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3489517.3530511","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}