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

A Family of Novel Graph Kernels for Structural Pattern Recognition. - Horst Bunke; Kaspar Riesen (CIARP, 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)

Structural Classifier Ensembles for Vector Space Embedded Graphs. - Kaspar Riesen; Horst Bunke (IJCNN, 2007)

Classifier Ensembles for Vector Space Embedding of Graphs. - Kaspar Riesen; Horst Bunke (MCS, 2007)

Reducing the Dimensionality of Vector Space Embeddings of Graphs. - Kaspar Riesen; Vivian Kilchherr; Horst Bunke (MLDM, 2007)

Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic. - Kaspar Riesen; Stefan Fankhauser; Horst Bunke (MLG, 2007)

Kernel k-Means Clustering Applied to Vector Space Embeddings of Graphs. - Kaspar Riesen; Horst Bunke (ANNPR, 2008)

An approximate algorithm for median graph computation using graph embedding. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa; Kaspar Riesen; Horst Bunke (ICPR, 2008)

An experimental study of graph classification using prototype selection. - Andreas Fischer 002; Kaspar Riesen; Horst Bunke (ICPR, 2008)

Generalized Graph Matching for Data Mining and Information Retrieval. - Alexandra Brügger; Horst Bunke; Peter J. Dickinson; Kaspar Riesen (ICDM, 2008)

On Lipschitz Embeddings of Graphs. - Kaspar Riesen; Horst Bunke (KES (1), 2008)

Recent Developments in Graph Classification and Clustering using Graph Embedding Kernels. - Horst Bunke; Kaspar Riesen (PRIS, 2008)

Non-linear Transformations of Vector Space Embedded Graphs. - Kaspar Riesen; Horst Bunke (PRIS, 2008)

Graph Classification on Dissimilarity Space Embedding. - Horst Bunke; Kaspar Riesen (SSPR/SPR, 2008)

Graph Classification Based on Dissimilarity Space Embedding. - Horst Bunke; Kaspar Riesen (SSPR/SPR, 2008)

IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning. - Kaspar Riesen; Horst Bunke (SSPR/SPR, 2008)

Feature Ranking Algorithms for Improving Classification of Vector Space Embedded Graphs. - Kaspar Riesen; Horst Bunke (CAIP, 2009)

Improving Graph Classification by Isomap. - Kaspar Riesen; Volkmar Frinken; Horst Bunke (GbRPR, 2009)

Efficient Suboptimal Graph Isomorphism. - Kaspar Riesen; Stefan Fankhauser; Horst Bunke; Peter J. Dickinson (GbRPR, 2009)

Cluster Ensembles Based on Vector Space Embeddings of Graphs. - Kaspar Riesen; Horst Bunke (MCS, 2009)

Dissimilarity Based Vector Space Embedding of Graphs Using Prototype Reduction Schemes. - Kaspar Riesen; Horst Bunke (MLDM, 2009)

Reducing the dimensionality of dissimilarity space embedding graph kernels. - Kaspar Riesen; Horst Bunke (Eng. Appl. Artif. Intell., 2009)

Graph Classification Based on Vector Space Embedding. - Kaspar Riesen; Horst Bunke (Int. J. Pattern Recognit. Artif. Intell., 2009)

Approximate graph edit distance computation by means of bipartite graph matching. - Kaspar Riesen; Horst Bunke (Image Vis. Comput., 2009)

Graph Classification by Means of Lipschitz Embedding. - Kaspar Riesen; Horst Bunke (IEEE Trans. Syst. Man Cybern. Part B, 2009)

Graph Similarity Features for HMM-Based Handwriting Recognition in Historical Documents. - Andreas Fischer 002; Kaspar Riesen; Horst Bunke (ICFHR, 2010)

Vector Space Embedding of Undirected Graphs with Fixed-cardinality Vertex Sequences for Classification. - Jonas Richiardi; Dimitri Van De Ville; Kaspar Riesen; Horst Bunke (ICPR, 2010)

Generalized median graph computation by means of graph embedding in vector spaces. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa; Kaspar Riesen; Horst Bunke (Pattern Recognit., 2010)

Exact and Inexact Graph Matching: Methodology and Applications. - Kaspar Riesen; Xiaoyi Jiang 001; Horst Bunke (Managing and Mining Graph Data, 2010)

Graph Classification and Clustering Based on Vector Space Embedding - Kaspar Riesen; Horst Bunke (WorldScientific, 2010)

Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching. - Stefan Fankhauser; Kaspar Riesen; Horst Bunke (GbRPR, 2011)

Recent advances in graph-based pattern recognition with applications in document analysis. - Horst Bunke; Kaspar Riesen (Pattern Recognit., 2011)

Improving vector space embedding of graphs through feature selection algorithms. - Horst Bunke; Kaspar Riesen (Pattern Recognit., 2011)

Suboptimal Graph Isomorphism using bipartite Matching. - Stefan Fankhauser; Kaspar Riesen; Horst Bunke; Peter J. Dickinson (Int. J. Pattern Recognit. Artif. Intell., 2012)

Towards the unification of structural and statistical pattern recognition. - Horst Bunke; Kaspar Riesen (Pattern Recognit. Lett., 2012)

A Fast Matching Algorithm for Graph-Based Handwriting Recognition. - Andreas Fischer 002; Ching Y. Suen; Volkmar Frinken; Kaspar Riesen; Horst Bunke (GbRPR, 2013)

A Novel Software Toolkit for Graph Edit Distance Computation. - Kaspar Riesen; Sandro Emmenegger; Horst Bunke (GbRPR, 2013)

Graph Based Keyword Spotting in Handwritten Historical Slavic Documents. - Kaspar Riesen; Darko Brodic (ERCIM News, 2013)

Discriminative prototype selection methods for graph embedding. - Ehsan Zare Borzeshi; Massimo Piccardi; Kaspar Riesen; Horst Bunke (Pattern Recognit., 2013)

Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation. - Kaspar Riesen; Andreas Fischer 002; Horst Bunke (ANNPR, 2014)

Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time. - Kaspar Riesen; Andreas Fischer 002; Horst Bunke (ANNPR, 2014)

Iterative Bipartite Graph Edit Distance Approximation. - Kaspar Riesen; Rolf Dornberger; Horst Bunke (Document Analysis Systems, 2014)

Graph Based Keyword Spotting in Medieval Slavic Documents - A Project Outline. - Kaspar Riesen; Darko Brodic; Zoran N. Milivojevic; Cedomir A. Maluckov (EuroMed, 2014)

Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy. - Kaspar Riesen; Horst Bunke (ICISP, 2014)

Improving Graph Edit Distance Approximation by Centrality Measures. - Kaspar Riesen; Horst Bunke; Andreas Fischer 002 (ICPR, 2014)

A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance. - Andreas Fischer 002; Réjean Plamondon; Yvon Savaria; Kaspar Riesen; Horst Bunke (S+SSPR, 2014)

Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks. - Benoit Gaüzère; Sébastien Bougleux; Kaspar Riesen; Luc Brun (S+SSPR, 2014)

Improving Approximate Graph Edit Distance Using Genetic Algorithms. - Kaspar Riesen; Andreas Fischer 002; Horst Bunke (S+SSPR, 2014)

Improving Hausdorff Edit Distance Using Structural Node Context. - Andreas Fischer 002; Seiichi Uchida; Volkmar Frinken; Kaspar Riesen; Horst Bunke (GbRPR, 2015)

A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching. - Miquel Ferrer; Francesc Serratosa; Kaspar Riesen (GbRPR, 2015)

Approximation of Graph Edit Distance in Quadratic Time. - Kaspar Riesen; Miquel Ferrer; Andreas Fischer 002; Horst Bunke (GbRPR, 2015)

Tackling temporal pattern recognition by vector space embedding. - Brian Kenji Iwana; Seiichi Uchida; Kaspar Riesen; Volkmar Frinken (ICDAR, 2015)

How to Support Customer Segmentation with Useful Cluster Descriptions. - Hans Friedrich Witschel; Simon Loo; Kaspar Riesen (ICDM, 2015)

Building Classifier Ensembles Using Greedy Graph Edit Distance. - Kaspar Riesen; Miquel Ferrer; Andreas Fischer 002 (MCS, 2015)

Suboptimal Graph Edit Distance Based on Sorted Local Assignments. - Kaspar Riesen; Miquel Ferrer; Horst Bunke (MCS, 2015)

Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation. - Miquel Ferrer; Francesc Serratosa; Kaspar Riesen (MLDM, 2015)

Greedy Graph Edit Distance. - Kaspar Riesen; Miquel Ferrer; Rolf Dornberger; Horst Bunke (MLDM, 2015)

Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations. - Kaspar Riesen; Andreas Fischer 002; Horst Bunke (Int. J. Pattern Recognit. Artif. Intell., 2015)

Approximation of graph edit distance based on Hausdorff matching. - Andreas Fischer 002; Ching Y. Suen; Volkmar Frinken; Kaspar Riesen; Horst Bunke (Pattern Recognit., 2015)

Improving bipartite graph edit distance approximation using various search strategies. - Kaspar Riesen; Horst Bunke (Pattern Recognit., 2015)

Improving bipartite graph matching by assessing the assignment confidence. - Miquel Ferrer; Francesc Serratosa; Kaspar Riesen (Pattern Recognit. Lett., 2015)

Structural Pattern Recognition with Graph Edit Distance - Approximation Algorithms and Applications - Kaspar Riesen (Springer, 2015)

Graph Edit Distance - Novel Approximation Algorithms. - Kaspar Riesen; Horst Bunke (Handbook of Pattern Recognition and Computer Vision, 2016)

Approximation of Graph Edit Distance by Means of a Utility Matrix. - Kaspar Riesen; Andreas Fischer 002; Horst Bunke (ANNPR, 2016)

On the Relevance of Local Neighbourhoods for Greedy Graph Edit Distance. - Xavier Cortés; Francesc Serratosa; Kaspar Riesen (S+SSPR, 2016)

A Novel Graph Database for Handwritten Word Images. - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (S+SSPR, 2016)

Graph-Based Keyword Spotting in Historical Handwritten Documents. - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (S+SSPR, 2016)

Predicting the correctness of node assignments in bipartite graph matching. - Kaspar Riesen; Miquel Ferrer (Pattern Recognit. Lett., 2016)

Speeding-Up Graph-Based Keyword Spotting by Quadtree Segmentations. - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (CAIP (1), 2017)

Improved Graph Edit Distance Approximation with Simulated Annealing. - Kaspar Riesen; Andreas Fischer 002; Horst Bunke (GbRPR, 2017)

Speeding-Up Graph-Based Keyword Spotting in Historical Handwritten Documents. - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (GbRPR, 2017)

A Survey on Applications of Bipartite Graph Edit Distance. - Michael Stauffer; Thomas Tschachtli; Andreas Fischer 002; Kaspar Riesen (GbRPR, 2017)

A Structural Approach to Offline Signature Verification Using Graph Edit Distance. - Paul Maergner; Kaspar Riesen; Rolf Ingold; Andreas Fischer 002 (ICDAR, 2017)

Ensembles for Graph-Based Keyword Spotting in Historical Handwritten Documents. - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (ICDAR, 2017)

Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes. - Brian Kenji Iwana; Volkmar Frinken; Kaspar Riesen; Seiichi Uchida (Pattern Recognit., 2017)

Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment. - Andreas Fischer 002; Kaspar Riesen; Horst Bunke (Pattern Recognit. Lett., 2017)

Graph-Based Keyword Spotting in Historical Documents Using Context-Aware Hausdorff Edit Distance. - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (DAS, 2018)

Offline Signature Verification Via Structural Methods: Graph Edit Distance and Inkball Models. - Paul Maergner; Nicholas R. Howe; Kaspar Riesen; Rolf Ingold; Andreas Fischer 002 (ICFHR, 2018)

Offline Signature Verification by Combining Graph Edit Distance and Triplet Networks. - Paul Maergner; Vinaychandran Pondenkandath; Michele Alberti; Marcus Liwicki; Kaspar Riesen; Rolf Ingold; Andreas Fischer 002 (S+SSPR, 2018)

On the Impact of Using Utilities Rather than Costs for Graph Matching. - Kaspar Riesen; Andreas Fischer 002; Horst Bunke (Neural Process. Lett., 2018)

Keyword spotting in historical handwritten documents based on graph matching. - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (Pattern Recognit., 2018)

Sketch-Based User Authentication With a Novel String Edit Distance Model. - Kaspar Riesen; Thomas Hanne; Roman Schmidt (IEEE Trans. Syst. Man Cybern. Syst., 2018)

Graph-Based Keyword Spotting - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (WorldScientific, 2019)

Cross-Evaluation of Graph-Based Keyword Spotting in Handwritten Historical Documents. - Michael Stauffer; Paul Maergner; Andreas Fischer 002; Kaspar Riesen (GbRPR, 2019)

Graph Embedding for Offline Handwritten Signature Verification. - Michael Stauffer; Paul Maergner; Andreas Fischer 002; Kaspar Riesen (ICBEA, 2019)

Offline Signature Verification using Structural Dynamic Time Warping. - Michael Stauffer; Paul Maergner; Andreas Fischer 002; Rolf Ingold; Kaspar Riesen (ICDAR, 2019)

A comparative study of pattern recognition algorithms for predicting the inpatient mortality risk using routine laboratory measurements. - Narayan Schütz; Alexander B. Leichtle; Kaspar Riesen (Artif. Intell. Rev., 2019)

Graph-Based Offline Signature Verification. - Paul Maergner; Nicholas R. Howe; Kaspar Riesen; Rolf Ingold; Andreas Fischer 002 (CoRR, 2019)

Online signature verification based on string edit distance. - Kaspar Riesen; Roman Schmidt (Int. J. Document Anal. Recognit., 2019)

Graph-based keyword spotting in historical manuscripts using Hausdorff edit distance. - Mohammad Reza Ameri; Michael Stauffer; Kaspar Riesen; Tien D. Bui; Andreas Fischer 002 (Pattern Recognit. Lett., 2019)

Combining graph edit distance and triplet networks for offline signature verification. - Paul Maergner; Vinaychandran Pondenkandath; Michele Alberti; Marcus Liwicki; Kaspar Riesen; Rolf Ingold; Andreas Fischer 002 (Pattern Recognit. Lett., 2019)

KvGR: A Graph-Based Interface for Explorative Sequential Question Answering on Heterogeneous Information Sources. - Hans Friedrich Witschel; Kaspar Riesen; Loris Grether (ECIR (1), 2020)

Matching of Matching-Graphs - A Novel Approach for Graph Classification. - Mathias Fuchs; Kaspar Riesen (ICPR, 2020)

A Novel Data Set for Information Retrieval on the Basis of Subgraph Matching. - Kaspar Riesen; Hans Friedrich Witschel; Loris Grether (S+SSPR, 2020)

Filters for graph-based keyword spotting in historical handwritten documents. - Michael Stauffer; Andreas Fischer 002; Kaspar Riesen (Pattern Recognit. Lett., 2020)

Approximate Graph Edit Distance in Quadratic Time. - Kaspar Riesen; Miquel Ferrer; Horst Bunke (IEEE ACM Trans. Comput. Biol. Bioinform., 2020)

Iterative Creation of Matching-Graphs - Finding Relevant Substructures in Graph Sets. - Mathias Fuchs; Kaspar Riesen (CIARP, 2021)

Natural Language-based User Guidance for Knowledge Graph Exploration: A User Study. - Hans Friedrich Witschel; Kaspar Riesen; Loris Grether (KDIR, 2021)

Graph Embedding in Vector Spaces Using Matching-Graphs. - Mathias Fuchs; Kaspar Riesen (SISAP, 2021)

Graph Augmentation for Neural Networks Using Matching-Graphs. - Mathias Fuchs; Kaspar Riesen (ANNPR, 2022)

Augment Small Training Sets Using Matching-Graphs. - Mathias Fuchs; Kaspar Riesen (ICPRAI (2), 2022)

Improving Graph Classification by Means of Linear Combinations of Reduced Graphs. - Anthony Gillioz; Kaspar Riesen (ICPRAM, 2022)

Graph Reduction Neural Networks for Structural Pattern Recognition. - Anthony Gillioz; Kaspar Riesen (S+SSPR, 2022)

A novel way to formalize stable graph cores by using matching-graphs. - Mathias Fuchs; Kaspar Riesen (Pattern Recognit., 2022)

