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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021177 0 0 0 0 0 0 0 0 0 0 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/20264.247 165 354 445 521 407 341 700 160 357 597 200 0
Totale 11.955