Wagner, T. C., and Papalambros, P. Y., 1993, “A General Framework for Decomposition Analysis in Optimal Design,” "*Advances in Design Automation*", B.J.Gilmore, ed., ASME, New York, pp. 315–325.

Chen, L., Ding, Z., and Li, S., 2005, “A Formal Two-Phase Method for Decomposition of Complex Design Problems,” ASME J. Mech. Des., 127 , pp. 184–195.

[CrossRef]Chen, L., Ding, Z., and Li, S., 2005, “Tree-Based Dependency Analysis in Decomposition and Re-Decomposition of Complex Design Problems,” ASME J. Mech. Des., 127 , pp. 12–23.

[CrossRef]Chen, L., and Li, S., 2005, “Analysis of Decomposability and Complexity for Design Problems in the Context of Decomposition,” ASME J. Mech. Des., 127 , pp. 545–557.

[CrossRef]Simon, H. A., 1996, "*The Sciences of the Artificial*", MIT, Cambridge, MA.

Steward, D. V., 1981, “The Design Structure System: A Method for Managing the Design of Complex Systems,” IEEE Trans. Eng. Manage., 28 , pp. 71–74.

Fernandez, C., 1998, “Integration Analysis of Product Architecture to Support Effective Team Co-Location,” MS thesis, MIT, Cambridge, MA.

Thebeau, R., 2001, “Knowledge Management of System Interfaces and Interactions for Product Development Processes,” MS thesis, MIT, Cambridge, MA.

Sharman, D. M., and Yassine, A. A., 2004, “Characterizing Complex Product Architectures,” J. Syst. Eng., 7 , pp. 35–60.

[CrossRef]Steward, D. V., 1965, “Partitioning and Tearing Systems of Equations,” SIAM (Soc. Ind. Appl. Math.) J. Numer. Anal., 2 , pp. 345–365.

[CrossRef]Warfield, J. N., 1973, “Binary Matrices in System Modeling,” IEEE Trans. Syst. Man Cybern., 3 , pp. 441–449.

[CrossRef]Kusiak, A., Larson, T. N., and Wang, J., 1994, “Reengineering of Design and Manufacturing Processes,” Comput. Ind. Eng., 26 , pp. 521–536.

[CrossRef]Altus, S. S., Kroo, I. M., and Gage, P. J., 1996, “A Genetic Algorithm for Scheduling and Decomposition of Multidisciplinary Design Problems,” ASME J. Mech. Des., 118 , pp. 486–489.

[CrossRef]Li, S., 2009, “Matrix-Based Decomposition Algorithms for Engineering Applications: The Survey and Generic Framework,” Int. J. Prod. Dev., 9 , pp. 78–110.

[CrossRef]Danilovic, M., and Browning, T. R., 2007, “Managing Complex Product Development Projects With Design Structure Matrices and Domain Mapping Matrices,” Int. J. Proj. Manage., 25 , pp. 300–314.

[CrossRef]Lindemann, U., Maurer, M., and Braun, T., 2008, "*Structural Complexity Management: An Approach for the Field of Product Design*", Springer, Berlin.

McCormick, W. T., Schweitzer, P. J., and White, T. W., 1972, “Problem Decomposition and Data Reorganization by a Clustering Technique,” Oper. Res., 20 , pp. 993–1009.

[CrossRef]King, J. R., and Nakornchai, V., 1982, “Machine-Component Group Formation in Group Technology: Review and Extension,” Int. J. Prod. Res., 20 , pp. 117–133.

[CrossRef]King, J. R., 1980, “Machine-Component Group in Production Flow Analysis: An Approach Using a Rank Order Clustering Algorithm,” Int. J. Prod. Res., 18 , pp. 213–232.

[CrossRef]Kusiak, A., and Chow, W. S., 1987, “Efficient Solving of the Group Technology Problem,” J. Manuf. Syst., 6 , pp. 117–124.

[CrossRef]Kusiak, A., 2000, "*Computational Intelligence in Design and Manufacturing*", Wiley, New York.

Kusiak, A., and Cheng, C. H., 1990, “A Branch-and-Bound Algorithm for Solving the Group Technology Problem,” Ann. Operat. Res., 26 , pp. 415–431.

