Self-Organizing Graph Graph Edit Distance. - Michel Neuhaus; Horst Bunke (GbRPR, 2003)

A Probabilistic Approach to Learning Costs for Graph Edit Distance. - Michel Neuhaus; Horst Bunke (ICPR (3), 2004)

An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification. - Michel Neuhaus; Horst Bunke (SSPR/SPR, 2004)

Similarity Measures For Hierarchical Representations Of Graphs With Unique Node Labels. - Peter J. Dickinson; Miro Kraetzl; Horst Bunke; Michel Neuhaus; Arek Dadej (Int. J. Pattern Recognit. Artif. Intell., 2004)

A Graph Matching Based Approach to Fingerprint Classification Using Directional Variance. - Michel Neuhaus; Horst Bunke (AVBPA, 2005)

Edit Distance Based Kernel Functions for Attributed Graph Matching. - Michel Neuhaus; Horst Bunke (GbRPR, 2005)

Graph Matching - Challenges and Potential Solutions. - Horst Bunke; Christophe Irniger; Michel Neuhaus (ICIAP, 2005)

Graph-Based Multiple Classifier Systems A Data Level Fusion Approach. - Michel Neuhaus; Horst Bunke (ICIAP, 2005)

Self-organizing maps for learning the edit costs in graph matching. - Michel Neuhaus; Horst Bunke (IEEE Trans. Syst. Man Cybern. Part B, 2005)

Multiple Classifier Systems for Embedded String Patterns. - Barbara Spillmann; Michel Neuhaus; Horst Bunke (ANNPR, 2006)

A Convolution Edit Kernel for Error-tolerant Graph Matching. - Michel Neuhaus; Horst Bunke (ICPR (4), 2006)

A Random Walk Kernel Derived from Graph Edit Distance. - Michel Neuhaus; Horst Bunke (SSPR/SPR, 2006)

Fast Suboptimal Algorithms for the Computation of Graph Edit Distance. - Michel Neuhaus; Kaspar Riesen; Horst Bunke (SSPR/SPR, 2006)

Transforming Strings to Vector Spaces Using Prototype Selection. - Barbara Spillmann; Michel Neuhaus; Horst Bunke; Elzbieta Pekalska; Robert P. W. Duin (SSPR/SPR, 2006)

Edit distance-based kernel functions for structural pattern classification. - Michel Neuhaus; Horst Bunke (Pattern Recognit., 2006)

A Quadratic Programming Approach to the Graph Edit Distance Problem. - Michel Neuhaus; Horst Bunke (GbRPR, 2007)

Bipartite Graph Matching for Computing the Edit Distance of Graphs. - Kaspar Riesen; Michel Neuhaus; Horst Bunke (GbRPR, 2007)

Graph Embedding in Vector Spaces by Means of Prototype Selection. - Kaspar Riesen; Michel Neuhaus; Horst Bunke (GbRPR, 2007)

Automatic learning of cost functions for graph edit distance. - Michel Neuhaus; Horst Bunke (Inf. Sci., 2007)

Bridging the Gap between Graph Edit Distance and Kernel Machines - Michel Neuhaus; Horst Bunke (WorldScientific, 2007)

Matching of Hypergraphs - Algorithms, Applications, and Experiments. - Horst Bunke; Peter J. Dickinson; Miro Kraetzl; Michel Neuhaus; Marc Stettler (Applied Pattern Recognition, 2008)