Embedding trees in a hypercube is NP-complete

Optimal Simulation of Full Binary Trees on Faulty Hypercubes

IEEE Transactions on Parallel and Distributed Systems

On dynamic tree growing in hypercubes

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing

Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results

IEEE Transactions on Computers

Embedding graphs with bounded treewidth into their optimal hypercubes

Journal of Algorithms

Embedding Binary Trees into Crossed Cubes

IEEE Transactions on Computers

Power-efficient prefetching for embedded processors

ACM Transactions on Embedded Computing Systems (TECS)

Dense sets and embedding binary trees into hypercubes

Discrete Applied Mathematics

Scheduling trees onto hypercubes and grids is NP-complete

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

HPGRID: a new resource management architecture with its topological properties for massively parallel systems

International Journal of Computer Applications in Technology

Parity and strong parity edge-colorings of graphs

Journal of Combinatorial Optimization