The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky. The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. In Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia, editors, Algorithms and Data Structures, 6th International Workshop, WADS 99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings. Volume 1663 of Lecture Notes in Computer Science, pages 25-36, Springer, 1999. [doi]

This author has not been identified. Look up 'Piotr Berman' in GoogleThis author has not been identified. Look up 'Andrew B. Kahng' in GoogleThis author has not been identified. Look up 'Devendra Vidhani' in GoogleThis author has not been identified. Look up 'Alexander Zelikovsky' in Google

runs on WebDSL