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

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

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

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.