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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/20264.381 165 354 445 521 407 341 700 160 357 597 224 110
2026/2027104 104 0 0 0 0 0 0 0 0 0 0 0
Totale 12.193