CICERONE, SERAFINO
 Distribuzione geografica
Continente #
NA - Nord America 4.309
AS - Asia 2.621
EU - Europa 2.427
SA - Sud America 376
AF - Africa 34
OC - Oceania 9
Continente sconosciuto - Info sul continente non disponibili 4
Totale 9.780
Nazione #
US - Stati Uniti d'America 4.237
SG - Singapore 1.214
IE - Irlanda 693
CN - Cina 599
IT - Italia 371
TR - Turchia 348
BR - Brasile 334
SE - Svezia 327
RU - Federazione Russa 242
HK - Hong Kong 235
DE - Germania 225
GB - Regno Unito 172
UA - Ucraina 150
FI - Finlandia 103
VN - Vietnam 71
FR - Francia 50
IN - India 44
CA - Canada 41
PL - Polonia 22
BD - Bangladesh 20
JP - Giappone 18
MX - Messico 18
BE - Belgio 17
IQ - Iraq 15
ES - Italia 14
AR - Argentina 13
ZA - Sudafrica 13
AT - Austria 7
AU - Australia 7
EC - Ecuador 7
VE - Venezuela 7
CL - Cile 6
NL - Olanda 6
AE - Emirati Arabi Uniti 5
IL - Israele 5
JO - Giordania 5
KE - Kenya 5
UZ - Uzbekistan 5
CZ - Repubblica Ceca 4
ID - Indonesia 4
LT - Lituania 4
PK - Pakistan 4
PY - Paraguay 4
CO - Colombia 3
DO - Repubblica Dominicana 3
EU - Europa 3
KR - Corea 3
KW - Kuwait 3
MA - Marocco 3
PH - Filippine 3
PT - Portogallo 3
RO - Romania 3
SA - Arabia Saudita 3
TN - Tunisia 3
BG - Bulgaria 2
CR - Costa Rica 2
DK - Danimarca 2
DZ - Algeria 2
EG - Egitto 2
ET - Etiopia 2
MY - Malesia 2
NP - Nepal 2
NZ - Nuova Zelanda 2
OM - Oman 2
PA - Panama 2
PE - Perù 2
SY - Repubblica araba siriana 2
UG - Uganda 2
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BH - Bahrain 1
CG - Congo 1
DM - Dominica 1
EE - Estonia 1
GE - Georgia 1
GP - Guadalupe 1
GT - Guatemala 1
HU - Ungheria 1
IR - Iran 1
JM - Giamaica 1
KH - Cambogia 1
KZ - Kazakistan 1
LU - Lussemburgo 1
LV - Lettonia 1
MD - Moldavia 1
MK - Macedonia 1
NO - Norvegia 1
PR - Porto Rico 1
PS - Palestinian Territory 1
QA - Qatar 1
SI - Slovenia 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
TT - Trinidad e Tobago 1
TW - Taiwan 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 9.780
Città #
Singapore 760
Dublin 690
Jacksonville 602
Chandler 580
Dallas 565
Santa Clara 239
Hong Kong 229
Boardman 210
Ashburn 170
Izmir 170
L’Aquila 168
Nanjing 128
New York 116
Wilmington 109
San Mateo 98
Lawrence 88
Princeton 88
The Dalles 79
Beijing 65
Los Angeles 60
Woodbridge 59
Ann Arbor 58
Moscow 58
Milan 53
Nanchang 47
Columbus 37
Munich 36
São Paulo 31
Hefei 30
Mountain View 29
Jiaxing 26
Kunming 26
Shenyang 25
Hebei 23
North Bergen 23
Seattle 22
Ho Chi Minh City 21
Warsaw 21
Council Bluffs 20
Houston 20
L'aquila 19
Rome 19
Tianjin 19
Verona 19
Des Moines 18
Hanoi 18
Helsinki 17
Kitzingen 16
Brussels 15
Los Lunas 15
Atlanta 14
Norwalk 14
San Jose 14
Falls Church 13
Springfield 13
Tokyo 13
Belo Horizonte 12
Chennai 12
Lappeenranta 12
Montreal 12
Toronto 12
Brooklyn 11
Prineville 11
Turku 11
Johannesburg 10
Rio de Janeiro 10
Altoona 9
Fort Worth 9
Jinan 9
Brasília 8
Changchun 8
Hangzhou 8
Pescara 8
Phoenix 8
Stockholm 8
Baghdad 7
Changsha 7
Ningbo 7
Ottawa 7
Taizhou 7
Zhengzhou 7
Campinas 6
Dearborn 6
Denver 6
Foggia 6
Garland 6
Manchester 6
Orem 6
Paris 6
Pune 6
San Francisco 6
Amman 5
Amsterdam 5
Ancona 5
Ankara 5
Auburn Hills 5
Chicago 5
Dhaka 5
Grafing 5
Guangzhou 5
Totale 6.470
Nome #
(k,+)-distance hereditary graphs (extended abstract) 203
Asynchronous embedded pattern formation without orientation 201
A Fully Dynamic Algorithm for Distributed Shortest Paths 183
Optimal gathering of robots in anonymous butterfly networks via leader election 162
Gathering a swarm of robots through shortest paths 140
On the effectiveness of the genetic paradigm for polygonization 136
Recoverable robustness in shunting and timetabling 131
Gathering of Robots on Meeting-Points 126
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach 124
(k,+)-distance-hereditary graphs 122
Gathering robots in graphs: The central role of synchronicity 117
Cardinal directions between spatial objects: the pairwise-consistency problem 117
Interacting with Topological Invariants of Spatial Databases 113
Delay Management Problem: Complexity Results and Robust Algorithms 111
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms 111
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 110
Cavities’ Identification Algorithm for Power Integrity Analysis of Complex Boards 110
“Semi-Asynchronous”: a new scheduler in distributed computing 110
Graphs with bounded induced distance 109
Graphs with bounded induced distance 108
Static and Dynamic Low-Congested Interval Routing Schemes 108
Solving the Pattern Formation by Mobile Robots with Chirality 107
Graph classes between parity and distance-hereditary graphs 106
Decomposing Octilinear Polygons into Triangles and Rectangles 106
Compact-port routing models and applications to distance-hereditary graphs 106
Fast and Simple Approach for Polygon Schematization 104
Multi-stage recovery robustness for optimization problems: a new concept for planning under disturbances 104
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements 104
Minimum-Traveled-Distance Gathering of Oblivious Robots over given Meeting Points 102
On the complexity of specification morphisms 102
Recoverable Robustness for Train Shunting Problems 101
Arbitrary pattern formation on infinite regular tessellation graphs 100
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation 100
MinMax-Distance Gathering on given Meeting Points 99
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem 99
Self-spanner graphs 98
A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation 98
Networks with Small Stretch Number 98
Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract). 96
A uniform approach to semi-dynamic problems on digraphs 95
Asynchronous Robots on graphs: Gathering 95
Embedded pattern formation by asynchronous robots without chirality 95
Supporting a Focus+Context Interaction Style for Spatial Databases 94
Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies 94
Asynchronous rendezvous with different maps 94
A Fully Dynamic Algorithm for Distributed Shortest Paths 93
Cardinal relations between regions with a broad boundary 93
Exploration of Geographic Databases: Supporting a Focus+Context Interaction Style 92
"Semi-Asynchronous": A new scheduler for robot based computing systems 92
Approximation algorithms for decomposing octilinear polygons 92
Characterizations of Graphs with Stretch Number less than 2 92
Counting edges in a DAG 91
Maintenance of Multi-level Overlay Graphs for Timetable Queries 91
Dynamic Algorithms for Recoverable Robustness Problems 91
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs 91
Partially dynamic efficient algorithms for distributed shortest paths 90
Graph classes between parity and distance-hereditary graphs 90
Survivable Networks with Bounded Delay: The Edge Failure Case 90
Robust Algorithms and Price of Robustness in Shunting Problems 90
On the equivalence in complexity among basic problems on bipartite and parity graphs 88
Decomposing Spatial Databases and Applications 88
On mining distances in large-scale dynamic graphs 88
Partially Dynamic Concurrent Update of Distributed Shortest Paths 88
Efficient estimation of qualitative topological relations based on the weighted walkthroughs model 86
Engineering a new algorithm for distributed shortest paths on dynamic networks 85
Cardinal directions between spatial objects: the pairwise-consistency problem (extended abstract) 84
A structured methodology for designing distributed algorithms for mobile entities 83
On the Extension of Bipartite to Parity Graphs 82
Robust Algorithms and Price of Robustness in Shunting Problems 82
Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities 81
Strategies in Modular System Design by Interface Rewriting 81
Static and Dynamic Low-Congested Interval Routing Schemes 80
MOBLOT: Molecular oblivious robots 80
A General Strategy for Decomposing Topological Invariants of Spatial Databases and an Application 79
Interacting with Geographic Databases: a Focus+Context Approach 79
The geodesic mutual visibility problem: Oblivious robots on grids and trees 77
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs 77
Decomposing Spatial Databases with Applications 77
On the Dynamization of Shortest Path Overlay Graphs 77
Extraction of Qualitative Information from the Weighted Walkthroughs 77
Breaking symmetries on tessellation graphs via asynchronous robots: The line formation problem as a case study 77
On Building Networks with Limited Stretch Factor 75
Dynamic multi-level overlay graphs for shortest paths 74
On the formalization of zoom-based interaction with geographic databases 74
Getting new algorithmic results by extending distance-hereditary graphs via split composition 74
The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees 73
Networks with small stretch number 73
Partially dynamic efficient algorithms for distributed shortest paths 71
Mutual-visibility problems on graphs of diameter two 70
Special Issue on “Graph Algorithms and Applications” 70
Molecular pattern formation on grids in the MOBLOT model 67
Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs 66
Molecular Robots with Chirality on Grids 66
Low Congested Interval Routing Schemes for Hypercube-Like Networks 66
On Gathering of Semi-synchronous Robots in Graphs 66
A quasi-hole detection algorithm for recognizing k-distance-hereditary graphs, with k < 2 66
On the mutual visibility in Cartesian products and triangle-free graphs 65
Gathering of Robots in Butterfly Networks 64
Variety of mutual-visibility problems in graphs 64
Distributed Computing and Artificial Intelligence, 19th International Conference 59
Totale 9.526
Categoria #
all - tutte 41.673
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 41.673


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021433 0 0 0 0 0 38 83 0 81 54 140 37
2021/2022617 44 51 117 49 39 11 22 28 39 8 29 180
2022/20231.733 131 87 31 161 142 182 6 94 818 7 36 38
2023/2024647 219 24 25 60 28 165 13 21 2 44 11 35
2024/20252.196 127 59 173 105 287 196 293 226 382 81 136 131
2025/20262.194 165 354 445 521 407 302 0 0 0 0 0 0
Totale 9.902