| 2008 |
| 20 | EE | Horst Bunke,
Peter J. Dickinson,
Miro Kraetzl,
Michel Neuhaus,
Marc Stettler:
Matching of Hypergraphs - Algorithms, Applications, and Experiments.
Applied Pattern Recognition 2008: 131-154 |
| 2007 |
| 19 | EE | Kaspar Riesen,
Michel Neuhaus,
Horst Bunke:
Bipartite Graph Matching for Computing the Edit Distance of Graphs.
GbRPR 2007: 1-12 |
| 18 | EE | Kaspar Riesen,
Michel Neuhaus,
Horst Bunke:
Graph Embedding in Vector Spaces by Means of Prototype Selection.
GbRPR 2007: 383-393 |
| 17 | EE | Michel Neuhaus,
Horst Bunke:
A Quadratic Programming Approach to the Graph Edit Distance Problem.
GbRPR 2007: 92-102 |
| 16 | EE | Michel Neuhaus,
Horst Bunke:
Automatic learning of cost functions for graph edit distance.
Inf. Sci. 177(1): 239-247 (2007) |
| 2006 |
| 15 | EE | Barbara Spillmann,
Michel Neuhaus,
Horst Bunke:
Multiple Classifier Systems for Embedded String Patterns.
ANNPR 2006: 177-187 |
| 14 | EE | Michel Neuhaus,
Horst Bunke:
A Convolution Edit Kernel for Error-tolerant Graph Matching.
ICPR (4) 2006: 220-223 |
| 13 | EE | Michel Neuhaus,
Kaspar Riesen,
Horst Bunke:
Fast Suboptimal Algorithms for the Computation of Graph Edit Distance.
SSPR/SPR 2006: 163-172 |
| 12 | EE | Michel Neuhaus,
Horst Bunke:
A Random Walk Kernel Derived from Graph Edit Distance.
SSPR/SPR 2006: 191-199 |
| 11 | EE | Barbara Spillmann,
Michel Neuhaus,
Horst Bunke,
Elzbieta Pekalska,
Robert P. W. Duin:
Transforming Strings to Vector Spaces Using Prototype Selection.
SSPR/SPR 2006: 287-296 |
| 10 | EE | Michel Neuhaus,
Horst Bunke:
Edit distance-based kernel functions for structural pattern classification.
Pattern Recognition 39(10): 1852-1863 (2006) |
| 2005 |
| 9 | EE | Michel Neuhaus,
Horst Bunke:
A Graph Matching Based Approach to Fingerprint Classification Using Directional Variance.
AVBPA 2005: 191-200 |
| 8 | EE | Michel Neuhaus,
Horst Bunke:
Edit Distance Based Kernel Functions for Attributed Graph Matching.
GbRPR 2005: 352-361 |
| 7 | EE | Horst Bunke,
Christophe Irniger,
Michel Neuhaus:
Graph Matching - Challenges and Potential Solutions.
ICIAP 2005: 1-10 |
| 6 | EE | Michel Neuhaus,
Horst Bunke:
Graph-Based Multiple Classifier Systems A Data Level Fusion Approach.
ICIAP 2005: 479-486 |
| 5 | EE | Michel Neuhaus,
Horst Bunke:
Self-organizing maps for learning the edit costs in graph matching.
IEEE Transactions on Systems, Man, and Cybernetics, Part B 35(3): 503-514 (2005) |
| 2004 |
| 4 | EE | Michel Neuhaus,
Horst Bunke:
A Probabilistic Approach to Learning Costs for Graph Edit Distance.
ICPR (3) 2004: 389-393 |
| 3 | EE | Michel Neuhaus,
Horst Bunke:
An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification.
SSPR/SPR 2004: 180-189 |
| 2 | EE | Peter J. Dickinson,
Miro Kraetzl,
Horst Bunke,
Michel Neuhaus,
Arek Dadej:
Similarity Measures For Hierarchical Representations Of Graphs With Unique Node Labels.
IJPRAI 18(3): 425-442 (2004) |
| 2003 |
| 1 | EE | Michel Neuhaus,
Horst Bunke:
Self-Organizing Graph Graph Edit Distance.
GbRPR 2003: 83-94 |