 | 2009 |
|---|
| 10 |       | Matthew Kitching,
Fahiem Bacchus:
Exploiting Decomposition on Constraint Problems with High Tree-Width.
IJCAI 2009: 525-531 |
| 9 | | Matthew Kitching,
Fahiem Bacchus:
Set Branching in Constraint Optimization.
IJCAI 2009: 532-537 |
| 2008 |
|---|
| 8 | | Matthew Kitching,
Fahiem Bacchus:
Exploiting Decomposition in Constraint Optimization Problems.
CP 2008: 478-492 |
| 7 | | Vida Dujmovic,
Michael R. Fellows,
Matthew Kitching,
Giuseppe Liotta,
Catherine McCartin,
Naomi Nishimura,
Prabhakar Ragde,
Frances A. Rosamond,
Sue Whitesides,
David R. Wood:
On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica 52(2): 267-292 (2008) |
| 2007 |
|---|
| 6 |  | Eric I. Hsu,
Matthew Kitching,
Fahiem Bacchus,
Sheila A. McIlraith:
Using Expectation Maximization to Find Likely Assignments for Solving CSP's.
AAAI 2007: 224-230 |
| 5 | | Matthew Kitching,
Fahiem Bacchus:
Symmetric Component Caching.
IJCAI 2007: 118-124 |
| 2006 |
|---|
| 4 | | 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.
Algorithmica 45(2): 159-182 (2006) |
| 2004 |
|---|
| 3 | | Matthew Kitching,
Sue Whitesides:
The Three Dimensional Logic Engine.
Graph Drawing 2004: 329-339 |
| 2001 |
|---|
| 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:
On the Parameterized Complexity of Layered Graph Drawing.
ESA 2001: 488-499 |
| 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:
A Fixed-Parameter Approach to Two-Layer Planarization.
Graph Drawing 2001: 1-15 |
