Pages that link to "Item:Q3334981"
From MaRDI portal
The following pages link to Optimal orientations of cells in slicing floorplan designs (Q3334981):
Displaying 21 items.
- On the approximability of two tree drawing conventions (Q294876) (← links)
- Cut equivalence of \(d\)-dimensional guillotine partitions (Q397169) (← links)
- On the optimality of the ideal right-angled 24-cell (Q691534) (← links)
- On area-efficient drawings of rectangular duals for VLSI floor-plan (Q802889) (← links)
- An approximation algorithm for dissecting a rectangle into rectangles with specified areas (Q869574) (← links)
- Constructing maximal slicings from geometry (Q1088412) (← links)
- Floorplan design of VLSI circuits (Q1113879) (← links)
- Optimal cutting directions and rectangle orientation algorithm (Q1303735) (← links)
- Dynamic expression trees (Q1346771) (← links)
- A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199) (← links)
- Complexity and approximability results for slicing floorplan designs. (Q1399599) (← links)
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- Arthur and Merlin as Oracles (Q3599130) (← links)
- Maximum weight matching and genetic algorithm for fixed-shape facility layout problem (Q3605401) (← links)
- Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach (Q4031971) (← links)
- An optimal algorithm for layered wheel floorplan designs (Q4262697) (← links)
- Integrated design of the block layout and aisle structure by simulated annealing (Q4468884) (← links)
- Subclasses of Baxter Permutations Based on Pattern Avoidance (Q5740186) (← links)
- Projected model counting: beyond independent support (Q6160911) (← links)
- Rounding meets approximate model counting (Q6535531) (← links)
- Mapping tree-structured combinatorial optimization problems onto parallel computers (Q6560206) (← links)
