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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020480 0 0 79 6 5 72 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/2025213 127 59 27 0 0 0 0 0 0 0 0 0
Totale 5.725