| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 1989 | A New Approach to Topological Via Minimization | Sarrafzadeh, M.; Lee, D. T. | IEEE Trans. Computer-Aided Design 8, 890-900 | | | |
| 1993 | An Exact Algorithm for Single-Layer Wire-Length Minimization | Ho, Jan-Ming; Sarrafzadeh, M.; Suzuki, A. | IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 12 | | | |
| 1992 | An Optimal Algorithm for the Maximum Two-Chain Problem | Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. | SIAM J. Discrete Algorithms 5, 285-304 | | | |
| 1990 | Layer Assignment for Multi-Chip Modules | Ho, Jan-Ming; Sarrafzadeh, M.; Vijayan, G.; Wong, C. K. | IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems , 1272-1277 | | | |
| 1993 | Maximum Independent Set of a Permutation Graph in K Tracks | Lee, D. T. ; Sarrafzadeh, M. | International Journal of Computational Geometry & Applications 3(3), 291-304 | | | |
| 1990 | Minimum Cut for Circular-arc Graphs | Lee, D. T. ; Sarrafzadeh, M.; Wu, Y. F. | SIAM J. Computing 19, 1041-1050 | | | |
| 1990 | Pad Minimization for Planar Routing of Multiple Power Nets | Ho, Jan-Ming; Sarrafzadeh, M.; Vijayan, G.; Wong, C. K. | IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems , 419-426 | | | |
| 1990 | Planar Subset of Multi-terminal Nets | Liao, K. F.; Lee, D. T. ; Sarrafzadeh, M. | Integration, the VLSI Journal 10, 19-37 | | | |
| 1994 | Restricted Track Assignment with Applications | Sarrafzadeh, M.; Lee, D. T. | International Journal of Computational Geometry and Applications 4, 53-68 | | | |
| 1991 | Topological Via Minimization Revisited | Sarrafzadeh, M.; Lee, D. T. | IEEE Transactions on Computers 40(11), 1307-1312 | | | |
| 1999 | Two-Way and Multi-Way Partitioning a Set of Intervals for Clique-Width Maximization | Farrahi, A. H.; Lee, D. T. ; Sarrafzadeh, M. | Algorithmica 23, 187-210 | | | |
