 | 2009 |
| 13 |  | David Emms,
Richard C. Wilson,
Edwin R. Hancock:
Graph matching using the interference of discrete-time quantum walks.
Image Vision Comput. 27(7): 934-949 (2009) |
| 12 |  | David Emms,
Richard C. Wilson,
Edwin R. Hancock:
Graph matching using the interference of continuous-time quantum walks.
Pattern Recognition 42(5): 985-1002 (2009) |
| 11 |  | David Emms,
Simone Severini,
Richard C. Wilson,
Edwin R. Hancock:
Coined quantum walks lift the cospectrality of graphs and trees.
Pattern Recognition 42(9): 1988-2002 (2009) |
| 10 |  | David Emms,
Richard C. Wilson,
Edwin R. Hancock:
Erratum to: Graph matching using the interference of continuous-time quantum walks [Pattern Recognition 42 (5) 985-1002].
Pattern Recognition 42(9): 2218 (2009) |
| 2008 |
| 9 |  | David Emms,
Edwin R. Hancock,
Richard C. Wilson:
Graph drawing using quantum commute time.
ICPR 2008: 1-4 |
| 8 |  | David Emms,
Richard C. Wilson,
Edwin R. Hancock:
Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks.
SSPR/SPR 2008: 5-14 |
| 2007 |
| 7 |  | David Emms,
Edwin R. Hancock,
Richard C. Wilson:
Graph Similarity Using Interfering Quantum Walks.
CAIP 2007: 823-831 |
| 6 |  | David Emms,
Richard C. Wilson,
Edwin R. Hancock:
Graph Embedding Using Quantum Commute Times.
GbRPR 2007: 371-382 |
| 5 |  | David Emms,
Edwin R. Hancock,
Richard C. Wilson:
A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk.
GbRPR 2007: 81-91 |
| 2006 |
| 4 |  | David Emms,
Edwin R. Hancock,
Richard C. Wilson:
Graph Matching using Interference of Coined Quantum Walks.
ICPR (3) 2006: 133-136 |
| 3 |  | David Emms,
Edwin R. Hancock,
Simone Severini,
Richard C. Wilson:
A Matrix Representation of Graphs and its Spectrum as a Graph Invariant.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
| 2 |  | David Emms,
Simone Severini,
Richard C. Wilson,
Edwin R. Hancock:
Coined Quantum Walks Lift the Cospectrality of Graphs and Trees.
EMMCVPR 2005: 332-345 |
| 1 |  | David Emms,
Simone Severini,
Richard C. Wilson,
Edwin R. Hancock:
Towards Unitary Representations for Graph Matching.
GbRPR 2005: 153-161 |