default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Ribichini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Irene Finocchi
, Andrea Ribichini, Marco Schaerf:
An analysis of international mobility and research productivity in computer science. Scientometrics 128(11): 6147-6175 (2023)- 2022
- [j14]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
Which Conference Is That? A Case Study in Computer Science. ACM J. Data Inf. Qual. 14(3): 18:1-18:13 (2022) - [j13]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
On computer science research and its temporal evolution. Scientometrics 127(8): 4913-4938 (2022) - [i6]Giorgio Ausiello, Lorenzo Balzotti, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs. CoRR abs/2204.10568 (2022) - 2020
- [j12]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy. Scientometrics 124(3): 2207-2228 (2020) - [j11]Camil Demetrescu, Andrea Ribichini, Marco Schaerf:
Are Italian research assessment exercises size-biased? Scientometrics 125(1): 533-549 (2020) - [i5]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max-flow vitality in undirected unweighted planar graphs. CoRR abs/2011.02375 (2020)
2010 – 2019
- 2019
- [j10]Camil Demetrescu, Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
On the Shapley value and its application to the Italian VQR research assessment exercise. J. Informetrics 13(1): 87-104 (2019) - [j9]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and st-planar graphs. Networks 74(1): 70-78 (2019) - 2018
- [j8]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program. J. Exp. Theor. Artif. Intell. 30(4): 505-524 (2018) - [j7]Camil Demetrescu, Andrea Ribichini, Marco Schaerf:
Accuracy of author names in bibliographic data sources: an Italian case study. Scientometrics 117(3): 1777-1791 (2018) - 2017
- [i4]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program. CoRR abs/1709.04176 (2017) - [i3]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and planar graphs. CoRR abs/1710.01965 (2017) - 2016
- [j6]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Resilient Graph Spanners. Algorithmica 74(4): 1363-1385 (2016) - [c7]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program. RCRA@AI*IA 2016: 27-43 - 2014
- [j5]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive Imperative Programming with Dataflow Constraints. ACM Trans. Program. Lang. Syst. 37(1): 3:1-3:53 (2014) - 2013
- [c6]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini:
On Resilient Graph Spanners. ESA 2013: 85-96 - [i2]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Robust Graph Spanners. CoRR abs/1303.1559 (2013) - 2011
- [c5]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive imperative programming with dataflow constraints. OOPSLA 2011: 407-426 - [i1]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive Imperative Programming with Dataflow Constraints. CoRR abs/1104.2293 (2011) - 2010
- [j4]Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Discret. Math. Algorithms Appl. 2(4): 591-606 (2010) - [j3]Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini:
Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411(44-46): 3994-4004 (2010) - [c4]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON 2010: 160-172
2000 – 2009
- 2009
- [j2]Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55(2): 346-374 (2009) - [j1]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Trading off space for passes in graph streaming problems. ACM Trans. Algorithms 6(1): 6:1-6:17 (2009) - 2007
- [c3]Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA 2007: 605-617 - [c2]Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini:
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. MFCS 2007: 194-205 - 2006
- [c1]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Trading off space for passes in graph streaming problems. SODA 2006: 714-723
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
