Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	P.K. Agarwal, D. Eppstein, and J. Matousek. "Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees". In Annual Symposium on Foundations of Computer Science, 1992.
	2	Charles J. Alpert, The ISPD98 circuit benchmark suite, Proceedings of the 1998 international symposium on Physical design, p.80-85, April 06-08, 1998, Monterey, California, United States  [doi>10.1145/274535.274546]
	3	Charles J. Alpert , Andrew B. Kahng, A general framework for vertex orderings with applications to circuit clustering, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.4 n.2, p.240-246, June 1996  [doi>10.1109/92.502195]
	4	M. Bae, G.T. Dong, S.W. Yang, and H. Chang. "An Optimization Technique for BDD Based on Bidirectional Incremental Sifting". Korean Information Science Society, Comput. Syst. Theory, 25(9):1058-1066, September 1998.
	5	M. Barbehenn and S. Hutshinson. "Efficient search and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Paths Trees". IEEE Transactions on Robotics and Automation, 11(2):198- 214, April 1995.
	6	S. T. Barnard and H. D. Simon. "A Fast Multilevel Implementation of recursive Spectral Bisection For Partitioning Unstructured Problem". In SIAM Conference on Parallel Processing for Scientific Computing, pages 711-718, 1993.
	7	K. Bazargan, S. Kim, and M. Sarrafzadeh. "Nostradamus: A Floorplanner of Uncertain Designs". IEEE Transactions on Computer Aided Design, 18(4):389- 397, April 1999.
	8	Daniel Brand , Anthony Drumm , Sandip Kundu , Prakash Narain, Incremental synthesis, Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, p.14-18, November 06-10, 1994, San Jose, California, United States
	9	R. G. Bushroe , S. DasGupta , A. Dengi , P. Fisher , S. Grout , G. Ledenbach , N. S. Nagaraj , R. Steele, Chip hierarchical design system (CHDS): a foundation for timing-driven physical design into the 21st century, Proceedings of the 1997 international symposium on Physical design, p.212-217, April 14-16, 1997, Napa Valley, California, United States  [doi>10.1145/267665.267720]
	10	Andrew E. Caldwell , Andrew B. Kahng , Igor L. Markov, Improved algorithms for hypergraph bipartitioning, Proceedings of the 2000 conference on Asia South Pacific design automation, p.661-666, January 2000, Yokohama, Japan  [doi>10.1145/368434.368864]
	11	Raul Camposano, The quarter micron challenge: intergrating physical and logic design, Proceedings of the 1997 international symposium on Physical design, p.211, April 14-16, 1997, Napa Valley, California, United States  [doi>10.1145/267665.267717]
	12	A. Chandrakasan and R. Brodersen. "Minimizing Power Consumption in Digital CMOS Circuits". Proceedings of the IEEE, pages 498-523, April 1995.
	13	Y.-J. Chiang and R. Tamassia. "Dynamic Algorithms in Computational Geometry". Proceedings of the IEEE, 80(9):1412-1434, September 1992.
	14	C.-S. Choy, T.-S. Cheung, and K.-K. Wong. "Incremental Layout Placement Modification Algorithms". IEEE Transactions on Computer Aided Design, 15(4):437- 445, April 1996.
	15	Jason Cong , Jie Fang , Kei-Yong Khoo, An implicit connection graph maze routing algorithm for ECO routing, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.163-167, November 07-11, 1999, San Jose, California, United States
	16	Jason Cong , Jie Fang , Kei-Yong Khoo, VIA design rule consideration in multi-layer maze routing algorithms, Proceedings of the 1999 international symposium on Physical design, p.214-220, April 12-14, 1999, Monterey, California, United States  [doi>10.1145/299996.300084]
	17	Jason Cong , Jie Fang , Kei-Yong Khoo, DUNE: a multi-layer gridless routing system with wire planning, Proceedings of the 2000 international symposium on Physical design, p.12-18, May 2000, San Diego, California, United States  [doi>10.1145/332357.332367]
	18	J. Cong and L. He. Theory and algorithm of localrefinement-based optimization with application to device and interconnect sizing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systerns, 18(4):406-420, Apr 1999.
	19	Jason Cong , Lei He , Cheng-Kok Koh , Patrick H. Madden, Performance optimization of VLSI interconnect layout, Integration, the VLSI Journal, v.21 n.1-2, p.1-94, Nov. 1996  [doi>10.1016/S0167-9260(96)00008-9]
	20	Jason Cong , Hui Huang, Depth optimal incremental mapping for field programmable gate arrays, Proceedings of the 37th conference on Design automation, p.290-293, June 05-09, 2000, Los Angeles, California, United States  [doi>10.1145/337292.337422]
	21	Jason Cong , Honching Peter Li , Sung Kyu Lim , Toshiyuki Shibuya , Dongmin Xu, Large scale circuit partitioning with loose/stable net removal and signal flow based clustering, Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, p.441-446, November 09-13, 1997, San Jose, California, United States
	22	Jason Cong , David Zhigang Pan, Interconnect estimation and planning for deep submicron designs, Proceedings of the 36th ACM/IEEE conference on Design automation, p.507-510, June 21-25, 1999, New Orleans, Louisiana, United States  [doi>10.1145/309847.309988]
	23	Jason Cong , M'Lissa Smith, A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design, Proceedings of the 30th international conference on Design automation, p.755-760, June 14-18, 1993, Dallas, Texas, United States  [doi>10.1145/157485.165119]
	24	Jason Cong , Sung Kyu Lim, Multiway partitioning with pairwise movement, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.512-516, November 08-12, 1998, San Jose, California, United States  [doi>10.1145/288548.289079]
	25	Jim Crenshaw , Majid Sarrafzadeh , Prithviraj Banerjee , Pradeep Prabhakaran, An Incremental Floorplanner, Proceedings of the Ninth Great Lakes Symposium on VLSI, p.248, March 04-06, 1999
	26	A. Deutsch, G.V. Kopcsay, P.J. Restle, H.H. Smith, G. Katopis, W.D. Becker, P.V. Coteus, C.W. Surovic, B.J. Rubin, R.P. Dunne Jr., T. Gallo, K.A. Jenkins, L.M. Terman, R.H. Dennard, G.A. Sai-Halasz, B.L. Krauter, and D.R. Knebel. "When are Transmission- Line Effects Important for On-Chip Interconnections?". IEEE Transactions on Microwave Theory and Techniques, 45(10):1836-1846, October 1997.
	27	H. Edelsbrunner. A new approach to rectangle intersections. Intl. Journal of Computer Mathematics, 13(3- 4):209-229, 1983.
	28	Hans Eisenmann , Frank M. Johannes, Generic global placement and floorplanning, Proceedings of the 35th annual conference on Design automation, p.269-274, June 15-19, 1998, San Francisco, California, United States  [doi>10.1145/277044.277119]
	29	J.M. Emmert and D. Bhatia. "Incremental Routing in FPGAs". In IEEE International ASIC Conference and Exhibit, 1998.
	30	D. Eppstein. "Sparsification - A Technique for Speeding up Dynamic Graph Algorithms". In Annual Symposium on Foundations of Computer Science, 1992.
	31	C. M. Fiduccia , R. M. Mattheyses, A linear-time heuristic for improving network partitions, Proceedings of the 19th conference on Design automation, p.175-181, January 1982
	32	J.-Y. Fourniols, M. Rocca, F. Caignet, and E. Sicard. "Characterization of Crosstalk Noise in Submicron CMOS Integrated Circuits". IEEE Transactions on Electromagnetic Compatibility, pages 271-280, August 1998.
	33	Michael T. Goodrich , Roberto Tamassia, Dynamic Trees and Dynamic Point Location, SIAM Journal on Computing, v.28 n.2, p.612-636, April 1999  [doi>10.1137/S0097539793254376]
	34	F.O. Hadlock. A shortest path algorithm for grid graphs. Networks, 7(4):323-334, 1977.
	35	Soha Hassoun, Fine grain incremental rescheduling via architectural retiming, Proceedings of the 11th international symposium on System synthesis, p.158-163, December 02-04, 1998, Hsinchu, Taiwan, China
	36	A. Hetzel, A sequential detailed router for huge grid graphs, Proceedings of the conference on Design, automation and test in Europe, p.332-339, February 23-26, 1998, Le Palais des Congrés de Paris, France
	37	K.C. Ho and S.B.K. Vridhula. "Interval Graph Algorithms for Two-Dimensional Multiple Folding of Array- Based VLSI Layouts". IEEE Transactions on Computer Aided Design, 13(10):1201-1222, October 1994.
	38	J.P.Cohoon. "Distributed Genetic Algorithms for the Floorplan Design Problem". IEEE Transactions on Computer Aided Design, 10(4):483-492, April 1991.
	39	George Karypis , Rajat Aggarwal , Vipin Kumar , Shashi Shekhar, Multilevel hypergraph partitioning: application in VLSI domain, Proceedings of the 34th annual conference on Design automation, p.526-529, June 09-13, 1997, Anaheim, California, United States  [doi>10.1145/266021.266273]
	40	G. Karypis and V. Kumar. "METIS 3.0: Unstructured Graph Partitioning and Sparse Matrix Ordering System". In Technical Report 97-061. Department of Computer Science, University of Minnesota, 1997.
	41	George Karypis , Vipin Kumar, Multilevel k-way hypergraph partitioning, Proceedings of the 36th ACM/IEEE conference on Design automation, p.343-348, June 21-25, 1999, New Orleans, Louisiana, United States  [doi>10.1145/309847.309954]
	42	I. Kato, S. Ohhira, and Y. Hisatomi. A method of pattern data management of PWB layout system. In Proc. 35th Annual Convention IPS Japan, pages 2429-2430, 1987.
	43	K. Kawamura, T. Shindo, T. Shibuya, H. Miwatari, and Y. Ohki. Touch and cross router. In Proc. of IEEE Conference on Computer-Aided Design, pages 56-59, Nov 1990.
	44	Kurt Keutzer , A. Richard Newton , Narendra Shenoy, The future of logic synthesis and physical design in deep-submicron process geometries, Proceedings of the 1997 international symposium on Physical design, p.218-224, April 14-16, 1997, Napa Valley, California, United States  [doi>10.1145/267665.267725]
	45	J. M. Kleinhans, G. Sigl, F. M. Johannes, and K. J. Antreich. "GORDIAN: VLSI Placement by Quadratic Programming and Slicing Optimization". IEEE Transactions on Computer Aided Design, 10(3):365-365, 1991.
	46	Ralph-Michael Kling , Prithviraj Banerjee, Optimization by simulated evolution with applications to standard cell placement, Proceedings of the 27th ACM/IEEE conference on Design automation, p.20-25, June 24-27, 1990, Orlando, Florida, United States  [doi>10.1145/123186.123193]
	47	E.S. Kuh and T. Ohtsuki. Recent advances in VLSI layout. Proc. of the IEEE, 78(2):237-263, Feb 1990.
	48	C.Y. Lee. An algorithm for path connections and its applications. IRE Trans Electronic Computers, EC- 10:346-365, 1961.
	49	Jin-fuw Lee , Donald T. Tang, An algorithm for incremental timing analysis, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.696-701, June 12-16, 1995, San Francisco, California, United States  [doi>10.1145/217474.217613]
	50	Thomas Lengauer, Combinatorial algorithms for integrated circuit layout, John Wiley & Sons, Inc., New York, NY, 1990
	51	T. Lengauer and M. Lugering. "Integer Programming Formulation of Global Routing and Placement Problems". World Sceintific, 1993. Special volume on Algorithm Aspects of VLSI Layout, (M. Sarrafzadeh and D. T. Lee eds.).
	52	Y.-L. Lin, Y.-C. Hsu, and F.-S. Tsai. Silk: a simulated evolution router. IEEE Transactions on Computer- Aided Design, 8(10), Oct 1989.
	53	Le-Chin Eugene Liu , Hsiao-Ping Tseng , Carl Sechen, Chip-level area routing, Proceedings of the 1998 international symposium on Physical design, p.197-204, April 06-08, 1998, Monterey, California, United States  [doi>10.1145/274535.274564]
	54	Maogang Wang , Xiaojian Yang , Kenneth Eguro , Majid Sarrafzadeh, Multi-center congestion estimation and minimization during placement, Proceedings of the 2000 international symposium on Physical design, p.147-152, May 2000, San Diego, California, United States  [doi>10.1145/332357.332391]
	55	E. Macii, M. Pedram, and F. Somenzi. "High-Level Power Modeling, Estimation, and Optimization". IEEE Transactions on Computer Aided Design, pages 1061- 1079, November 1998.
	56	A. Margarino, A. Romano, A. De Gloria, F. Curatelli, and P. Antognetti. A tile-expansion router. IEEE Trans. Computer-Aided Design, CAD-6(4):507- 517, Jul 1987.
	57	Larry McMurchie , Carl Ebeling, PathFinder: a negotiation-based performance-driven router for FPGAs, Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays, p.111-117, February 12-14, 1995, Monterey, California, United States  [doi>10.1145/201310.201328]
	58	Giovanni De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill Higher Education, 1994
	59	T. Ohtsuki. Gridless routers new wire routing algorithms based on computational geometry. In Proc. International Conference of Circuits and Systems, 1985.
	60	Ralph H. J. M. Otten, Global wires: harmful?, Proceedings of the 1998 international symposium on Physical design, p.104-109, April 06-08, 1998, Monterey, California, United States  [doi>10.1145/274535.274550]
	61	Ralph H. J. M. Otten , Robert K. Brayton, Planning for performance, Proceedings of the 35th annual conference on Design automation, p.122-127, June 15-19, 1998, San Francisco, California, United States  [doi>10.1145/277044.277071]
	62	J.K. Ousterhout. Corner stitching: a data-structuring technique for VLSI layout tools. IEEE Trans. Computer-Aided Design, CAD-3(1):87-100, Jan 1984.
	63	Alex Pothen , Horst D. Simon , Kan-Pu Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM Journal on Matrix Analysis and Applications, v.11 n.3, p.430-452, Jul. 1990  [doi>10.1137/0611030]
	64	G. Ramalingam , J. van Leeuwen , J. Hartmanis , G. Goos, Bounded Incremental Computation, Springer-Verlag New York, Inc., Secaucus, NJ, 1996
	65	Srilata Raman , C. L. Liu , L. G Jones, A Timing-Constrained Incremental Routing Algorithm for Symmetrical FPGAs, Proceedings of the 1996 European conference on Design and Test, p.170, March 11-14, 1996
	66	C. P. Ravikumar , R. Aggarwal , C. Sharma, A Graph-Theoretic Approach for Register File Based Synthesis, Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications, p.118, January 04-07, 1997
	67	M. Rebaudengo and M. S. Reorda. "GALLO: A Genetic Algorithm for Floorplan Area Optimization". IEEE Transactions on Computer Aided Design, 15, 1996.
	68	P.J. Restle, K.A. Jenkins, A. Deutsch, and P.W. Cook. "Measurement and Modeling of On-Chip Transmission Line Effects in a 400 Mhz Microprocessor". IEEE Journal of Solid-State Circuits, pages 662-665, April 1998.
	69	Majid Sarrafzadeh , M. Sarrafzadeh , C. K. Wong, An Introduction to VLSI Physical Design, McGraw-Hill Higher Education, 1996
	70	M. Sato, J. Sakanaka, and T. Ohtsuki. A fast line-search method based on a tile plane. In IEEE International Symposium on Circuits and Systems, pages 588-591, May 1987.
	71	H.-F. S.Chen and D.T. Lee. "On Crossing Minimization Problem". IEEE Transactions on Computer Aided Design, pages 406-418, May 1998.
	72	Naveed A. Sherwani, Algorithms for VLSI Physcial Design Automation, Kluwer Academic Publishers, Norwell, MA, 1998
	73	H. Shin and C. Kim. "A Simple Yet Effective Technique For Partitioning". IEEE Transactions on VLSI Systems, 1(3), 1993.
	74	J. Soukup, Fast maze router, Proceedings of the 15th conference on Design automation, p.100-102, June 19-21, 1978, Las Vegas, Nevada, United States
	75	D.L. Springer and D.E. Thomas. "Exploiting the Special Structure Conflict and Compatibility Graphs in high-Level Synthesis". IEEE Transactions on Computer Aided Design, 13(7):843-856, July 1994.
	76	L. Stok , D. S. Kung , D. Brand , A. D. Drumm , L. N. Reddy , N. Hieter , D. J. Geiger , H. H. Chao , P. J. Osler , A. J. Sullivan, BooleDozer: logic synthesis for ASICs, IBM Journal of Research and Development, v.40 n.4, p.407-430, July 1996
	77	G. Swamy, S. Rajamani, C. Lennard, and R.K. Brayton. "Minimal Logic Resynthesis for Engineering Change". In International Symposium on Circuits and Systems, pages i1596-1599. IEEE, 1997.
	78	Gitanjali Swamy , Robert K. Brayton , Vigyan Singhal, Incremental methods for FSM traversal, Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors, p.590, October 02-04, 1995
	79	Kevin T. Tang , Eby G. Friedman, Interconnect coupling noise in CMOS VLSI circuits, Proceedings of the 1999 international symposium on Physical design, p.48-53, April 12-14, 1999, Monterey, California, United States  [doi>10.1145/299996.300020]
	80	A. Vittal and M. Marek-Sadowska. "Crosstalk Reduction for VLSI". IEEE Transactions on Computer Aided Design, pages 290-298, March 1997.
	81	Maogang Wang , Majid Sarrafzadeh, On the behavior of congestion minimization during placement, Proceedings of the 1999 international symposium on Physical design, p.145-150, April 12-14, 1999, Monterey, California, United States  [doi>10.1145/299996.300044]
	82	P. Widmayer. On graphs preserving rectilinear shortest paths in the presence of obstacles. Annals of Operations Research, 33(1-4):557-75, Dec 1991.
	83	S. Wimer, I. Koren, and I. Cederbaum. "Optimal Aspect Ratios of Building Blocks in VLSI". IEEE Transactions on Computer Aided Design, 8(2):139-145, 1989.
	84	D. F. Wong , H. W. Leong , C. L. Liu, Simulated annealing for VLSI design, Kluwer Academic Publishers, Norwell, MA, 1988
	85	Ying-Fung Wu , Peter Widmayer , Martine D. F. Schlag , C. K. Wong, Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles, IEEE Transactions on Computers, v.36 n.3, p.321-331, March 1987  [doi>10.1109/TC.1987.1676904]
	86	S.Q. Zheng, Joon Shink Lim, and S.S. Iyengar. Finding obstacle-avoiding shortest paths using implicit connection graphs. IEEE Trans. Computer-Aided Design, 15(1):103-110, Jan 1996.
	87	J. Zhu and M. Abd-El-Barr. "On the Optimization of CMOS Circuits". IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 40(6):412-422, June 1993.

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski