{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:08:39Z","timestamp":1780675719504,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":75,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"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":[[2020,3,30]]},"DOI":"10.1145\/3372780.3378173","type":"proceedings-article","created":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T21:30:19Z","timestamp":1584739819000},"page":"119-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Understanding Graphs in EDA"],"prefix":"10.1145","author":[{"given":"Yuzhe","family":"Ma","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhuolun","family":"He","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Zhang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bei","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/54.156154"},{"key":"e_1_3_2_1_2_1","first-page":"506","volume-title":"Proc. ITC","author":"Cheng K.-T.","year":"1995","unstructured":"K.-T. Cheng and C.-J. Lin , \u201cTiming-driven test point insertion for full-scan and partial-scan BIST ,\u201d in Proc. ITC , 1995 , pp. 506 -- 514 . K.-T. Cheng and C.-J. Lin, \u201cTiming-driven test point insertion for full-scan and partial-scan BIST,\u201d in Proc. ITC, 1995, pp. 506--514."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.854637"},{"issue":"4","key":"e_1_3_2_1_4_1","first-page":"527","article-title":"Fine granularity clustering-based placement","volume":"23","author":"Hu B.","year":"2004","unstructured":"B. Hu and M. Marek-Sadowska , \u201c Fine granularity clustering-based placement ,\u201d IEEE TCAD , vol. 23 , no. 4 , pp. 527 -- 536 , april 2004 . B. Hu and M. Marek-Sadowska, \u201cFine granularity clustering-based placement,\u201d IEEE TCAD, vol. 23, no. 4, pp. 527--536, april 2004.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2048374"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2387840"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2276751"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147009"},{"key":"e_1_3_2_1_9_1","volume-title":"IEEE TCAD","author":"Lin Y.","year":"2017","unstructured":"Y. Lin , B. Yu , X. Xu , J.-R. Gao , N. Viswanathan , W.-H. Liu , Z. Li , C. J. Alpert , and D. Z. Pan , \u201c MrDP: Multiple-row detailed placement of heterogeneous-sized cells for advanced nodes ,\u201d IEEE TCAD , 2017 . Y. Lin, B. Yu, X. Xu, J.-R. Gao, N. Viswanathan, W.-H. Liu, Z. Li, C. J. Alpert, and D. Z. Pan, \u201cMrDP: Multiple-row detailed placement of heterogeneous-sized cells for advanced nodes,\u201d IEEE TCAD, 2017."},{"key":"e_1_3_2_1_10_1","first-page":"1","volume-title":"Proc. DAC","author":"Li H.","year":"2018","unstructured":"H. Li , W.-K. Chow , G. Chen , E. F. Young , and B. Yu , \u201c Routability-driven and fence-aware legalization for mixed-cell-height circuits ,\u201d in Proc. DAC , 2018 , pp. 1 -- 6 . H. Li, W.-K. Chow, G. Chen, E. F. Young, and B. Yu, \u201cRoutability-driven and fence-aware legalization for mixed-cell-height circuits,\u201d in Proc. DAC, 2018, pp. 1--6."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2894653"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2288678"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2967032"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287684"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872334.2872353"},{"issue":"12","key":"e_1_3_2_1_16_1","first-page":"2298","article-title":"Cross-layer optimization for high speed adders: A pareto driven machine learning approach","volume":"38","author":"Ma Y.","year":"2018","unstructured":"Y. Ma , S. Roy , J. Miao , J. Chen , and B. Yu , \u201c Cross-layer optimization for high speed adders: A pareto driven machine learning approach ,\u201d IEEE TCAD , vol. 38 , no. 12 , pp. 2298 -- 2311 , 2018 . Y. Ma, S. Roy, J. Miao, J. Chen, and B. Yu, \u201cCross-layer optimization for high speed adders: A pareto driven machine learning approach,\u201d IEEE TCAD, vol. 38, no. 12, pp. 2298--2311, 2018.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203880"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3196056"},{"key":"e_1_3_2_1_19_1","volume-title":"IEEE TCAD","author":"Yang H.","year":"2018","unstructured":"H. Yang , J. Su , Y. Zou , Y. Ma , B. Yu , and E. F. Y. Young , \u201cLayout hotspot detection with feature tensor generation and deep biased learning ,\u201d IEEE TCAD , 2018 . H. Yang, J. Su, Y. Zou, Y. Ma, B. Yu, and E. F. Y. Young, \u201cLayout hotspot detection with feature tensor generation and deep biased learning,\u201d IEEE TCAD, 2018."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240843"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. ICLR","author":"Kipf T. N.","year":"2016","unstructured":"T. N. Kipf and M. Welling , \u201c Semi-supervised classification with graph convolutional networks ,\u201d Proc. ICLR , 2016 . T. N. Kipf and M. Welling, \u201cSemi-supervised classification with graph convolutional networks,\u201d Proc. ICLR, 2016."},{"key":"e_1_3_2_1_22_1","first-page":"1024","volume-title":"Proc. NIPS","author":"Hamilton W.","year":"2017","unstructured":"W. Hamilton , Z. Ying , and J. Leskovec , \u201c Inductive representation learning on large graphs ,\u201d in Proc. NIPS , 2017 , pp. 1024 -- 1034 . W. Hamilton, Z. Ying, and J. Leskovec, \u201cInductive representation learning on large graphs,\u201d in Proc. NIPS, 2017, pp. 1024--1034."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.330"},{"key":"e_1_3_2_1_25_1","first-page":"6410","volume-title":"Proc. NIPS","author":"You J.","year":"2018","unstructured":"J. You , B. Liu , Z. Ying , V. Pande , and J. Leskovec , \u201c Graph convolutional policy network for goal-directed molecular graph generation ,\u201d in Proc. NIPS , 2018 , pp. 6410 -- 6421 . J. You, B. Liu, Z. Ying, V. Pande, and J. Leskovec, \u201cGraph convolutional policy network for goal-directed molecular graph generation,\u201d in Proc. NIPS, 2018, pp. 6410--6421."},{"key":"e_1_3_2_1_26_1","first-page":"5694","volume-title":"Proc. ICML","author":"You J.","year":"2018","unstructured":"J. You , R. Ying , X. Ren , W. Hamilton , and J. Leskovec , \u201c Graphrnn: Generating realistic graphs with deep auto-regressive models ,\u201d in Proc. ICML , 2018 , pp. 5694 -- 5703 . J. You, R. Ying, X. Ren, W. Hamilton, and J. Leskovec, \u201cGraphrnn: Generating realistic graphs with deep auto-regressive models,\u201d in Proc. ICML, 2018, pp. 5694--5703."},{"key":"e_1_3_2_1_27_1","first-page":"1123","volume-title":"Proc. ICML","author":"Dai H.","year":"2018","unstructured":"H. Dai , H. Li , T. Tian , X. Huang , L. Wang , J. Zhu , and L. Song , \u201c Adversarial attack on graph structured data ,\u201d in Proc. ICML , 2018 , pp. 1123 -- 1132 . H. Dai, H. Li, T. Tian, X. Huang, L. Wang, J. Zhu, and L. Song, \u201cAdversarial attack on graph structured data,\u201d in Proc. ICML, 2018, pp. 1123--1132."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317838"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/123186.123418"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"issue":"2","key":"e_1_3_2_1_31_1","first-page":"267","article-title":"Hypergraph partitioning with fixed vertices","volume":"19","author":"Alpert C. J.","year":"2000","unstructured":"C. J. Alpert , A. E. Caldwell , A. B. Kahng , and I. L. Markov , \u201c Hypergraph partitioning with fixed vertices ,\u201d IEEE TCAD , vol. 19 , no. 2 , pp. 267 -- 272 , 2000 . C. J. Alpert, A. E. Caldwell, A. B. Kahng, and I. L. Markov, \u201cHypergraph partitioning with fixed vertices,\u201d IEEE TCAD, vol. 19, no. 2, pp. 267--272, 2000.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2401571"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"issue":"16","key":"e_1_3_2_1_34_1","first-page":"73","article-title":"Performance driven global routing for standard cell design","volume":"14","author":"Cong J.","year":"1997","unstructured":"J. Cong and P. H. Madden , \u201c Performance driven global routing for standard cell design ,\u201d in Proc. ISPD , vol. 14 , no. 16 , 1997 , pp. 73 -- 80 . J. Cong and P. H. Madden, \u201cPerformance driven global routing for standard cell design,\u201d in Proc. ISPD, vol. 14, no. 16, 1997, pp. 73--80.","journal-title":"Proc. ISPD"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/332357.332368"},{"issue":"1","key":"e_1_3_2_1_36_1","first-page":"25","article-title":"Efficient algorithms for channel routing","volume":"1","author":"Yoshimura T.","year":"1982","unstructured":"T. Yoshimura and E. S. Kuh , \u201c Efficient algorithms for channel routing ,\u201d IEEE TCAD , vol. 1 , no. 1 , pp. 25 -- 35 , 1982 . T. Yoshimura and E. S. Kuh, \u201cEfficient algorithms for channel routing,\u201d IEEE TCAD, vol. 1, no. 1, pp. 25--35, 1982.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2035577"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898048"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203763"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_41_1","volume-title":"Electronic design automation: synthesis, verification, and test. hskip 1em plus 0.5em minus 0.4emrelax Morgan Kaufmann","author":"Wang L.-T.","year":"2009","unstructured":"L.-T. Wang , Y.-W. Chang , and K.-T. T. Cheng , Electronic design automation: synthesis, verification, and test. hskip 1em plus 0.5em minus 0.4emrelax Morgan Kaufmann , 2009 . L.-T. Wang, Y.-W. Chang, and K.-T. T. Cheng, Electronic design automation: synthesis, verification, and test. hskip 1em plus 0.5em minus 0.4emrelax Morgan Kaufmann, 2009."},{"key":"e_1_3_2_1_42_1","first-page":"1","volume-title":"Proc. DAC","author":"Yu B.","year":"2014","unstructured":"B. Yu and D. Z. Pan , \u201c Layout decomposition for quadruple patterning lithography and beyond ,\u201d in Proc. DAC , 2014 , pp. 53: 1 -- 53 :6. B. Yu and D. Z. Pan, \u201cLayout decomposition for quadruple patterning lithography and beyond,\u201d in Proc. DAC, 2014, pp. 53:1--53:6."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2013.6691114"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.90255"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147189"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488818"},{"issue":"9","key":"e_1_3_2_1_47_1","first-page":"1532","article-title":"Layout decomposition co-optimization for hybrid e-beam and multiple patterning lithography","volume":"35","author":"Yang Y.","year":"2016","unstructured":"Y. Yang , W.-S. Luk , D. Z. Pan , H. Zhou , C. Yan , D. Zhou , and X. Zeng , \u201c Layout decomposition co-optimization for hybrid e-beam and multiple patterning lithography ,\u201d IEEE TCAD , vol. 35 , no. 9 , pp. 1532 -- 1545 , 2016 . Y. Yang, W.-S. Luk, D. Z. Pan, H. Zhou, C. Yan, D. Zhou, and X. Zeng, \u201cLayout decomposition co-optimization for hybrid e-beam and multiple patterning lithography,\u201d IEEE TCAD, vol. 35, no. 9, pp. 1532--1545, 2016.","journal-title":"IEEE TCAD"},{"issue":"12","key":"e_1_3_2_1_48_1","first-page":"2130","article-title":"BoxRouter: a new global router based on box expansion and progressive ILP","volume":"26","author":"Cho M.","year":"2007","unstructured":"M. Cho and D. Z. Pan , \u201c BoxRouter: a new global router based on box expansion and progressive ILP ,\u201d IEEE TCAD , vol. 26 , no. 12 , pp. 2130 -- 2143 , 2007 . M. Cho and D. Z. Pan, \u201cBoxRouter: a new global router based on box expansion and progressive ILP,\u201d IEEE TCAD, vol. 26, no. 12, pp. 2130--2143, 2007.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_49_1","volume-title":"JM3","author":"Lin Y.","unstructured":"Y. Lin , X. Xu , B. Yu , R. Baldick , and D. Z. Pan , \u201c Triple\/quadruple patterning layout decomposition via linear programming and iterative rounding ,\u201d JM3 , vol. 16 , no. 2, 2017. Y. Lin, X. Xu, B. Yu, R. Baldick, and D. Z. Pan, \u201cTriple\/quadruple patterning layout decomposition via linear programming and iterative rounding,\u201d JM3, vol. 16, no. 2, 2017."},{"issue":"7","key":"e_1_3_2_1_50_1","first-page":"1025","article-title":"Discrete buffer and wire sizing for link-based non-tree clock networks","volume":"18","author":"Samanta R.","year":"2009","unstructured":"R. Samanta , J. Hu , and P. Li , \u201c Discrete buffer and wire sizing for link-based non-tree clock networks ,\u201d IEEE TVLSI , vol. 18 , no. 7 , pp. 1025 -- 1035 , 2009 . R. Samanta, J. Hu, and P. Li, \u201cDiscrete buffer and wire sizing for link-based non-tree clock networks,\u201d IEEE TVLSI, vol. 18, no. 7, pp. 1025--1035, 2009.","journal-title":"IEEE TVLSI"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SLIP.2013.6681682"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2016.7428008"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2014.6974668"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACQED.2015.7274019"},{"issue":"9","key":"e_1_3_2_1_55_1","first-page":"1616","article-title":"A comprehensive survey of graph embedding: problems, techniques and applications","volume":"30","author":"Cai H.","year":"2018","unstructured":"H. Cai , V. W. Zheng , and K. Chang , \u201c A comprehensive survey of graph embedding: problems, techniques and applications ,\u201d IEEE TKDE , vol. 30 , no. 9 , pp. 1616 -- 1637 , 2018 . H. Cai, V. W. Zheng, and K. Chang, \u201cA comprehensive survey of graph embedding: problems, techniques and applications,\u201d IEEE TKDE, vol. 30, no. 9, pp. 1616--1637, 2018.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_56_1","volume-title":"A comprehensive survey on graph neural networks","author":"Wu Z.","year":"1901","unstructured":"Z. Wu , S. Pan , F. Chen , G. Long , C. Zhang , and P. S. Yu , \u201c A comprehensive survey on graph neural networks ,\u201d arXiv preprint arXiv: 1901 .00596, 2019. Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and P. S. Yu, \u201cA comprehensive survey on graph neural networks,\u201d arXiv preprint arXiv:1901.00596, 2019."},{"key":"e_1_3_2_1_57_1","volume-title":"Spectral networks and locally connected networks on graphs","author":"Bruna J.","year":"2013","unstructured":"J. Bruna , W. Zaremba , A. Szlam , and Y. LeCun , \u201c Spectral networks and locally connected networks on graphs ,\u201d arXiv preprint arXiv:1312.6203, 2013 . J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, \u201cSpectral networks and locally connected networks on graphs,\u201d arXiv preprint arXiv:1312.6203, 2013."},{"key":"e_1_3_2_1_58_1","first-page":"3844","volume-title":"Advances in neural information processing systems","author":"Defferrard M.","year":"2016","unstructured":"M. Defferrard , X. Bresson , and P. Vandergheynst , \u201c Convolutional neural networks on graphs with fast localized spectral filtering ,\u201d in Advances in neural information processing systems , 2016 , pp. 3844 -- 3852 . M. Defferrard, X. Bresson, and P. Vandergheynst, \u201cConvolutional neural networks on graphs with fast localized spectral filtering,\u201d in Advances in neural information processing systems, 2016, pp. 3844--3852."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2010350"},{"key":"e_1_3_2_1_60_1","first-page":"1993","article-title":"Diffusion-convolutional neural networks","author":"Atwood J.","year":"2016","unstructured":"J. Atwood and D. Towsley , \u201c Diffusion-convolutional neural networks ,\u201d in Advances in Neural Information Processing Systems , 2016 , pp. 1993 -- 2001 . J. Atwood and D. Towsley, \u201cDiffusion-convolutional neural networks,\u201d in Advances in Neural Information Processing Systems, 2016, pp. 1993--2001.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_61_1","volume-title":"Graph attention networks","author":"P.","year":"2017","unstructured":"P. Velivc kovi\u0107, G. Cucurull , A. Casanova , A. Romero , P. Lio , and Y. Bengio , \u201c Graph attention networks ,\u201d arXiv preprint arXiv:1710.10903, 2017 . P. Velivc kovi\u0107, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, \u201cGraph attention networks,\u201d arXiv preprint arXiv:1710.10903, 2017."},{"key":"e_1_3_2_1_62_1","volume-title":"Is pagerank all you need for scalable graph neural networks?","author":"Bojchevski A.","year":"2019","unstructured":"A. Bojchevski , J. Klicpera , B. Perozzi , M. Blais , A. Kapoor , M. Lukasik , and S. G\u00fcnnemann , \u201c Is pagerank all you need for scalable graph neural networks? \u201d 2019 . A. Bojchevski, J. Klicpera, B. Perozzi, M. Blais, A. Kapoor, M. Lukasik, and S. G\u00fcnnemann, \u201cIs pagerank all you need for scalable graph neural networks?\u201d 2019."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_1_64_1","volume-title":"Graphzoom: A multi-level spectral approach for accurate and scalable graph embedding","author":"Deng C.","year":"1910","unstructured":"C. Deng , Z. Zhao , Y. Wang , Z. Zhang , and Z. Feng , \u201c Graphzoom: A multi-level spectral approach for accurate and scalable graph embedding ,\u201d arXiv preprint arXiv: 1910 .02370, 2019. C. Deng, Z. Zhao, Y. Wang, Z. Zhang, and Z. Feng, \u201cGraphzoom: A multi-level spectral approach for accurate and scalable graph embedding,\u201d arXiv preprint arXiv:1910.02370, 2019."},{"key":"e_1_3_2_1_65_1","volume-title":"\u201cDeep graph library: Towards efficient and scalable deep learning on graphs","author":"Wang M.","year":"1909","unstructured":"M. Wang , L. Yu , D. Zheng , Q. Gan , Y. Gai , Z. Ye , M. Li , J. Zhou , Q. Huang , C. Ma \u201cDeep graph library: Towards efficient and scalable deep learning on graphs ,\u201d arXiv preprint arXiv: 1909 .01315, 2019. M. Wang, L. Yu, D. Zheng, Q. Gan, Y. Gai, Z. Ye, M. Li, J. Zhou, Q. Huang, C. Ma et al., \u201cDeep graph library: Towards efficient and scalable deep learning on graphs,\u201d arXiv preprint arXiv:1909.01315, 2019."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"e_1_3_2_1_67_1","volume-title":"Hypergraph convolution and hypergraph attention","author":"Bai S.","year":"1901","unstructured":"S. Bai , F. Zhang , and P. H. Torr , \u201c Hypergraph convolution and hypergraph attention ,\u201d arXiv preprint arXiv: 1901 .08150, 2019. S. Bai, F. Zhang, and P. H. Torr, \u201cHypergraph convolution and hypergraph attention,\u201d arXiv preprint arXiv:1901.08150, 2019."},{"key":"e_1_3_2_1_68_1","first-page":"1509","article-title":"Hypergcn: A new method for training graph convolutional networks on hypergraphs","author":"Yadati N.","year":"2019","unstructured":"N. Yadati , M. Nimishakavi , P. Yadav , V. Nitin , A. Louis , and P. Talukdar , \u201c Hypergcn: A new method for training graph convolutional networks on hypergraphs ,\u201d in Advances in Neural Information Processing Systems , 2019 , pp. 1509 -- 1520 . N. Yadati, M. Nimishakavi, P. Yadav, V. Nitin, A. Louis, and P. Talukdar, \u201cHypergcn: A new method for training graph convolutional networks on hypergraphs,\u201d in Advances in Neural Information Processing Systems, 2019, pp. 1509--1520.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_69_1","volume-title":"Theoretical Computer Science","author":"Chan T.-H. H.","year":"2019","unstructured":"T.-H. H. Chan and Z. Liang , \u201c Generalizing the hypergraph laplacian via a diffusion process with mediators ,\u201d Theoretical Computer Science , 2019 . T.-H. H. Chan and Z. Liang, \u201cGeneralizing the hypergraph laplacian via a diffusion process with mediators,\u201d Theoretical Computer Science, 2019."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"e_1_3_2_1_72_1","first-page":"2022","volume-title":"Heterogeneous graph attention network.\u201dhskip 1em plus 0.5em minus 0.4emrelax ACM, 2019","author":"Wang X.","unstructured":"X. Wang , H. Ji , C. Shi , B. Wang , Y. Ye , P. Cui , and P. S. Yu , \u201c Heterogeneous graph attention network.\u201dhskip 1em plus 0.5em minus 0.4emrelax ACM, 2019 , pp. 2022 -- 2032 . X. Wang, H. Ji, C. Shi, B. Wang, Y. Ye, P. Cui, and P. S. Yu, \u201cHeterogeneous graph attention network.\u201dhskip 1em plus 0.5em minus 0.4emrelax ACM, 2019, pp. 2022--2032."},{"key":"e_1_3_2_1_73_1","first-page":"11","volume-title":"Proc. NIPS","author":"Yun S.","year":"2019","unstructured":"S. Yun , M. Jeong , R. Kim , J. Kang , and H. J. Kim , \u201c Graph transformer networks ,\u201d in Proc. NIPS , 2019 , pp. 11 ,960--11,970. S. Yun, M. Jeong, R. Kim, J. Kang, and H. J. Kim, \u201cGraph transformer networks,\u201d in Proc. NIPS, 2019, pp. 11,960--11,970."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/800139.804528"},{"key":"e_1_3_2_1_75_1","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Maaten L.","year":"2008","unstructured":"L. v. d. Maaten and G. Hinton , \u201c Visualizing data using t-SNE ,\u201d Journal of Machine Learning Research , vol. 9 , no. Nov, pp. 2579 -- 2605 , 2008 . L. v. d. Maaten and G. Hinton, \u201cVisualizing data using t-SNE,\u201d Journal of Machine Learning Research, vol. 9, no. Nov, pp. 2579--2605, 2008.","journal-title":"Journal of Machine Learning Research"}],"event":{"name":"ISPD '20: International Symposium on Physical Design","location":"Taipei Taiwan","acronym":"ISPD '20","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2020 International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372780.3378173","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372780.3378173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:16Z","timestamp":1750203856000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372780.3378173"}},"subtitle":["From Shallow to Deep Learning"],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":75,"alternative-id":["10.1145\/3372780.3378173","10.1145\/3372780"],"URL":"https:\/\/doi.org\/10.1145\/3372780.3378173","relation":{},"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"2020-03-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}