1. Arikati, S., Chaudhuri, S., and Zaroliagis, C., All-pairs min-cut in sparse networks, Journal of the ACM 29(1), pp. 82–110, 1998.
2. Caldwell, A. E., Kahng, A. B., and Markov, I. L., Can recursive bisection alone produce routable placements?, Proceedings of the Design Automation Conference, pp. 477–482, 2000.
3. Chatterjee, S., and Brayton, R., A new incremental placement algorithm and its application to congestion-aware divisor extraction, Proceedings of the International Conference on Computer-Aided Design, pp. 541–548, 2004.
4. Cong J., and Lim, S., Edge separability based circuit clustering with application to circuit partitioning, Proceedings of the Asia and South Pacific Design Automation Conference, pp. 429–434, 2000.
5. Dai, W., Hierarchial physical design methodology for multi-million gate chips, Proceedings of the International Symposium on Physical Design, pp. 179–181, 2001.