IRIS
Crescenzi, Pierluigi
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 289
EU - Europa 125
AS - Asia 14
Continente sconosciuto - Info sul continente non disponibili 3
OC - Oceania 1
Totale 432
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 289
DE - Germania 26
IT - Italia 26
SE - Svezia 25
UA - Ucraina 12
FR - Francia 10
IE - Irlanda 9
CZ - Repubblica Ceca 6
CN - Cina 5
FI - Finlandia 4
GB - Regno Unito 4
EU - Europa 3
SG - Singapore 3
CY - Cipro 2
AT - Austria 1
AU - Australia 1
IL - Israele 1
JP - Giappone 1
KH - Cambogia 1
NP - Nepal 1
RS - Serbia 1
RU - Federazione Russa 1
Totale 432
Salva come PNG Salva come JPEG
Città #
Chandler 59
Boardman 51
New York 25
Ashburn 23
Kitzingen 15
West Jordan 12
San Mateo 11
Ogden 10
Dublin 9
Los Angeles 8
Strasbourg 7
Turin 5
Helsinki 4
Miami 4
Brno 3
Hanover 3
Singapore 3
Suzhou 3
Wilmington 3
Chieti 2
Dallas 2
Limassol 2
London 2
Milan 2
Olomouc 2
Shanghai 2
Stuttgart 2
Venice 2
Belgrade 1
Charlotte 1
Clearwater 1
Edinburgh 1
Frankfurt am Main 1
Kathmandu 1
Munich 1
Nuremberg 1
Nîmes 1
Pescara 1
Phnom Penh 1
Prague 1
San Francisco 1
Tel Aviv 1
Vienna 1
Totale 291
Salva come PNG Salva come JPEG
Nome #
Greedily Improving Our Own Closeness Centrality in a Network 62
Improving the betweenness centrality of a node by adding links 44
Greedily improving our own centrality in a network 38
On Computing the Diameter of (Weighted) Link Streams 37
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs 34
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs 33
On computing Pareto optimal paths in weighted time-dependent networks 31
Public communication can facilitate low-risk coordination under surveillance 28
Simple and Fast Distributed Computation of Betweenness Centrality 27
Planning with Biological Neurons and Synapses 20
Proxying Betweenness Centrality Rankings in Temporal Networks 19
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks 18
On Computing the Diameter of (Weighted) Link Streams 17
Giant Components in Random Temporal Graphs 13
Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution 7
Problemi, algoritmi e coding. Le magie dell'informatica 5
The Way We Were: Structural Operational Semantics Research in Perspective 5
WorldDynamics.jl: A Julia Package for Developing and Simulating Integrated Assessment Models 5
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 4
Cophylogeny reconstruction via an approximate bayesian computation 3
EUCALYPT: efficient tree reconciliation enumerator 3
Computing top-k Closeness Centrality Faster in Unweighted Graphs 2
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 2
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems 2
An ant-colony based approach for real-time implicit collaborative information seeking 2
On the complexity of the shortest-path broadcast problem 2
Synchronous context-free grammars and optimal linear parsing strategies 1
MeDuSa: a multi-draft based scaffolder 1
Rumor spreading in random evolving graphs 1
Totale 466
Salva come PNG Salva come JPEG
Categoria #
all - tutte 4.550
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 4.550
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202140 0 0 10 1 0 2 5 1 6 2 1 12
2021/202251 2 0 1 25 4 0 1 0 2 2 12 2
2022/2023141 0 10 7 17 10 24 9 19 18 3 22 2
2023/2024233 3 11 37 15 12 36 4 15 0 31 41 28
2024/20251 1 0 0 0 0 0 0 0 0 0 0 0
Totale 466