Research Interests Publications CV Contact Information


 
Matthew Kitching

My current position is at the Advanced Mission Concepts and Technologies Office of the European Space Agency in Darmstadt, Germany. Prior to this, I was a PhD student in the knowledge representation group at the University of Toronto.

 
 
 

Research Interests

  
 


I am interested in Constraint Satisfaction Problems (CSP), Constraint Optimization Problems (COP), #CSP and QCSP. In particular, I am working on partitioning, caching, variable ordering heuristics and minibuckets in CSP and COP's, and #CSP.

Publications
  • Exploiting Decomposition on Constraint Problems with High Tree-Width (pdf paper)
    M. Kitching and F. Bacchus
    to appear in IJCAI 2009 (21st International Joint Conference on Artificial Intelligence), 2009.

  • Set Branching in Constraint Optimization (pdf paper)
    M. Kitching and F. Bacchus
    to appear in IJCAI 2009 (21st International Joint Conference on Artificial Intelligence), 2009.

  • Exploiting Decomposition in Constraint Optimization Problems (pdf paper)
    M. Kitching and F. Bacchus
    published in CP 2008 (The 14th International Conference on Principles and Practice of Constraint Programming), 2008.

  • Using EM to Find Likely Assignments for Solving CSP's (pdf paper)
    E. Hsu, M. Kitching, F. Bacchus, and S. McIlraith
    published in IJCAI 2007 (20th International Joint Conference on Artificial Intelligence), 2007.

  • Symmetric component caching (pdf paper)
    M. Kitching and F. Bacchus
    published in IJCAI 2007 (20th International Joint Conference on Artificial Intelligence), 2007.

  • A fixed-parameter approach to two-layer planarization (pdf paper)
    V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides and D.R. Wood.
    published in Algorithmica, 45:159-182, 2006


  • The three dimensional logic engine (pdf paper)
    M. Kitching and S. Whitesides
    published in GD 2004 (12th International Symposium on Graph Drawing), 2004.


  • A fixed-parameter approach to two layer planarization (pdf paper)
    V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides and D.R. Wood
    published in GD 2001 (9th International Symposium on Graph Drawing), 2001.

  • On the parameterized complexity of layered graph drawing (pdf paper)
    V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides and D.R. Wood
    published in ESA 2001 (9th Annual European Symposium on Algorithms), 2001.



CV

(pdf), (ps) (last updated June, 2010)

Contact Information
Office Location:
   Pratt Building, 6 King's College Road, University of Toronto
Mailing Adress:
   University of Toronto, Dept. of Computer Science, Pratt Building, Room 283, 6 King's College Road, Toronto, ON M5S 3H5, CANADA
E-mail address:
   kitching[at]cs[dot]toronto[dot]edu
 
Links
DCS Webmail access
Constraint Programming Online