1. [1] R. Okuda, T. Sato, H. Onodera, and K. Tamaru, “An algorithm for layout compaction problem with symmetry constraints, ” IEICE Trans. Fundamentals (Japanese Edition), vol.J73-A, no.3, pp.536-543, March 1990.
2. [2] H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani, “Rectangle-packing-based module placement, ” Proc. IEEE ICCAD, pp.472-479, 1995.
3. [3] T. Takahashi, “A new encoding scheme for rectangle packing problem, ” Proc. ASPDAC, pp.175-178, 2000.
4. [4] Y.-C. Chang, Y.-W. Chang, G.-M. Wu, and S.-W. Wu, “B*-trees: A new representation for non-slicing floorplans, ” Proc. DAC, pp.458-463, 2000.
5. [5] Y.-X. Pang, F. Balasa, K. Lampaert, and C.-K. Cheng, “Block placement with symmetry constraints based on the O-tree non-slicing representation, ” Proc. DAC, pp.464-467, 2000.