1. Marshals, monotone marshals, and hypertree-width;Adler;Journal of Graph Theory,2004
2. I. Adler, A note on monotonicity cost on hypergraphs, 2005. Unpublished note
3. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition;Cohen,2005
4. Hypertree decompositions: Structure, algorithms, and applications;Gottlob,2005
5. A comparison of structural CSP decomposition methods;Gottlob;Artificial Intelligence,2000