Myhill–Nerode Methods for Hypergraphs

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

(2012) Michael R. Fellows et al.   EUROPEAN JOURNAL OF COMBINATORICS

Approximating fractional hypertree width

(2010) Dániel Marx   ACM Transactions on Algorithms

Solving problems on recursively constructed graphs

(2009) Richard B. Borie et al.   ACM COMPUTING SURVEYS

On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width

(2009) Robert Ganian et al.   DISCRETE APPLIED MATHEMATICS

Generalized hypertree decompositions: NP-hardness and tractable variants

(2009) Georg Gottlob et al.   JOURNAL OF THE ACM

Derivation of algorithms for cutwidth and related graph layout parameters

(2008) Hans L. Bodlaender et al.   JOURNAL OF COMPUTER AND SYSTEM SCIENCES