|
Search the dblp DataBase
Matthew Kitching:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- Matthew Kitching, Sue Whitesides
The Three Dimensional Logic Engine. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2004, pp:329-339 [Conf]
- Matthew Kitching, Fahiem Bacchus
Symmetric Component Caching. [Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:118-124 [Conf]
- 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]
- 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]
Exploiting Decomposition in Constraint Optimization Problems. [Citation Graph (, )][DBLP]
Set Branching in Constraint Optimization. [Citation Graph (, )][DBLP]
Exploiting Decomposition on Constraint Problems with High Tree-Width. [Citation Graph (, )][DBLP]
On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]
Search in 0.000secs, Finished in 0.000secs
|