Andrea Ribichini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrea Ribichini has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Marco Schaerf
Department of Computer, Control, and Management Engineering “Antonio Ruberti”, Sapienza University of Rome, Rome, Italy
5 shared publications - Giorgio Ausiello
Dipartimento di Ingegneria Informatica Automatica e Gestionale Università di Roma "La Sapienza" via Ariosto 25 00185 Roma Italy
4 shared publications - Paolo Giulio Franciosa
Universita di Roma “La Sapienza
4 shared publications - Camil Demetrescu
Sapienza University of Rome
3 shared publications - Irene Finocchi
LUISS Guido Carli
3 shared publications - Isabella Lari
Dipartimento di Scienze Statistiche Università di Roma "La Sapienza" piazzale Aldo Moro 5 00185 Roma Italy
3 shared publications
Latest Publications
- Open Access
- 19 December 2025
- Published by Elsevier in Computer Science Review
- Vol. 60
Interdiction in network maximum flow and related problems: A survey
- 19 December 2025
- Published by Elsevier in Computer Science Review
- Vol. 60
Open AccessInterdiction in network maximum flow and related problems: A survey
- Open Access
- 18 April 2025
- Published by Elsevier in Journal of Informetrics
- Vol. 19 (2)
A large-scale temporal analysis of scientific production across disciplines and countries
- 18 April 2025
- Published by Elsevier in Journal of Informetrics
- Vol. 19 (2)
Open AccessA large-scale temporal analysis of scientific production across disciplines and countries
- Open Access
- 25 September 2023
- Published by Springer Nature in Scientometrics
- Vol. 128 (11) , 6147-6175
An analysis of international mobility and research productivity in computer science
In this article, we study the international mobility of researchers in the field of computer science (CS). Our analysis hinges upon Scopus data spanning a time period of 30 years (1991–2020) and involves a total of 969,835 researchers and 8,412,543 publications. Our contribution is two-fold. First, we characterize mobility as a fairly common phenomenon in CS, we highlight a strong correlation with standard bibliometric indicators at all seniority levels and a lower propensity of female researchers to relocate internationally than their male colleagues. Second, we analyze individual career paths building from them a mobility graph and identifying common patterns, such as the most traveled connections between different countries, whether they are equally traversed in both directions and the most frequently visited countries. The temporal evolution of the above patterns within our 30-year time frame is also investigated. The United States emerged as a preferred destination for internationally mobile authors, with strong connections to China (from the early 2000s), Canada, and several prominent European countries, most notably the United Kingdom, Germany, and France.
- 25 September 2023
- Published by Springer Nature in Scientometrics
- Vol. 128 (11) , 6147-6175
Open AccessAn analysis of international mobility and research productivity in computer science
In this article, we study the international mobility of researchers in the field of computer science (CS). Our analysis hinges upon Scopus data spanning a time period of 30 years (1991–2020) and involves a total of 969,835 researchers and 8,412,543 publications. Our contribution is two-fold. First, we characterize mobility as a fairly common phenomenon in CS, we highlight a strong correlation with standard bibliometric indicators at all seniority levels and a lower propensity of female researchers to relocate internationally than their male colleagues. Second, we analyze individual career paths building from them a mobility graph and identifying common patterns, such as the most traveled connections between different countries, whether they are equally traversed in both directions and the most frequently visited countries. The temporal evolution of the above patterns within our 30-year time frame is also investigated. The United States emerged as a preferred destination for internationally mobile authors, with strong connections to China (from the early 2000s), Canada, and several prominent European countries, most notably the United Kingdom, Germany, and France.
- 30 July 2022
- Published by Springer Nature in Scientometrics
- Vol. 127 (8) , 4913-4938
On computer science research and its temporal evolution
- 30 July 2022
- Published by Springer Nature in Scientometrics
- Vol. 127 (8) , 4913-4938
On computer science research and its temporal evolution
- Open Access
- 23 May 2022
- Published by Association for Computing Machinery (ACM) in Journal of Data and Information Quality
- Vol. 14 (3) , 1-13
Which Conference Is That? A Case Study in Computer Science
Conferences play a major role in some disciplines such as computer science and are often used in research quality evaluation exercises. Differently from journals and books, for which ISSN and ISBN codes provide unambiguous keys, recognizing the conference series in which a paper was published is a rather complex endeavor: There is no unique code assigned to conferences, and the way their names are written may greatly vary across years and catalogs. In this article, we propose a technique for the entity resolution of conferences based on the analysis of different semantic parts of their names. We present the results of an investigation of our technique on a dataset of 42,395 distinct computer science conference names excerpted from the DBLP computer science repository, 1 which we automatically link to different authority files. With suitable data cleaning, the precision of our record linkage algorithm can be as high as 94%. A comparison with results obtainable using state-of-the-art general-purpose record linkage algorithms rounds off the article, showing that our ad hoc solution largely outperforms them in terms of the quality of the results.
- 23 May 2022
- Published by Association for Computing Machinery (ACM) in Journal of Data and Information Quality
- Vol. 14 (3) , 1-13
Open AccessWhich Conference Is That? A Case Study in Computer Science
Conferences play a major role in some disciplines such as computer science and are often used in research quality evaluation exercises. Differently from journals and books, for which ISSN and ISBN codes provide unambiguous keys, recognizing the conference series in which a paper was published is a rather complex endeavor: There is no unique code assigned to conferences, and the way their names are written may greatly vary across years and catalogs. In this article, we propose a technique for the entity resolution of conferences based on the analysis of different semantic parts of their names. We present the results of an investigation of our technique on a dataset of 42,395 distinct computer science conference names excerpted from the DBLP computer science repository, 1 which we automatically link to different authority files. With suitable data cleaning, the precision of our record linkage algorithm can be as high as 94%. A comparison with results obtainable using state-of-the-art general-purpose record linkage algorithms rounds off the article, showing that our ad hoc solution largely outperforms them in terms of the quality of the results.
- Open Access
Max-flow vitality in undirected unweighted planar graphs
We show a fast algorithm for determining the set of edges in a planar undirected unweighted graph, whose deletion reduces the maximum flow between two fixed vertices. This is a special case of the max flow vitality problem, that has been efficiently solved for general undirected graphs and st-planar graphs. The vitality of an edge of a graph with respect to the maximum flow between two fixed vertices s and t is defined as the reduction of the maximum flow caused by the removal of that edge. In this paper we show that the set of edges having vitality greater than zero in a planar undirected unweighted graph with n vertices can be found in O(n log n) worst-case time and O(n) space.
Open AccessMax-flow vitality in undirected unweighted planar graphs
We show a fast algorithm for determining the set of edges in a planar undirected unweighted graph, whose deletion reduces the maximum flow between two fixed vertices. This is a special case of the max flow vitality problem, that has been efficiently solved for general undirected graphs and st-planar graphs. The vitality of an edge of a graph with respect to the maximum flow between two fixed vertices s and t is defined as the reduction of the maximum flow caused by the removal of that edge. In this paper we show that the set of edges having vitality greater than zero in a planar undirected unweighted graph with n vertices can be found in O(n log n) worst-case time and O(n) space.
- Open Access
- 5 August 2020
- Published by Springer Nature in Scientometrics
- Vol. 125 (1) , 533-549
Are Italian research assessment exercises size-biased?
Research assessment exercises have enjoyed ever-increasing popularity in many countries in recent years, both as a method to guide public funds allocation and as a validation tool for adopted research support policies. Italy’s most recently completed evaluation effort (VQR 2011–14) required each university to submit to the Ministry for Education, University, and Research (MIUR) 2 research products per author (3 in the case of other research institutions), chosen in such a way that the same product is not assigned to two authors belonging to the same institution. This constraint suggests that larger institutions, where collaborations among colleagues may be more frequent, could suffer a size-related bias in their evaluation scores. To validate our claim, we investigate the outcome of artificially splitting Sapienza University of Rome, one of the largest universities in Europe, in a number of separate partitions, according to several criteria, noting significant score increases for several partitioning scenarios.
- 5 August 2020
- Published by Springer Nature in Scientometrics
- Vol. 125 (1) , 533-549
Open AccessAre Italian research assessment exercises size-biased?
Research assessment exercises have enjoyed ever-increasing popularity in many countries in recent years, both as a method to guide public funds allocation and as a validation tool for adopted research support policies. Italy’s most recently completed evaluation effort (VQR 2011–14) required each university to submit to the Ministry for Education, University, and Research (MIUR) 2 research products per author (3 in the case of other research institutions), chosen in such a way that the same product is not assigned to two authors belonging to the same institution. This constraint suggests that larger institutions, where collaborations among colleagues may be more frequent, could suffer a size-related bias in their evaluation scores. To validate our claim, we investigate the outcome of artificially splitting Sapienza University of Rome, one of the largest universities in Europe, in a number of separate partitions, according to several criteria, noting significant score increases for several partitioning scenarios.
- 17 June 2020
- Published by Springer Nature in Scientometrics
- Vol. 124 (3) , 2207-2228
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy
- 17 June 2020
- Published by Springer Nature in Scientometrics
- Vol. 124 (3) , 2207-2228
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy
- Open Access
Max flow vitality in general and $st$-planar graphs
The \emph{vitality} of an arc/node of a graph with respect to the maximum flow between two fixed nodes $s$ and $t$ is defined as the reduction of the maximum flow caused by the removal of that arc/node. In this paper we address the issue of determining the vitality of arcs and/or nodes for the maximum flow problem. We show how to compute the vitality of all arcs in a general undirected graph by solving only $2(n-1)$ max flow instances and, In $st$-planar graphs (directed or undirected) we show how to compute the vitality of all arcs and all nodes in $O(n)$ worst-case time. Moreover, after determining the vitality of arcs and/or nodes, and given a planar embedding of the graph, we can determine the vitality of a `contiguous' set of arcs/nodes in time proportional to the size of the set.Open AccessMax flow vitality in general and $st$-planar graphs
The \emph{vitality} of an arc/node of a graph with respect to the maximum flow between two fixed nodes $s$ and $t$ is defined as the reduction of the maximum flow caused by the removal of that arc/node. In this paper we address the issue of determining the vitality of arcs and/or nodes for the maximum flow problem. We show how to compute the vitality of all arcs in a general undirected graph by solving only $2(n-1)$ max flow instances and, In $st$-planar graphs (directed or undirected) we show how to compute the vitality of all arcs and all nodes in $O(n)$ worst-case time. Moreover, after determining the vitality of arcs and/or nodes, and given a planar embedding of the graph, we can determine the vitality of a `contiguous' set of arcs/nodes in time proportional to the size of the set. - 1 January 2010
- Published by Springer Nature
- p. 160-172
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming
- 1 January 2010
- Published by Springer Nature
- p. 160-172
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming