The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matthew Kitching: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  2. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    A Fixed-Parameter Approach to Two-Layer Planarization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  3. Matthew Kitching, Sue Whitesides
    The Three Dimensional Logic Engine. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:329-339 [Conf]
  4. Matthew Kitching, Fahiem Bacchus
    Symmetric Component Caching. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:118-124 [Conf]
  5. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    A Fixed-Parameter Approach to 2-Layer Planarization. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  6. Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, Sheila A. McIlraith
    Using Expectation Maximization to Find Likely Assignments for Solving CSP's. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:224-230 [Conf]

  7. Exploiting Decomposition in Constraint Optimization Problems. [Citation Graph (, )][DBLP]


  8. Set Branching in Constraint Optimization. [Citation Graph (, )][DBLP]


  9. Exploiting Decomposition on Constraint Problems with High Tree-Width. [Citation Graph (, )][DBLP]


  10. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002