Weiping Shi

Professor

Shi

Office: WEB 333K
Phone: 979.845.3820
Fax: 979.845.2630
Email: wshi@tamu.edu

Research Website
Google Scholar Profile

Research Interests

His research interests include computer-aided design of Very Large Scale Integration (VLSI) CAD, including physical design, parasitic extraction, fault diagnosis, variational analysis and process synthesis.

Awards & Honors

  • IBM Faculty Award
  • Best Paper Awards from the Design Automation Conference and Asia and South Pacific Design Automation Conference
  • Research Initiation award from the NSF

Education

  • Ph.D. University of Illinois, Urbana-Champaign
  • MS Xian Jiaotong University, China
  • BS Xian Jiaotong University, China

Selected Publications

W. Shi and C. Su, “The rectilinear Steiner arborescence problem is NP-complete”, SIAM Journal on Computing, Vol. 35, No. 3, 2006, pp. 729-740.

W. Qiu and W. Shi, “Minimum moment Steiner trees”, Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, Jan 2004, pp. 481-488

W. Shi and D. West, “Structural diagnosis of wiring networks: Finding connected components of unknown subgraphs”, SIAM Journal on Discrete Mathematics, Vol. 14, No. 4, Oct. 2001, pp. 510-523. [SIAM Journal Online]

F. Shahrokhi and W. Shi, “On crossing sets, disjoint sets and page number”, Journal of Algorithms, Vol. 34, No. 1, Jan. 2000, pp. 40-53. [Ideal Library]

W. Shi and C. Su, “The rectilinear Steiner arborescence problem is NP-complete”, Proceedings of 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, Jan. 2000, pp. 780-787.

W. Shi and D. B. West, “Diagnosis of wiring networks: An optimal randomized algorithm for finding connected components of unknown graphs”, SIAM Journal on Computing, Vol. 28, No. 5, 1999, pp. 1541-1551. SIAM Journal Online

F. Shahrarkhi and W. Shi, “Efficient deterministic algorithm for embedding graphs on books”, Proceedings of 2nd International Conference on Combinatorics and Computing (COCOON), Hong Kong, June 1996, Lecture Notes in Computer Science 1090, pp. 162-168.

W. Shi and D. B. West, “Optimal algorithms for finding connected components of an unknown graph”, Proceedings of 1st International Conference on Combinatorics and Computing (COCOON), Xian, China, Aug. 1995, Lecture Notes in Computer Science 959, pp. 131-140.

S. Greibach, W. Shi and S. Simonson, “Single tree grammars”, Theoretical Studies in Computer Science, edited by J. D. Ullman, Academic Press, 1992, pp. 73-99.

H. Edelsbrunner and W. Shi, “An O(nlog^2h) time algorithm for three-dimensional convex hull problem,” SIAM Journal on Computing, Vol. 20, No. 2, April 1991, pp. 249-259.