DUNE

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	Semiconductor Industry Association, National Technology Roadmap for Semiconductors, 1997.
	2	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]
	3	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]
	4	Jason Cong , Patrick H. Madden, Performance driven multi-layer general area routing for PCB/MCM designs, Proceedings of the 35th annual conference on Design automation, p.356-361, June 15-19, 1998, San Francisco, California, United States [doi>10.1145/277044.277144]
	5	C. Chang and J. Cong, "Cross talk noise control in gridless general-area routing," in Proc. A CM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (TAU), pp. 117-122, Mar 1999.
	6	Chin-Chih Chang , Jason Cong, Pseudo pin assignment with crosstalk noise control, Proceedings of the 2000 international symposium on Physical design, p.41-47, May 2000, San Diego, California, United States [doi>10.1145/332357.332372]
	7	C. Lee, "An algorithm for path connections and its applications," IRE Trans Electronic Computers, vol. EC-10, pp. 346- 365, 1961.
	8	F. Hadlock, "A shortest path algorithm for grid graphs," Networks, vol. 7, no. 4, pp. 323-334, 1977.
	9	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
	10	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, pp. 588-591, May 1987.
	11	A. Margarino, A. Romano, A. De Gloria, F. Curatelli, and P. Antognetti, "A tile-expansion router," IEEE Trans. Computer- Aided Design, vol. CAD-6, pp. 507-517, Jul 1987.
	12	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]
	13	J. Ousterhout, "Corner stitching: a data-structuring technique for VLSI layout tools," IEEE Trans. Computer-Aided Design, vol. CAD-3, pp. 87-100, Jan 1984.
	14	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]
	15	T. Ohtsuki, "Gridless routers new wire routing algorithms based on computational geometry," in Proc. International Conference of Circuits and Systems, 1985.
	16	S. Q. Zheng, J. S. Lim, and S. Iyengar, "Finding obstacleavoiding shortest paths using implicit connection graphs," IEEE Trans. Computer-Aided Design, vol. 15, pp. 103-110, Jan 1996.
	17	Y.-L. Lin, Y.-C. Hsu, and F.-S. Tsai, "Silk: a simulated evolution router," IEEE Transactions on Computer-Aided Design, vol. 8, pp. 1108-1114, Oct 1989.
	18	K. Kawamura, T. Shindo, T. Shibuya, H. Miwatari, and Y. Ohki, "Touch and cross router," in Proc. of IEEE Conference on Computer-Aided Design, pp. 56-59, Nov 1990.
	19	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]
	20	E. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
	21	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
	22	J. P. Cohoon, Optimal two-terminal &agr;-&bgr; wire routing, Integration, the VLSI Journal, v.6 n.1, p.35-57, May 1988 [doi>10.1016/0167-9260(88)90017-X]
	23	J. Jaja and S. Wu, "On routing two-terminal nets in the presence of obstacles," IEEE Trans. Computer-Aided Design, vol. 8, pp. 563-570, May 1989.
	24	W. L. Schiele , Th. Krüger , K. M. Just , F. H. Kirsch, A gridless router for industrial design rules, Proceedings of the 27th ACM/IEEE conference on Design automation, p.626-631, June 24-27, 1990, Orlando, Florida, United States [doi>10.1145/123186.123422]
	25	I. Kato, S. Ohhira, and Y. Hisatomi, "A method of pattern data management of PWB layout system," in Proc. 35th Annual Convention IPS Japan, pp. 2429-2430, 1987.
	26	E. Kuh and T. Ohtsuki, "Recent advances in VLSI layout," Proc. of the IEEE, vol. 78, pp. 237-263, Feb 1990.
	27	H. Edelsbrunner, "A new approach to rectangle intersections," International Journal of Computer Mathematics, vol. 13, no. 3- 4, pp. 209-229, 1983.
	28	J. Nievergelt , F. P. Preparata, Plane-sweep algorithms for intersecting geometric figures, Communications of the ACM, v.25 n.10, p.739-747, Oct 1982 [doi>10.1145/358656.358681]