Anil Maheshwari Norbert Zeh I/O-Efficient Algorithms for Graphs of Bounded Treewidth. 413-469 2009 54 Algorithmica 3 http://dx.doi.org/10.1007/s00453-007-9131-5 db/journals/algorithmica/algorithmica54.html#MaheshwariZ09