Kusiak, A., and Wang, J., 1993, “Decomposition of the Design Process,” ASME J. Mech. Des., 115 , pp. 687–695.

[CrossRef]Suh, N. P., 1990, "*The Principles of Design*", Oxford University Press, New York.

Clausing, D., 1994, "*Total Quality Development: A Step-by-Step Guide to World-Class Concurrent Engineering*", ASME, New York.

Weil, R. L., and Kettler, P. C., 1971, “Rearranging Matrices to Block-Angular Form for Decomposition (and Other) Algorithms,” Manage. Sci., 18 , pp. 98–108.

[CrossRef]Arabie, P., and Hubert, L. J., 1990, “The Bond Energy Algorithm Revisited,” IEEE Trans. Syst. Man Cybern., 20 , pp. 268–274.

[CrossRef]Michelena, N. F., and Papalambros, P. Y., 1995, “A Network Reliability Approach to Optimal Decomposition of Design Problems,” ASME J. Mech. Des., 117 , pp. 433–440.

[CrossRef]Michelena, N. F., and Papalambros, P. Y., 1997, “A Hypergraph Framework for Optimal Model-Based Decomposition of Design Problems,” Comput. Optim. Appl., 8 , pp. 173–196.

[CrossRef]Krishnamachari, R. S., and Papalambros, P. Y., 1997, “Optimal Hierarchical Decomposition Synthesis Using Integer Programming,” ASME J. Mech. Des., 119 , pp. 440–447.

[CrossRef]Everitt, B., 1993, "*Cluster Analysis*", Wiley, New York.

Dhillon, I. S., 2001, “Co-Clustering Documents and Words Using Bipartite Spectral Graph Partitioning,” Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , San Francisco, CA, pp. 269–274.

Garey, M. R., and Johnson, D. S., 1979, "*Computers and Intractability: A Guide to the Theory of NP-Completeness*", Freedman, New York.

Kernighan, B. W., and Lin, S., 1970, “An Efficient Heuristic Procedure for Partitioning Graphs,” Bell Syst. Tech. J., 49 , pp. 291–307.

Fiduccia, C. M., and Mattheyses, R. M., 1982, “A Linear-Time Heuristic for Improving Network Partitions,” Proceedings of the 19th IEEE Design Automation Conference , pp. 174–181.

Hall, K. M., 1970, “An r-Dimensional Quadratic Placement Algorithm,” Manage. Sci., 17 , pp. 219–229.

[CrossRef]Fiedler, M., 1973, “Algebraic Connectivity of Graphs,” Czech. Math. J., 23 , pp. 298–305.

Karypis, G., and Kumar, V., 1998, “A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs,” SIAM J. Sci. Comput. (USA), 20 , pp. 359–392.

[CrossRef]Bui, T. N., and Moon, B. R., 1996, “Genetic Algorithm and Graph Partitioning,” IEEE Trans. Comput., 45 , pp. 841–855.

[CrossRef]Schloegel, K., Karypis, G., and Kumar, V., 2003, “Graph Partitioning for High-Performance Scientific Simulations,” "*Sourcebook of Parallel Computing*", J.Dongarra, I.Foster, G.Fox, W.Gropp, K.Kennedy, L.Torczon, and A.White, eds., Morgan Kaufmann, San Francisco, CA.

Sneath, P. H. A., and Sokal, R. R., 1973, "*Numerical Taxonomy: The Principles and Practice of Numerical Classification*", W.H. Freeman and Company, San Francisco, CA.

Kannapan, S. M., and Marshek, K. M., 1993, “An Approach to Parametric Machine Design and Negotiation in Concurrent Engineering,” "*Concurrent Engineering: Automation, Tools and Techniques*", A.Kusiak, ed., Wiley, New York, pp. 509–533.

Li, S., 2005, “A Formal Decomposition-Based Redesign Methodology for Rapid Design Customization,” Ph.D. thesis, University of Toronto, Toronto, Canada.

Rinderle, J. R., and Suh, N. P., 1982, “Measures of Functional Coupling in Design,” ASME J. Eng. Ind., 104 , pp. 383–388.

[CrossRef]