Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
Erik D. Demaine
and MohammadTaghi Hajiaghayi
Proc. 12th Int. Symp. Graph Drawing (GD 2004), Lecture Notes in Computer Science 3383, János Pach, ed., Springer-Verlag, 2004, pp. 517–533
Cites:
