Synthesis of Median Spectral Graph. - Miquel Ferrer; Francesc Serratosa; Alberto Sanfeliu (IbPRIA (2), 2005)

Spectral Median Graphs Applied to Graphical Symbol Recognition. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa (CIARP, 2006)

On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs. - Miquel Ferrer; Francesc Serratosa; Ernest Valveny (GbRPR, 2007)

Evaluation of Spectral-Based Methods for Median Graph Computation. - Miquel Ferrer; Francesc Serratosa; Ernest Valveny (IbPRIA (2), 2007)

Bounding the Size of the Median Graph. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa (IbPRIA (2), 2007)

Combination of OCR Engines for Page Segmentation Based on Performance Evaluation. - Miquel Ferrer; Ernest Valveny (ICDAR, 2007)

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

Segmentation robust to the vignette effect for machine vision systems. - Dimosthenis Karatzas; Marçal Rusiñol; Jacobus Antens; Miquel Ferrer (ICPR, 2008)

Exact Median Graph Computation Via Graph Embedding. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa; Horst Bunke (SSPR/SPR, 2008)

Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa; Itziar Bardají; Horst Bunke (CAIP, 2009)

A Recursive Embedding Approach to Median Graph Computation. - Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; Horst Bunke (GbRPR, 2009)

Median Graph Computation by Means of a Genetic Approach Based on Minimum Common Supergraph and Maximum Common Subgraph. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa (IbPRIA, 2009)

Median graphs: A genetic approach based on new theoretical properties. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa (Pattern Recognit., 2009)

Median graph: A new exact algorithm using a distance based on the maximum common subgraph. - Miquel Ferrer; Ernest Valveny; Francesc Serratosa (Pattern Recognit. Lett., 2009)

Computing the Barycenter Graph by Means of the Graph Edit Distance. - Itziar Bardají; Miquel Ferrer; Alberto Sanfeliu (ICPR, 2010)

An Iterative Algorithm for Approximate Median Graph Computation. - Miquel Ferrer; Horst Bunke (ICPR, 2010)

A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs. - Manuel Igelmo; Alberto Sanfeliu; Miquel Ferrer (ICPR, 2010)

Autonomous navigation for urban service mobile robots. - Andreu Corominas Murtra; Eduard Trulls; Oscar Sandoval Torres; Joan Pérez-Ibarz; Alejandro Dizan Vasquez Govea; Josep M. Mirats Tur; Miquel Ferrer; Alberto Sanfeliu (IROS, 2010)

A Comparison between Two Representatives of a Set of Graphs: Median vs. Barycenter Graph. - Itziar Bardají; Miquel Ferrer; Alberto Sanfeliu (SSPR/SPR, 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)

A generic framework for median graph computation based on a recursive embedding approach. - Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; Itziar Bardají; Horst Bunke (Comput. Vis. Image Underst., 2011)

Generalized median string computation by means of string embedding in vector spaces. - Xiaoyi Jiang 001; Jöran Wentker; Miquel Ferrer (Pattern Recognit. Lett., 2012)

Editorial for the Special Issue on Graph-based representations in pattern recognition. - Andrea Torsello; Xiaoyi Jiang 001; Miquel Ferrer (Pattern Recognit. Lett., 2012)

Impact of Keypoint Detection on Graph-Based Characterization of Blood Vessels in Colonoscopy Videos. - Joan M. Núñez; Jorge Bernal; Miquel Ferrer; Fernando Vilariño (CARE@MICCAI, 2014)

A tentative fuzzy assessment of the quality of teaching and opportunities to learn mathematics in a classroom discussion. - Itziar García-Honrado; Miquel Ferrer; Ángela Blanco-Fernández (IFSA-EUSFLAT, 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)

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)

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

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

Aligning daily activities with personality: towards a recommender system for improving wellbeing. - Mohammed Khwaja; Miquel Ferrer; Jesús Omana Iglesias; A. Aldo Faisal; Aleksandar Matic (RecSys, 2019)

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