Bridging Distinct Spaces in Graph-Based Machine Learning. - Linlin Jia; Xiao Ning; Benoit Gaüzère; Paul Honeine; Kaspar Riesen (ACPR (2), 2023)

Graph-Based Deep Learning on the Swiss River Network. - Benjamin Fankhauser; Vidushi Bigler; Kaspar Riesen (GbRPR, 2023)

Matching-Graphs for Building Classification Ensembles. - Mathias Fuchs; Kaspar Riesen (GbRPR, 2023)

Graph-Based vs. Vector-Based Classification: A Fair Comparison. - Anthony Gillioz; Kaspar Riesen (GbRPR, 2023)

Two-Step Graph Classification on the Basis of Hierarchical Graphs. - Anthony Gillioz; Kaspar Riesen (ICPRAM, 2023)

Novel Benchmark Data Set for Automatic Error Detection and Correction. - Corina Masanti; Hans Friedrich Witschel; Kaspar Riesen (NLDB, 2023)

Building Multiple Classifier Systems Using Linear Combinations of Reduced Graphs. - Anthony Gillioz; Kaspar Riesen (SN Comput. Sci., 2023)

Graph-based pattern recognition on spectral reduced graphs. - Anthony Gillioz; Kaspar Riesen (Pattern Recognit., 2023)

Learning Graph Matching with Graph Neural Networks. - Kalvin Dobler; Kaspar Riesen (ANNPR, 2024)

Leveraging LSTM Embeddings for River Water Temperature Modeling. - Benjamin Fankhauser; Vidushi Bigler; Kaspar Riesen (ANNPR, 2024)

Neural Decompiling of Tracr Transformers. - Hannes Thurnherr; Kaspar Riesen (ANNPR, 2024)

Dissimilarity-Based Graph Embedding: An Efficient GAT-based Approach. - Francesco Leonardi; Kaspar Riesen (ICPR (10), 2024)

Automated Error Detection Through Specialized Task Implementation. - Corina Masanti; Hans Friedrich Witschel; Kaspar Riesen (ICPRAI (2), 2024)

Clustering Time Series Data for Personalized Type 1 Diabetes Management. - Aylin Tastan; Clara Escorihuela-Altaba; Jose F. Garcia-Tirado; Kaspar Riesen (ICPRAI (2), 2024)

Impute Water Temperature in the Swiss River Network Using LSTMs. - Benjamin Fankhauser; Vidushi Bigler; Kaspar Riesen (ICPRAM, 2024)

Comparing Learning Methods to Enhance Decision-Making in Simulated Curling. - Michael Brunner; Kaspar Riesen (S+SSPR, 2024)

Learning Graph Similarity by Counting Holes in Simplicial Complexes. - Kalvin Dobler; Kaspar Riesen (S+SSPR, 2024)

Spatio-Temporal Graph Neural Networks for Water Temperature Modeling. - Benjamin Fankhauser; Vidushi Bigler; Kaspar Riesen (S+SSPR, 2024)

LSTM Networks and Graph Neural Networks for Predicting Events of Hypoglycemia. - Fabian Hüni; Jose F. Garcia-Tirado; Kaspar Riesen (S+SSPR, 2024)

A Geometric Perspective on Graph Similarity Learning Using Convex Hulls. - Kalvin Dobler; Kaspar Riesen (GbRPR, 2025)

Exploring a Graph Regression Problem in River Networks. - Benjamin Fankhauser; Vidushi Bigler; Kaspar Riesen (GbRPR, 2025)

Predicting Photovoltaic Power Output Using LSTM: A Comparative Study Using both Historical and Climate Data. - Fereshteh Jafari; Joseph Moerschell; Kaspar Riesen (ICPRAM, 2025)

Boosting Language Models for Real-Word Error Detection. - Corina Masanti; Hans Friedrich Witschel; Kaspar Riesen (ICPRAM, 2025)

Fast approximate maximum common subgraph computation. - Mathias Fuchs; Kaspar Riesen (Pattern Recognit. Lett., 2025)

Normalized graph compression distance - A novel graph matching framework. - Anthony Gillioz; Kaspar Riesen (Pattern Recognit. Lett., 2025)