"On the complexity of graph cuboidal dual problems for 3-D floorplanning of ..."

Renshen Wang, Chung-Kuan Cheng (2009)

> Home

Details and statistics

DOI: 10.1145/1531542.1531604

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/glvlsi/WangC09a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/glvlsi/WangC09a
Renshen Wang, Chung-Kuan Cheng:
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design. ACM Great Lakes Symposium on VLSI 2009: 257-262

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.