On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design