Miquel Ferrer

535 total citations
18 papers, 190 citations indexed

About

Miquel Ferrer is a scholar working on Computer Vision and Pattern Recognition, Artificial Intelligence and Signal Processing. According to data from OpenAlex, Miquel Ferrer has authored 18 papers receiving a total of 190 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computer Vision and Pattern Recognition, 9 papers in Artificial Intelligence and 6 papers in Signal Processing. Recurrent topics in Miquel Ferrer's work include Graph Theory and Algorithms (11 papers), Advanced Graph Neural Networks (7 papers) and Data Management and Algorithms (6 papers). Miquel Ferrer is often cited by papers focused on Graph Theory and Algorithms (11 papers), Advanced Graph Neural Networks (7 papers) and Data Management and Algorithms (6 papers). Miquel Ferrer collaborates with scholars based in Spain, Switzerland and Germany. Miquel Ferrer's co-authors include Francesc Serratosa, Ernest Valveny, Kaspar Riesen, Horst Bunke, Xiaoyi Jiang, Dìmosthenis Karatzas, Andrea Torsello, Alberto Sanfeliu, Gemma Sánchez and Dizan Vasquez and has published in prestigious journals such as Pattern Recognition, Pattern Recognition Letters and Computer Vision and Image Understanding.

In The Last Decade

Miquel Ferrer

18 papers receiving 182 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Miquel Ferrer Spain 8 139 109 48 31 22 18 190
Markus Maier Germany 4 87 0.6× 112 1.0× 20 0.4× 24 0.8× 7 0.3× 4 186
Prodip Hore United States 7 140 1.0× 269 2.5× 84 1.8× 21 0.7× 26 1.2× 8 318
Jiajun Liu China 7 165 1.2× 81 0.7× 20 0.4× 16 0.5× 16 0.7× 19 243
Geonmo Gu South Korea 7 205 1.5× 160 1.5× 39 0.8× 10 0.3× 32 1.5× 10 259
Xuan Hong Dang Australia 7 49 0.4× 237 2.2× 87 1.8× 14 0.5× 36 1.6× 15 274
Alexander Maximov Sweden 10 177 1.3× 297 2.7× 14 0.3× 24 0.8× 39 1.8× 18 333
Paulo Pagliosa Brazil 10 101 0.7× 61 0.6× 24 0.5× 7 0.2× 37 1.7× 31 246
Yukihiro Hamasuna Japan 8 115 0.8× 176 1.6× 25 0.5× 17 0.5× 12 0.5× 53 228
S. Thakur India 4 241 1.7× 48 0.4× 29 0.6× 13 0.4× 15 0.7× 4 280
Evangelos E. Kotsifakos Greece 5 93 0.7× 74 0.7× 116 2.4× 16 0.5× 19 0.9× 9 248

Countries citing papers authored by Miquel Ferrer

Since Specialization
Citations

This map shows the geographic impact of Miquel Ferrer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Miquel Ferrer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Miquel Ferrer more than expected).

Fields of papers citing papers by Miquel Ferrer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Miquel Ferrer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Miquel Ferrer. The network helps show where Miquel Ferrer may publish in the future.

Co-authorship network of co-authors of Miquel Ferrer

This figure shows the co-authorship network connecting the top 25 collaborators of Miquel Ferrer. A scholar is included among the top collaborators of Miquel Ferrer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Miquel Ferrer. Miquel Ferrer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

18 of 18 papers shown
1.
Ferrer, Miquel, Francesc Serratosa, & Kaspar Riesen. (2015). Improving bipartite graph matching by assessing the assignment confidence. Pattern Recognition Letters. 65. 29–36. 15 indexed citations
2.
Riesen, Kaspar & Miquel Ferrer. (2015). Predicting the correctness of node assignments in bipartite graph matching. Pattern Recognition Letters. 69. 8–14. 5 indexed citations
3.
Riesen, Kaspar, Miquel Ferrer, & Horst Bunke. (2015). Approximate Graph Edit Distance in Quadratic Time. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 17(2). 483–494. 20 indexed citations
4.
Valveny, Ernest, et al.. (2012). Adaptation of a computer programming course to the ESHE requirements: evaluation five years later. European Journal of Engineering Education. 37(3). 243–254. 4 indexed citations
5.
Torsello, Andrea, Xiaoyi Jiang, & Miquel Ferrer. (2012). Editorial for the Special Issue on Graph-based representations in pattern recognition. Pattern Recognition Letters. 33(15). 1957–1957. 2 indexed citations
6.
Jiang, Xiaoyi, Miquel Ferrer, & Andrea Torsello. (2011). Proceedings of the 8th international conference on Graph-based representations in pattern recognition. 3 indexed citations
7.
Ferrer, Miquel, et al.. (2011). A generic framework for median graph computation based on a recursive embedding approach. Computer Vision and Image Understanding. 115(7). 919–928. 17 indexed citations
8.
Jiang, Xiaoyi, et al.. (2011). Generalized median string computation by means of string embedding in vector spaces. Pattern Recognition Letters. 33(7). 842–852. 15 indexed citations
9.
Ferrer, Miquel, et al.. (2010). Computing the Barycenter Graph by Means of the Graph Edit Distance. DIGITAL.CSIC (Spanish National Research Council (CSIC)). 962–965. 1 indexed citations
10.
Sanfeliu, Alberto, et al.. (2010). A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs. UPCommons institutional repository (Universitat Politècnica de Catalunya). 958–961. 1 indexed citations
11.
Trulls, Eduard, et al.. (2010). Autonomous navigation for urban service mobile robots. DIGITAL.CSIC (Spanish National Research Council (CSIC)). 3. 4141–4146. 8 indexed citations
12.
Ferrer, Miquel & Horst Bunke. (2010). An Iterative Algorithm for Approximate Median Graph Computation. QRU Quaderns de Recerca en Urbanisme. 1562–1565. 4 indexed citations
13.
Ferrer, Miquel, Ernest Valveny, & Francesc Serratosa. (2009). Median graph: A new exact algorithm using a distance based on the maximum common subgraph. Pattern Recognition Letters. 30(5). 579–588. 18 indexed citations
14.
Ferrer, Miquel, Ernest Valveny, & Francesc Serratosa. (2009). Median graphs: A genetic approach based on new theoretical properties. Pattern Recognition. 42(9). 2003–2012. 15 indexed citations
15.
Ferrer, Miquel, Ernest Valveny, Francesc Serratosa, Kaspar Riesen, & Horst Bunke. (2009). Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recognition. 43(4). 1642–1655. 51 indexed citations
16.
Karatzas, Dìmosthenis, et al.. (2008). Segmentation robust to the vignette effect for machine vision systems. Proceedings - International Conference on Pattern Recognition. 1–4. 2 indexed citations
17.
Ferrer, Miquel, Ernest Valveny, Francesc Serratosa, Kaspar Riesen, & Horst Bunke. (2008). An approximate algorithm for median graph computation using graph embedding. Proceedings - International Conference on Pattern Recognition. 23. 1–4. 7 indexed citations
18.
Ferrer, Miquel & Ernest Valveny. (2007). Combination of OCR Engines for Page Segmentation Based on Performance Evaluation. Proceedings of the International Conference on Document Analysis and Recognition. 4. 784–788. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026