1. George Gottlob, Phokion G. Kolaitis, and Thomas Schwentick. Existential second-order Logic over graphs: charting the tractability frontier. Journal of the ACM, 51(2):312--362, 2004.
   Keywords: graph theory, honours reading, computational complexity. [bibtex-entry]



2. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, vol.124, no.2:243--282, 2000.
   Keywords: agent programming languages, multiagent coordination, graph theory, constraint satisfaction, honours reading, DCOP, DCSP. [abstract] [bibtex-entry]

1. Georg Gottlob, Reinhard Pichler, and Fang Wei. Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. In AAAI, pages 613--620, 2006.
   Keywords: graph theory, computational complexity, honours reading. [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.