{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:05Z","timestamp":1750308605666,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":78,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,3,25]],"date-time":"2018-03-25T00:00:00Z","timestamp":1521936000000},"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":[[2018,3,25]]},"DOI":"10.1145\/3177540.3177563","type":"proceedings-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T12:53:36Z","timestamp":1521204816000},"page":"114-119","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Influence of Professor T. C. Hu's Works on Fundamental Approaches in Layout"],"prefix":"10.1145","author":[{"given":"Andrew B.","family":"Kahng","sequence":"first","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,3,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0125042"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.817546"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055186"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/332357.332368"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/832284.835503"},{"key":"e_1_3_2_1_6_1","volume-title":"Nov.","author":"Alpert C. J.","year":"2016","unstructured":"C. J. Alpert , Personal Communication , Nov. 2016 . C. J. Alpert, Personal Communication, Nov. 2016."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177540.3178239"},{"key":"e_1_3_2_1_8_1","volume-title":"US Patent","author":"Alpert C. J.","year":"2003","unstructured":"C. J. Alpert , R. G. Gandham , J. Hu , S. T. Quay and A. J. Sullivan ,\" Apparatus and Method for Determining Buffered Steiner Trees for Complex Circuits \", US Patent 6591411, Jul. 2003 . C. J. Alpert, R. G. Gandham, J. Hu, S. T. Quay and A. J. Sullivan,\"Apparatus and Method for Determining Buffered Steiner Trees for Complex Circuits\", US Patent 6591411, Jul. 2003."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.391737"},{"key":"e_1_3_2_1_10_1","volume-title":"US Patent","author":"Alpert C. J.","year":"2006","unstructured":"C. J. Alpert , J. Hu and P. H. Villarrubia ,\" Practical Methodology for Early Buffer and Wire Resource Allocation \", US Patent 6996512, Feb. 2006 . C. J. Alpert, J. Hu and P. H. Villarrubia,\"Practical Methodology for Early Buffer and Wire Resource Allocation\", US Patent 6996512, Feb. 2006."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.469661"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.502195"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1515\/9783899498264","volume-title":"US Patent","author":"Bose S.","year":"2012","unstructured":"S. Bose ,\"Methods and Systems for Placement and Routing\" , US Patent 8332793, Dec. 2012 . S. Bose,\"Methods and Systems for Placement and Routing\", US Patent 8332793, Dec. 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.927674"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.1031"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337549"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.892854"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.486666"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170406"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177540.3177564"},{"key":"e_1_3_2_1_22_1","volume-title":"RePlAce: Advancing Solution Quality and Routability Validation in Global Placement\", manuscript in submission","author":"Cheng C. K.","year":"2017","unstructured":"C. K. Cheng , A. B. Kahng , I. Kang and L. Wang , \" RePlAce: Advancing Solution Quality and Routability Validation in Global Placement\", manuscript in submission , 2017 . C. K. Cheng, A. B. Kahng, I. Kang and L. Wang, \"RePlAce: Advancing Solution Quality and Routability Validation in Global Placement\", manuscript in submission, 2017."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917968"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.137519"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.823353"},{"key":"e_1_3_2_1_26_1","volume-title":"Optimal Flood Control","author":"Dickinson P.","year":"2011","unstructured":"P. Dickinson , J. Hulshof and A. Ran ,\" Optimal Flood Control \" ( 2011 ). P. Dickinson, J. Hulshof and A. Ran,\"Optimal Flood Control\" (2011)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_28_1","first-page":"1","volume-title":"Proc. DATE","author":"Du Y.","year":"2014","unstructured":"Y. Du and M. D. F. Wong , \"Optimization of Standard Cell BasedDetailed Placement for 16nm Fin FET Process\" , Proc. DATE , 2014 , pp. 1 -- 6 . Y. Du and M. D. F. Wong, \"Optimization of Standard Cell BasedDetailed Placement for 16nm FinFET Process\", Proc. DATE, 2014, pp. 1--6."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/090776147"},{"key":"e_1_3_2_1_30_1","volume-title":"US Patent","author":"Furnish G. M.","year":"2011","unstructured":"G. M. Furnish , M. J. LeBrun and S. Bose ,\" Node Spreading Via Artificial Density Enhancement to Reduce Routing Congestion \", US Patent 7921392, Apr. 2011 . G. M. Furnish, M. J. LeBrun and S. Bose,\"Node Spreading Via Artificial Density Enhancement to Reduce Routing Congestion\", US Patent 7921392, Apr. 2011."},{"key":"e_1_3_2_1_31_1","volume-title":"US Patent","author":"Furnish G. M.","year":"2011","unstructured":"G. M. Furnish , M. J. LeBrun and S. Bose ,\" Tunneling as a Boundary Congestion Relief Mechanism \", US Patent 7921393, Apr. 2011 . G. M. Furnish, M. J. LeBrun and S. Bose,\"Tunneling as a Boundary Congestion Relief Mechanism\", US Patent 7921393, Apr. 2011."},{"issue":"4","key":"e_1_3_2_1_32_1","first-page":"551","article-title":"Multi-Terminal Network Flows","volume":"9","author":"Gomory R. E.","year":"1961","unstructured":"R. E. Gomory and T. C. Hu ,\" Multi-Terminal Network Flows \", J. SIAM 9 ( 4 ) ( 1961 ), pp. 551 -- 570 . R. E. Gomory and T. C. Hu,\"Multi-Terminal Network Flows\", J. SIAM 9(4) (1961), pp. 551--570.","journal-title":"J. SIAM"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203841"},{"key":"e_1_3_2_1_34_1","volume-title":"US Patent","author":"He L.","year":"2013","unstructured":"L. He , S. Yao , W. Deng , J. Chen and L. Chao ,\" Interconnect Routing Methods of Integrated Circuit Designs \", US Patent 8386984, Feb. 2013 . L. He, S. Yao, W. Deng, J. Chen and L. Chao,\"Interconnect Routing Methods of Integrated Circuit Designs\", US Patent 8386984, Feb. 2013."},{"key":"e_1_3_2_1_35_1","volume-title":"US Patent","author":"Hentschke R. F.","year":"2012","unstructured":"R. F. Hentschke , M. de Oliveira Johann , J. Narasimhan and R. A. de Luz Reis ,\"Methods and Apparatus for Providing Flexible Timing-driven Routing Trees\" , US Patent 8095904, Jan. 2012 . R. F. Hentschke, M. de Oliveira Johann, J. Narasimhan and R. A. de Luz Reis,\"Methods and Apparatus for Providing Flexible Timing-driven Routing Trees\", US Patent 8095904, Jan. 2012."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/0123021"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.898"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.344"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.2.359"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"e_1_3_2_1_41_1","volume-title":"Combinatorial Algorithms","author":"Hu T. C.","year":"1982","unstructured":"T. C. Hu , Combinatorial Algorithms , Addison-Wesley , 1982 . T. C. Hu, Combinatorial Algorithms,Addison-Wesley, 1982."},{"key":"e_1_3_2_1_42_1","first-page":"207","volume-title":"Proc. 1st ACM Intl. Symp. on Physical Design","author":"Hu T. C.","year":"1997","unstructured":"T. C. Hu , \"Math, Models and Methods\" , keynote address and paper , Proc. 1st ACM Intl. Symp. on Physical Design , April 1997 , pp. 207 -- 210 . T. C. Hu, \"Math, Models and Methods\", keynote address and paper, Proc. 1st ACM Intl. Symp. on Physical Design, April 1997, pp. 207--210."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.89.19.9235"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/70.265921"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/0137015"},{"key":"e_1_3_2_1_46_1","volume-title":"VLSI Circuit Layout: Theory and Design","author":"Hu T. C.","year":"1985","unstructured":"T. C. Hu and E. S. Kuh , eds. , VLSI Circuit Layout: Theory and Design , New York , IEEE Press , 1985 . T. C. Hu and E. S. Kuh, eds., VLSI Circuit Layout: Theory and Design, New York, IEEE Press, 1985."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_22"},{"key":"e_1_3_2_1_48_1","first-page":"87","volume-title":"Multiterminal Flows in a Hypergraph\", in:T.C. Hu and E","author":"Hu T. C.","year":"1985","unstructured":"T. C. Hu and K. Moerder ,\" Multiterminal Flows in a Hypergraph\", in:T.C. Hu and E . Kuh (Eds.), VLSI Circuit Layout: Theory and Design (IEEE Press , New York, 1985 ) pp. 87 -- 93 . T. C. Hu and K. Moerder,\"Multiterminal Flows in a Hypergraph\", in:T.C. Hu and E. Kuh (Eds.), VLSI Circuit Layout: Theory and Design (IEEE Press, New York, 1985) pp. 87--93."},{"key":"e_1_3_2_1_49_1","first-page":"139","volume-title":"The \u03b1-\u03b2 Routing\", in:T.C. Hu and E","author":"Hu T. C.","year":"1985","unstructured":"T. C. Hu and M. T. Shing , \" The \u03b1-\u03b2 Routing\", in:T.C. Hu and E . Kuh (Eds.), VLSI Circuit Layout: Theory and Design (IEEE Press , New York, 1985 ) pp. 139 -- 143 . T. C. Hu and M. T. Shing, \"The \u03b1-\u03b2 Routing\", in:T.C. Hu and E. Kuh (Eds.), VLSI Circuit Layout: Theory and Design (IEEE Press, New York, 1985) pp. 139--143."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121044"},{"key":"e_1_3_2_1_51_1","volume-title":"Combinatorial Algorithms","author":"Hu T. C.","year":"2002","unstructured":"T. C. Hu and M. T. Shing , Combinatorial Algorithms , Enlarged Second Edition, New York, Dover Publications , 2002 . T. C. Hu and M. T. Shing, Combinatorial Algorithms, Enlarged Second Edition, New York, Dover Publications, 2002."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289510"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00101-X"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90115-P"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/332357.332401"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.177409"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.1999.760005"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.67789"},{"key":"e_1_3_2_1_59_1","first-page":"103","volume-title":"Proc. SODA","author":"Kortsarz G.","year":"1997","unstructured":"G. Kortsarz and D. Peleg ,\" Approximating Shallow-light Trees \", Proc. SODA , 1997 , pp. 103 -- 110 . G. Kortsarz and D. Peleg,\"Approximating Shallow-light Trees\", Proc. SODA, 1997, pp. 103--110."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21958"},{"key":"e_1_3_2_1_61_1","first-page":"223","volume-title":"ICCAD","author":"Li J.","year":"1995","unstructured":"% J. Li , J. Lillis and C. K. Cheng , \" Linear Decomposition Algorithm for VLSI Design Applications\",% Proc . ICCAD , 1995 , pp. 223 -- 228 . %J. Li, J. Lillis and C. K. Cheng, \"Linear Decomposition Algorithm for VLSI Design Applications\",% Proc. ICCAD, 1995, pp. 223--228."},{"key":"e_1_3_2_1_62_1","first-page":"42","volume-title":"Proc. ASP-DAC","author":"Lin C.-T.","year":"2004","unstructured":"C.-T. Lin , D.-S. Chen and Y.-W. Wang ,\"Fixed-Outline Floorplanning Through Evolutionary Search\" , Proc. ASP-DAC , 2004 , pp. 42 -- 44 . C.-T. Lin, D.-S. Chen and Y.-W. Wang,\"Fixed-Outline Floorplanning Through Evolutionary Search\", Proc. ASP-DAC, 2004, pp. 42--44."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2967055"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.5555\/2840819.2840875"},{"key":"e_1_3_2_1_65_1","first-page":"1883","volume-title":"Proc. ISCAS","author":"Liu R.","year":"2005","unstructured":"R. Liu , S. Dong , X. Hong and Y. Kajitani ,\" Fixed-Outline Floorplanning with Constraints Through InstanceAugmentation \", Proc. ISCAS , 2005 , pp. 1883 -- 1886 . R. Liu, S. Dong, X. Hong and Y. Kajitani,\"Fixed-Outline Floorplanning with Constraints Through InstanceAugmentation\", Proc. ISCAS, 2005, pp. 1883--1886."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.384426"},{"key":"e_1_3_2_1_67_1","first-page":"198","volume-title":"Proc. ASP-DAC","author":"Luo C.","year":"2008","unstructured":"C. Luo , M. F. Anjos and A. Vannelli ,\" Large-Scale Fixed-Outline Floorplanning Design Using ConvexOptimization Techniques \", Proc. ASP-DAC , 2008 , pp. 198 -- 203 . C. Luo, M. F. Anjos and A. Vannelli,\"Large-Scale Fixed-Outline Floorplanning Design Using ConvexOptimization Techniques\", Proc. ASP-DAC, 2008, pp. 198--203."},{"key":"e_1_3_2_1_68_1","first-page":"96D","article-title":"A Specific Network Link and Path Likelihood Prediction Tool","volume":"1996","author":"Moy G. K.","unstructured":"G. K. Moy ,\" A Specific Network Link and Path Likelihood Prediction Tool \", AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH , 1996 , No. AFIT\/GCS\/ENG\/ 96D - 921 . G. K. Moy,\"A Specific Network Link and Path Likelihood Prediction Tool\", AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH, 1996, No. AFIT\/GCS\/ENG\/96D-21.","journal-title":"AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405004"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_71_1","volume-title":"US Patent","author":"Saxena P.","year":"2010","unstructured":"P. Saxena , V. Khandelwal , C. Qiao , P-H. Ho , J. C. Lin and M. A. Iyer ,\" Interconnect-driven Physical Synthesis using Persistent Virtual Routing \", US Patent 7853915, Dec. 2010 . P. Saxena, V. Khandelwal, C. Qiao, P-H. Ho, J. C. Lin and M. A. Iyer,\"Interconnect-driven Physical Synthesis using Persistent Virtual Routing\", US Patent 7853915, Dec. 2010."},{"key":"e_1_3_2_1_72_1","first-page":"165","article-title":"A Decomposition Algorithm for Multi-terminal Network Flows","author":"Shing M. T.","year":"1985","unstructured":"% M. T. Shing and T. C. Hu , \" A Decomposition Algorithm for Multi-terminal Network Flows \", % Discrete Applied Mathematics 13(2,3) ( 1985 ), pp. 165 -- 181 . %M. T. Shing and T. C. Hu, \"A Decomposition Algorithm for Multi-terminal Network Flows\",% Discrete Applied Mathematics 13(2,3) (1985), pp. 165--181.","journal-title":"% Discrete Applied Mathematics 13(2,3) ("},{"key":"e_1_3_2_1_73_1","first-page":"141","volume-title":"European Symposium on Algorithms","author":"Stoer M.","unstructured":"M. Stoer and F. Wagner ,\" A Simple Min Cut Algorithm \", In European Symposium on Algorithms , Berlin, Springer , pp. 141 -- 147 . M. Stoer and F. Wagner,\"A Simple Min Cut Algorithm\", In European Symposium on Algorithms, Berlin, Springer, pp. 141--147."},{"key":"e_1_3_2_1_74_1","volume-title":"An Energy Efficient Spectrum Sensing in Cognitive Radio Wireless Sensor Networks\" arXiv preprint arXiv:1711.09255","author":"Surampudi A.","year":"2017","unstructured":"A. Surampudi and K. Kalimuthu ,\" An Energy Efficient Spectrum Sensing in Cognitive Radio Wireless Sensor Networks\" arXiv preprint arXiv:1711.09255 ( 2017 ). A. Surampudi and K. Kalimuthu,\"An Energy Efficient Spectrum Sensing in Cognitive Radio Wireless Sensor Networks\" arXiv preprint arXiv:1711.09255 (2017)."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/54.9271"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2041850"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.552086"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.3233\/BME-151420"}],"event":{"name":"ISPD '18: International Symposium on Physical Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"ISPD '18"},"container-title":["Proceedings of the 2018 International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177540.3177563","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3177540.3177563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:50Z","timestamp":1750273550000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177540.3177563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,25]]},"references-count":78,"alternative-id":["10.1145\/3177540.3177563","10.1145\/3177540"],"URL":"https:\/\/doi.org\/10.1145\/3177540.3177563","relation":{},"subject":[],"published":{"date-parts":[[2018,3,25]]},"assertion":[{"value":"2018-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}