1. A dense gate matrix layout method for MOS VLSI;Lopez;IEEE Trans. Electron. Devices,1980
2. Simulated Annealing for VLSI Design, vol. 42;Wong,2012
3. Gate matrix layout;Wing;IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.,1985
4. T. Kashiwabara, T. Fujisawa, NP-completeness of the problem of finding a minimum clique number interval graph containing a given graph as a subgraph, in: Proceedings of the 1979 IEEE International Symposium on Circuits e Systems, Tokyo, Japan, July, pp. 657–660.
5. Connections between cutting-pattern sequencing, vlsi design, and flexible machines;Linhares;Comput. Oper. Res.,2002