Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Andrea Ribichini"'
Publikováno v:
JLIS.it, Vol 13, Iss 1 (2022)
Externí odkaz:
https://doaj.org/article/153a3fe659f74e318bb7afe3dae82415
Publikováno v:
Scientometrics. 125:533-549
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 complet
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 confe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78705210ca89145b4ea203693c32ed74
https://hdl.handle.net/11573/1661035
https://hdl.handle.net/11573/1661035
Due to its quantitative nature, bibliometrics is becoming increasingly popular among policy makers for academic hiring and career promotions. In this article, we quantitatively assess the impact that the granularity level in the classification of sci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15454f9b64f99e43c729478426406d08
http://hdl.handle.net/11573/1405608
http://hdl.handle.net/11573/1405608
Publikováno v:
Datacite
Archivio della ricerca-Università di Roma La Sapienza
Scientometrics
Archivio della ricerca-Università di Roma La Sapienza
Scientometrics
We investigate the accuracy of how author names are reported in bibliographic records excerpted from four prominent sources: WoS, Scopus, PubMed, and CrossRef. We take as a case study 44,549 publications stored in the internal database of Sapienza Un
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 determini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d481388f3ca59a47b4d257f0d716649
http://hdl.handle.net/11573/1283352
http://hdl.handle.net/11573/1283352
Publikováno v:
Scopus-Elsevier
In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximised, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money compensation to pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::466e92b195ac8cff468b061958c9a416
Autor:
Giuseppe F. Italiano, Giorgio Ausiello, Paolo Giulio Franciosa, Camil Demetrescu, Andrea Ribichini
Publikováno v:
Algorithmica. 55:346-374
This article reports the results of an extensive experimental analysis of efficient algorithms for computing graph spanners in the data streaming model, where an (α,β)-spanner of a graph G is a subgraph S⊆G such that for each pair of vertices the
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642404498
ESA
ESA
We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$S be a spanner of a weighted graph $$G$$G. Roughly speaking, we say that $$S$$S is resilient if all its point-to-point distances are resilient to edge failures. Namel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9d0e13e8afefed1e14348bca40b78a5
http://hdl.handle.net/11573/535384
http://hdl.handle.net/11573/535384