1. Dieter Fensel, James A. Hendler, H. Lieberman, and Wolfgang Wahlster. Spinning the semantic Web : bringing the World Wide Web to its full potential. MIT Press, Cambridge, Mass., 2002.
   Note: 2002016503 edited by Dieter Fensel ... [et al.]. Includes bibliographical references and index.
   Keywords: Graph theory, honours reading, Semantic Web. [bibtex-entry]



2. David Basin. Labelled deduction, Applied logic series ; v. 17. Kluwer Academic Publishers, Dordrecht ; Boston, 2000.
   Note: Edited by David Basin ... [et al.] ill. ; 25 cm.
   Keywords: model theory, proof theory, graph theory, honours reading. [bibtex-entry]



3. Rod Downey and Michael R. Fellows. Parameterized complexity, Monographs in computer science.. Springer, New York, 1999.
   Note: R.G. Downey, M.R. Fellows. New Zealand authors. Includes bibliographical references (p. [489]-516) and index.
   Keywords: computational complexity, graph theory, honours reading. [bibtex-entry]



4. Kim Marriott and P. J. Stuckey. Programming with constraints : an introduction. MIT Press, Cambridge, Mass., 1998.
   Note: 97040549 Kim Marriott and Peter J. Stuckey. Includes bibliographical references and index. 1. Constraints -- 2. Simplification, Optimization and Implication -- 3. Finite Constraint Domains -- 4. Constraint Logic Programs -- 5. Simple Modelling -- 6. Using Data Structures -- 7. Controlling Search -- 8. Modelling with Finite Domain Constraints -- 9. Advanced Programming Techniques -- 10. CLP Systems -- 11. Constraint Databases -- 12. Other Constraint Programming Languages.
   Keywords: logic programming, constraint satisfaction, graph theory, honours reading. [bibtex-entry]



5. Alan Gibbons. Algorithmic graph theory. Cambridge University Press, Cambridge ; New York, 1985.
   Note: Alan Gibbons. Includes bibliographies and indexes.
   Keywords: graph theory, theory of computation, computational complexity, honours reading. [bibtex-entry]

1. Yolanda Gil. Description logics and planning. AI Magazine, 26(2):73--84, 2005.
   Keywords: graph theory, ontologies, honours reading. [bibtex-entry]



2. M. T. Haijiaghayi, M. Bahramgiri, and V. S. Mirrokni. Fault-tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. ACM/Kluwer Wireless Networks, 2005.
   Note: 11th IEEE International Conference on Computer Communications and Networks, October, 2002, pp. 392-398.
   Keywords: sensor networks, honours reading, graph theory. [bibtex-entry]



3. 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]



4. M. T. Hajiaghayi, E. D. Demaine, N. Nishimura, P. Ragde, and D. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Journal of Computer and System Sciences, 69(2):166--195, 2004.
   Keywords: graph matching, honours reading, graph theory. [bibtex-entry]



5. Carla Piazza and ALBERTO POLICRITI. Ackermann encoding, bisimulations and OBDDs. Theory and Practice of Logic Programming, 4:695--718, 2004.
   Keywords: graph theory, model theory, honours reading. [abstract] [bibtex-entry]



6. JAcob Toran. On the hardness of graph isomorphism. SIAM J. Comput, 33(3):1093--1108, 2004.
   Keywords: graph theory, computational complexity, honours reading. [bibtex-entry]



7. A. Dovier and C. Piazza. The Subgraph Bisimulation Problem. IEEE Transactions on Knowledge & Data Engineering, 15(4):1055--6, 2003.
   Note: Publisher: IEEE, USA.
   Keywords: graph theory, model theory, honours reading, graph matching. [abstract] [bibtex-entry]



8. W. de Vries, F. S. de Boer, K. Hindriks, W. van der Hoek, and J. J. C. Meyer. A programming language for coordinating group actions. In From Theory to Practice in Multi-Agent Systems, volume 2296 of Lecture Notes in Artificial Intelligence, pages 313--321. 2002.
   Keywords: agent programming languages, multiagent coordination, graph theory, constraint satisfaction, honours reading. [abstract] [download paper ] [bibtex-entry]



9. D. V. Pynadath and M. Tambe. The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models. Journal of Artificial Intelligence Research, 16:389--423, 2002.
   Keywords: computational complexity, teamwork, Markov theory, graph theory, agent communication languagess, honours reading. [abstract] [bibtex-entry]



10. 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]



11. A. R. Pearce and T. Caelli. Interactively matching hand-drawings using induction. Computer Vision and Image Understanding, 73(3):391--403, 1999.
    Keywords: machine learning, graph theory, agentlab. [abstract] [download paper ] [bibtex-entry]



12. A. R. Pearce and T. Caelli. Relational Evidence Theory and Schematic Interpretation. In T. Caelli and W. F. Bischof, editors,Machine Learning and Image Interpretation, pages 67--118. New York, USA, 1997.
    Keywords: graph theory, inductive logic programming, agentlab. [download paper ] [bibtex-entry]



13. W. Peter van Gabbeek, Rob J.Weijland. Branching Time and Abstraction in Bisimulation Semantics. Journal of the Association for Computing Machinery, 43(3):555--600, 1996.
    Keywords: model theory, graph theory, honours reading. [bibtex-entry]



