Papers

Francesco Scarcello: Query answering exploiting structural properties. SIGMOD Record 34(3): 91-99 (2005) [Download: updated version]

Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, and Francesco Scarcello: Hypertree Decompositions: Structure, Algorithms, and Applications, Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Lecture Notes in Computer Science (2005) [Download: preprint version]

Francesco Scarcello, Gianluigi Greco, Nicola Leone: Weighted Hypertree Decompositions and Optimal Query Plans. Proc. of  PODS 2004 [Download]

Georg Gottlob, Nicola Leone, Francesco Scarcello: Hypertree Decompositions and Tractable Queries. J. Comput. Syst. Sci. 64(3): 579-627 (2002) (short version: Proc. of  PODS 1999) [Download: preprint version, zipped]

Georg Gottlob, Nicola Leone, Francesco Scarcello: Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. J. Comput. Syst. Sci. 66(4): 775-808 (2003) (short version: Proc. of  PODS 2001)  [Download: preprint version, zipped]

Georg Gottlob, Nicola Leone, Francesco Scarcello: Hypertree Decompositions: A Survey. Proc. of  MFCS 2001: 37-57

N. Leone, A. Mazzitelli, Francesco Scarcello: Cost-Based Query Decompositions. Proc. of  SEBD 2002. [Download: extended version]

Georg Gottlob, Nicola Leone, Francesco Scarcello: A comparison of structural CSP decomposition methods. Artificial Intelligence 124(2): 243-282 (2000).  [Download: preprint version]

Georg Gottlob, Nicola Leone, Francesco Scarcello: On Tractable Queries and Constraints. Proc. of  DEXA 1999: 1-15.  [Download: preprint version]

Georg Gottlob, Nicola Leone, Francesco Scarcello: The complexity of acyclic conjunctive queries. Journal of the ACM 48(3): 431-498 (2001)  [Download: preprint version]

Georg Gottlob, Reinhard Pichler: Hypergraphs in Model Checking: Acyclicity and Hypertree-width versus Clique-width. Siam Journal on Computing 33(2): 351-378, 2004 (short version: Proc. ICALP 2001:708-719)  [Download: preprint version]