IRIS
CICERONE, SERAFINO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.089
EU - Europa 1.945
AS - Asia 1.270
SA - Sud America 30
OC - Oceania 8
AF - Africa 5
Continente sconosciuto - Info sul continente non disponibili 3
Totale 6.350
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.072
IE - Irlanda 692
CN - Cina 462
SG - Singapore 427
TR - Turchia 338
SE - Svezia 319
IT - Italia 294
DE - Germania 181
UA - Ucraina 149
GB - Regno Unito 145
FI - Finlandia 82
FR - Francia 45
BR - Brasile 27
IN - India 17
BE - Belgio 14
CA - Canada 13
AU - Australia 6
HK - Hong Kong 5
IL - Israele 5
RU - Federazione Russa 4
EU - Europa 3
JP - Giappone 3
MX - Messico 3
RO - Romania 3
TN - Tunisia 3
AT - Austria 2
DK - Danimarca 2
EC - Ecuador 2
ES - Italia 2
IQ - Iraq 2
KR - Corea 2
NZ - Nuova Zelanda 2
PT - Portogallo 2
VN - Vietnam 2
AR - Argentina 1
AZ - Azerbaigian 1
BD - Bangladesh 1
BG - Bulgaria 1
BH - Bahrain 1
CZ - Repubblica Ceca 1
EE - Estonia 1
HU - Ungheria 1
IR - Iran 1
KH - Cambogia 1
KZ - Kazakistan 1
LU - Lussemburgo 1
MA - Marocco 1
MD - Moldavia 1
NL - Olanda 1
NO - Norvegia 1
PA - Panama 1
PL - Polonia 1
SY - Repubblica araba siriana 1
ZA - Sudafrica 1
Totale 6.350
Salva come PNG Salva come JPEG
Città #
Dublin 690
Jacksonville 602
Chandler 580
Singapore 361
Santa Clara 224
Boardman 210
Izmir 170
L’Aquila 163
Nanjing 128
Wilmington 109
San Mateo 98
Lawrence 88
Princeton 88
New York 83
Ashburn 81
Woodbridge 59
Ann Arbor 58
Nanchang 47
Milan 35
Beijing 34
Los Angeles 31
Mountain View 29
Kunming 26
Jiaxing 25
Shenyang 25
Hebei 23
North Bergen 23
L'aquila 19
Tianjin 19
Verona 19
Houston 18
Seattle 18
Des Moines 17
Kitzingen 16
Helsinki 14
Norwalk 14
Dallas 13
Falls Church 13
Brussels 12
Jinan 9
Changchun 8
Hangzhou 8
Pescara 8
Changsha 7
Ningbo 7
Ottawa 7
Taizhou 7
Zhengzhou 7
Dearborn 6
Foggia 6
Pune 6
Auburn Hills 5
Grafing 5
Guangzhou 5
Lappeenranta 5
Shanghai 5
Chengdu 4
Fremont 4
Lanzhou 4
Paris 4
Redmond 4
Shenzhen 4
Venezia 4
Cedar Knolls 3
Düsseldorf 3
Haikou 3
Toronto 3
Wuhan 3
Baldissero Torinese 2
Berlin 2
Cambridge 2
Dong Ket 2
Fairfield 2
Fuzhou 2
Greenwich 2
Harbin 2
Hefei 2
Lawrenceville 2
Lisbon 2
Madrid 2
Melbourne 2
Orange 2
Perugia 2
Philadelphia 2
Rome 2
São Paulo 2
Tappahannock 2
West Jordan 2
Acton 1
Almaty 1
Andover 1
Anshan 1
Anyang 1
Aryanah 1
Atlanta 1
Auckland 1
Baghdad 1
Baku 1
Bangalore 1
Barra Mansa 1
Totale 4.488
Salva come PNG Salva come JPEG
Nome #
(k,+)-distance hereditary graphs (extended abstract) 168
A Fully Dynamic Algorithm for Distributed Shortest Paths 166
Asynchronous embedded pattern formation without orientation 135
Gathering of Robots on Meeting-Points 99
Recoverable robustness in shunting and timetabling 98
Cardinal directions between spatial objects: the pairwise-consistency problem 95
Gathering a swarm of robots through shortest paths 92
Interacting with Topological Invariants of Spatial Databases 89
Cavities’ Identification Algorithm for Power Integrity Analysis of Complex Boards 88
Delay Management Problem: Complexity Results and Robust Algorithms 85
Decomposing Octilinear Polygons into Triangles and Rectangles 85
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach 83
Minimum-Traveled-Distance Gathering of Oblivious Robots over given Meeting Points 82
Graphs with bounded induced distance 81
Graph classes between parity and distance-hereditary graphs 81
Graphs with bounded induced distance 80
Fast and Simple Approach for Polygon Schematization 80
Multi-stage recovery robustness for optimization problems: a new concept for planning under disturbances 80
(k,+)-distance-hereditary graphs 80
MinMax-Distance Gathering on given Meeting Points 79
Static and Dynamic Low-Congested Interval Routing Schemes 79
Compact-port routing models and applications to distance-hereditary graphs 79
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation 78
Networks with Small Stretch Number 77
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 76
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms 76
A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation 75
Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract). 75
On the complexity of specification morphisms 75
Self-spanner graphs 74
Cardinal relations between regions with a broad boundary 74
Characterizations of Graphs with Stretch Number less than 2 73
On the equivalence in complexity among basic problems on bipartite and parity graphs 72
Maintenance of Multi-level Overlay Graphs for Timetable Queries 72
Decomposing Spatial Databases and Applications 72
Robust Algorithms and Price of Robustness in Shunting Problems 72
Solving the Pattern Formation by Mobile Robots with Chirality 72
Recoverable Robustness for Train Shunting Problems 70
A uniform approach to semi-dynamic problems on digraphs 70
Exploration of Geographic Databases: Supporting a Focus+Context Interaction Style 70
Gathering robots in graphs: The central role of synchronicity 70
Asynchronous Robots on graphs: Gathering 69
Counting edges in a DAG 68
Graph classes between parity and distance-hereditary graphs 68
Engineering a new algorithm for distributed shortest paths on dynamic networks 67
Efficient estimation of qualitative topological relations based on the weighted walkthroughs model 67
Survivable Networks with Bounded Delay: The Edge Failure Case 66
Partially Dynamic Concurrent Update of Distributed Shortest Paths 66
Cardinal directions between spatial objects: the pairwise-consistency problem (extended abstract) 65
Approximation algorithms for decomposing octilinear polygons 65
A Fully Dynamic Algorithm for Distributed Shortest Paths 64
Robust Algorithms and Price of Robustness in Shunting Problems 63
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements 63
Decomposing Spatial Databases with Applications 62
Embedded pattern formation by asynchronous robots without chirality 62
Supporting a Focus+Context Interaction Style for Spatial Databases 61
Dynamic Algorithms for Recoverable Robustness Problems 61
Interacting with Geographic Databases: a Focus+Context Approach 61
Partially dynamic efficient algorithms for distributed shortest paths 60
On mining distances in large-scale dynamic graphs 60
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs 59
Strategies in Modular System Design by Interface Rewriting 59
Extraction of Qualitative Information from the Weighted Walkthroughs 59
Static and Dynamic Low-Congested Interval Routing Schemes 59
“Semi-Asynchronous”: a new scheduler in distributed computing 58
A General Strategy for Decomposing Topological Invariants of Spatial Databases and an Application 56
Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies 56
On the effectiveness of the genetic paradigm for polygonization 56
On the Extension of Bipartite to Parity Graphs 55
On the formalization of zoom-based interaction with geographic databases 55
Asynchronous rendezvous with different maps 55
Partially dynamic efficient algorithms for distributed shortest paths 54
Networks with small stretch number 53
Special Issue on “Graph Algorithms and Applications” 53
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem 53
On the Dynamization of Shortest Path Overlay Graphs 52
"Semi-Asynchronous": A new scheduler for robot based computing systems 52
Dynamic multi-level overlay graphs for shortest paths 51
On Building Networks with Limited Stretch Factor 51
Low Congested Interval Routing Schemes for Hypercube-Like Networks 50
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs 50
Breaking symmetries on tessellation graphs via asynchronous robots: The line formation problem as a case study 47
On Gathering of Semi-synchronous Robots in Graphs 46
A structured methodology for designing distributed algorithms for mobile entities 45
MOBLOT: Molecular oblivious robots 45
Getting new algorithmic results by extending distance-hereditary graphs via split composition 44
Arbitrary pattern formation on infinite regular tessellation graphs 37
Breaking symmetries on tessellation graphs via asynchronous robots 34
A quasi-hole detection algorithm for recognizing k-distance-hereditary graphs, with k < 2 32
On the mutual visibility in Cartesian products and triangle-free graphs 30
Distributed Computing and Artificial Intelligence, 19th International Conference 29
Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities 28
Molecular Robots with Chirality on Grids 27
The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees 25
Variety of mutual-visibility problems in graphs 20
The geodesic mutual visibility problem: Oblivious robots on grids and trees 19
Molecular pattern formation on grids in the MOBLOT model 19
Mutual-visibility in strong products of graphs via total mutual-visibility 18
Mutual-visibility problems on graphs of diameter two 16
Mutual-visibility in distance-hereditary graphs: A linear-time algorithm 14
Totale 6.416
Salva come PNG Salva come JPEG
Categoria #
all - tutte 27.136
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 27.136
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020318 0 0 0 0 0 0 111 7 80 16 26 78
2020/2021672 6 75 0 80 78 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/2025949 127 59 173 105 287 196 2 0 0 0 0 0
Totale 6.461