Hans L. Bodlaender
-
Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Graph drawings with few slopes
Computational Geometry: Theory and Applications
On tree-partition-width
European Journal of Combinatorics