14. R. J. van Glabbeek and W. Peter Weijland. Branching time and abstraction in bisimulation semantics. J. ACM, 43(3):555--600, 1996.
    Keywords: model theory, honours reading, graph theory, graph matching. [bibtex-entry]



15. A. R. Pearce, T. Caelli, and W. F. Bischof. Rulegraphs for graph matching in pattern recognition. Pattern Recognition, 27(9):1231--47, 1994.
    Keywords: graph theory, machine learning, agentlab. [abstract] [download paper ] [bibtex-entry]



16. A. R. Pearce, T. Caelli, and W. F. Bischof. Learning relational structures: applications in computer vision. Applied Intelligence, 4(3):257--68, 1994.
    Note: Netherlands.
    Keywords: graph theory, machine learning, agentlab. [abstract] [download paper ] [bibtex-entry]



17. David Eppstein. Connectivity, graph minors, and subgraph multiplicity. Journal of Graph Theory, 17:409--416, 1993.
    Keywords: graph theory, graph matching, honours reading. [bibtex-entry]



18. L. Stockmeyer. Planar 3-colorability is polynomial complete.. SIGACT News,, 5(3):19--25, 1973.
    Keywords: graph theory, computational complexity, honours reading. [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]



2. Susannah Soon, Adrian Pearce, and Max Noble. Adaptive Teamwork Coordination using Graph Matching over Hierarchical Intentional Structures. In Nicholas R. Jennings, Carles Sierra, Liz Sonenberg, and Milind Tambe, editors, International Conference on Autonomous Agents and Multi Agent Systems (AAMAS), New York, pages 294--301, 2004.
   Keywords: agentlab, agent programming languages, graph theory, honours reading, teamwork, coordination. [bibtex-entry]



3. MohammadTaghi Hajiaghayi and Naomi Nishimura. Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. In Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, Warsaw, Poland, August , appears in Lecture Notes in Computer Science, Vol 2420, volume 2420, pages 305--318, 2002.
   Keywords: graph matching, honours reading, graph theory. [abstract] [bibtex-entry]



4. A. R. Pearce and T. Caelli. The CLARET Algorithm. In Research and Development in Knowledge Discovery and Data Mining, Lecture Notes in Artificial Intelligence, volume 1394, pages 407--408, 1998. Springer-Verlag.
   Keywords: graph theory, machine learning, inductive logic programming, agentlab. [bibtex-entry]



5. Adrian Pearce, Terry Caelli, and Walter Bischof. CLARET: A new Relational Learning Algorithm for Interpretation in Spatial Domains. In Proceedings of the Fourth International Conference on Control, Automation, Robotics and Vision (ICARV'96), Singapore, pages 650--654, 1996.
   Keywords: graph theory, machine learning, inductive logic programming, agentlab. [bibtex-entry]



6. Adrian Pearce, Terry Caelli, and Walter Bischof. Rulegraphs for Pattern Recognition. In Proceedings of the First Asian Conference on Computer Vision 1993 (ACCV93); Osaka, Japan, pages 79--82, 1993.
   Keywords: graph theory, machine learning, agentlab. [bibtex-entry]



7. Adrian Pearce, Terry Caelli, and Walter Bischof. Learning Relational Structures for 2D Pattern and 3D Object Recognition. In Proceedings of the Australian and New Zealand conference on Intelligent Information Systems 1993 (ANZIIS93); Perth , Western Australia, pages 50--54, 1993.
   Keywords: graph theory, machine learning, agentlab. [bibtex-entry]

1. Daniel Marx. Graph coloring with local and global constraints. PhD thesis, Budapest University of Technology and Economics, 2004.
   Keywords: honours reading, graph theory. [bibtex-entry]



2. Mohammad Taghi Hajiaghayi. Algorithms for Graphs of (Locally) Bounded Treewidth. PhD thesis, University of Waterloo, 2001.
   Keywords: graph matching, graph theory, algorithms, honours reading. [bibtex-entry]

1. R. B. Borie, R. Gary Parker, and C. A. Tovey. Solving problems on recursively constructed graphs. Technical Report TR-2002-04, Dept. Comp. Sci., University of Alabama, 2002.
   Keywords: graph theory, algorithms, computational complexity, honours reading. [bibtex-entry]



2. Hans Leo Bodlaender. Treewidth: algorithmic techniques and results. Technical Report Tech. report UU-CS-1997-31, 1997, Univ. Utrecht, Dept. of Computer Science, 1997.
   Keywords: graph theory, honours reading. [download paper ] [bibtex-entry]



3. Kim Shearer, Horst Bunke, Svetha Venkatesh, and Dorota Kieronska. Efficient graph mathicng for video indexing. Technical Report 1997, Department of Computer Science, Curtin University, 1997.
   Keywords: graph theory, honours reading. [bibtex-entry]



4. H. Bunke and B. T. Messmer. Recent Advances in Graph Matching. Technical Report 1996, Institut fur Informatik und angewandte Mathematik, University of Bern, 1996.
   Keywords: graph theory, 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.