Treewidth : Algorithmic techniques and results

@inproceedings{Bodlaender1998TreewidthA,
  title={Treewidth : Algorithmic techniques and results},
  author={Hans L. Bodlaender},
  year={1998}
}
This paper gives an overview of several results and techniques for graphs algorithms that compute the treewidth of a graph or that solve otherwise intractable problems when restricted graphs with bounded treewidth more e ciently. Also, several results on graph minors are reviewed. 
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS