IRIS
DI STEFANO, GABRIELE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.946
EU - Europa 2.848
AS - Asia 1.513
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 6
SA - Sud America 4
AF - Africa 2
Totale 8.326
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.929
IE - Irlanda 959
CN - Cina 781
TR - Turchia 503
SE - Svezia 494
IT - Italia 400
DE - Germania 284
UA - Ucraina 246
GB - Regno Unito 236
SG - Singapore 179
FI - Finlandia 121
FR - Francia 66
IN - India 27
BE - Belgio 15
CA - Canada 14
RU - Federazione Russa 9
IL - Israele 7
JP - Giappone 7
EU - Europa 6
AU - Australia 5
BR - Brasile 4
MX - Messico 3
NL - Olanda 3
RO - Romania 3
AT - Austria 2
ES - Italia 2
IR - Iran 2
KR - Corea 2
TW - Taiwan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
BG - Bulgaria 1
DK - Danimarca 1
EE - Estonia 1
HK - Hong Kong 1
IM - Isola di Man 1
LU - Lussemburgo 1
MA - Marocco 1
MD - Moldavia 1
MY - Malesia 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
PL - Polonia 1
SA - Arabia Saudita 1
SN - Senegal 1
Totale 8.326
Salva come PNG Salva come JPEG
Città #
Jacksonville 970
Dublin 959
Chandler 841
Izmir 251
Nanjing 225
Boardman 176
San Mateo 176
Singapore 165
L’Aquila 164
Wilmington 145
Lawrence 132
Princeton 132
Hangzhou 117
New York 112
Ashburn 107
Woodbridge 78
Beijing 68
Nanchang 63
Ann Arbor 61
L'aquila 53
Milan 53
Kunming 52
Shenyang 34
Tianjin 34
Verona 33
Jiaxing 31
Hebei 29
Des Moines 26
Los Angeles 26
Mountain View 26
Seattle 24
Kitzingen 20
Houston 19
Jinan 18
Ningbo 17
Norwalk 15
Dallas 14
Pescara 14
Santa Clara 14
Changsha 13
Falls Church 13
Helsinki 13
Brussels 12
Perugia 10
Lanzhou 9
Montesilvano Marina 9
Pune 9
Zhengzhou 9
Guangzhou 8
Auburn Hills 7
Shanghai 7
Grafing 6
Ottawa 6
Venezia 6
Changchun 5
Orange 5
Taizhou 5
Dearborn 4
Düsseldorf 4
Foggia 4
Fremont 4
Haikou 4
Paris 4
Rome 4
Toronto 4
Chengdu 3
Napoli 3
Redmond 3
Shenzhen 3
Tappahannock 3
Washington 3
Aprilia 2
Aquila 2
Baldissero Torinese 2
Berlin 2
Bremen 2
Buffalo 2
Cambridge 2
Edinburgh 2
Fairfield 2
Fuzhou 2
Gothenburg 2
Greenwich 2
Grotteria 2
Lappeenranta 2
Lawrenceville 2
Madrid 2
Mexico City 2
Philadelphia 2
Phoenix 2
Redwood City 2
West Jordan 2
Andover 1
Antwerpen 1
Atlanta 1
Auckland 1
Bangalore 1
Barrea 1
Boston 1
Brasov 1
Totale 5.746
Salva come PNG Salva come JPEG
Nome #
The Online Track Assignment Problem. 183
(k,+)-distance hereditary graphs (extended abstract) 160
A Fully Dynamic Algorithm for Distributed Shortest Paths 160
Gathering of Robots on Meeting-Points 94
Recoverable robustness in shunting and timetabling 92
Asynchronous embedded pattern formation without orientation 90
Gathering a swarm of robots through shortest paths 84
Track assignment 83
About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings 83
Decomposing Octilinear Polygons into Triangles and Rectangles 80
Delay Management Problem: Complexity Results and Robust Algorithms 78
Minimum-Traveled-Distance Gathering of Oblivious Robots over given Meeting Points 76
Graph classes between parity and distance-hereditary graphs 75
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach 75
Gathering of oblivious robots on infinite grids with minimum traveled distance 75
Graphs with bounded induced distance 74
Graphs with bounded induced distance 74
Min-Max Coverage in Multi-Interface Networks. 74
MinMax-Distance Gathering on given Meeting Points 74
Static and Dynamic Low-Congested Interval Routing Schemes 74
How to Gather Asynchronous Oblivious Robots on Anonymous Rings 72
Multi-stage recovery robustness for optimization problems: a new concept for planning under disturbances 72
Networks with Small Stretch Number 72
Compact-port routing models and applications to distance-hereditary graphs 72
Bamboo Garden Trimming Problem: Priority Schedulings 72
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation 71
Gathering Six Oblivious Robots on Anonymous Symmetric Rings” 71
What the Mantis shrimp's eye (possibly) tells its raptorial appendages 71
Computing on rings by oblivious robots: a unified approach for different tasks 70
Self-spanner graphs 69
A model for the dynamic properties of integrating fibers: target localization in a three-dimentional space - I mathematical description 69
An electronic system for integrated management of patients’ data and radiological images 69
Analysis and implementation of a vlsi neural network 69
Gathering of Six Robots on Anonymous Symmetric Rings. 69
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms 69
(k,+)-distance-hereditary graphs 69
A unified approach for different tasks on rings in robot-based computing systems 68
New results for neural networks and genetic algorithms in visual field diagnosis 68
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 67
Gathering of Robots on Anonymous Grids and Trees without Multiplicity Detection 67
On the equivalence in complexity among basic problems on bipartite and parity graphs 67
A routing algorithm for networks based on distance-hereditary topologies 67
Evaluation of recoverable-robust timetables on tree networks. 67
Robust Algorithms and Price of Robustness in Shunting Problems 67
Improved protocols for luminous asynchronous robots 67
The game of Scintillae: From cellular automata to computing and cryptography systems 66
A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation 66
Bandwidth constrained multi-interface networks. 66
Maintenance of Multi-level Overlay Graphs for Timetable Queries 66
Recoverable Robustness for Train Shunting Problems 65
Gathering on rings under the Look-Compute-Move model 65
Gathering of Robots on Anonymous Grids without Multiplicity Detection. 65
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings 65
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks 64
Platform assignment 64
A graph theoretical approach to the shunting problem. 64
A model for the dynamic properties of integrating fibers: target localization in a three-dimentional space - II computer simulation 63
A neural model for localizing targets in space accomplished by the eye of a Mantis shrimp 63
Engineering a new algorithm for distributed shortest paths on dynamic networks 63
A workstation for image processing and digitalization of conventional films 62
Treelike comparability graphs: Characterization, recognition and applications. 62
Consequences of limitation on weights in feed-forward multi-layer neural networks 62
A multimodal interface for a medical workstation 62
Graph classes between parity and distance-hereditary graphs 62
Online Bounded Coloring of Permutations and Overlap Graphs 61
Partially Dynamic Concurrent Update of Distributed Shortest Paths 61
Minimize the Maximum Duty in Multi-interface Networks 60
An Extension to the Back-Propagation Algorithm 60
Functional integration of digital radiological equipment 60
On the representation and management of medical records in a knowledge based systems 60
An Extension to the Back-Propagation Algorithm 60
On minimum $k$-modal partition of permutations 59
Milord: Advanced database technology for implementing a multimedia medical workstation 59
Distributed Positioning Algorithms for Ad-hoc Networks 59
Survivable Networks with Bounded Delay: The Edge Failure Case 59
Multi-Interface Wireless Networks: Complexity and Algorithms 57
Distributed positioning algorithm for ad-hoc networks. 57
Characterizing the Computational Power of Mobile Robots on Graphs and Implications for the Euclidean Plane 57
Asynchronous Robots on graphs: Gathering 57
Approximation algorithms for decomposing octilinear polygons 57
COFLEX: FLEXIBLE BRACELET ANTI COVID-19 to PROTECT CONSTRUCTION WORKERS 57
A Fully Dynamic Algorithm for Distributed Shortest Paths 56
Gathering robots in graphs: The central role of synchronicity 56
Robust Algorithms and Price of Robustness in Shunting Problems 55
Static and Dynamic Low-Congested Interval Routing Schemes 55
Dynamic Algorithms for Recoverable Robustness Problems 55
Distance-Hereditary Comparability Graphs 54
Flow problems in Multi-Interface Networks 54
Embedded pattern formation by asynchronous robots without chirality 54
On the online track assignment problem 53
Partially dynamic efficient algorithms for distributed shortest paths 53
Milord: Project result and future work. 53
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs 53
Recoverable Robust Timetables: An Algorithmic Approach on Trees 52
Optimal Gathering of Oblivious Robots in Anonymous Graphs 52
Target localization in different luminous environments 51
Recoverable-robust timetables for trains on single line corridors 51
Recoverable robust timetables on trees. 51
Partially dynamic efficient algorithms for distributed shortest paths 51
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model 50
Totale 6.813
Salva come PNG Salva come JPEG
Categoria #
all - tutte 31.276
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 31.276
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020811 0 6 148 8 8 128 158 13 147 11 45 139
2020/20211.083 32 122 1 128 126 55 129 1 129 78 229 53
2021/2022882 62 86 181 66 53 8 30 45 57 10 43 241
2022/20232.506 175 114 41 236 221 267 6 161 1.175 12 57 41
2023/2024824 243 42 34 110 39 214 12 24 3 42 14 47
2024/2025211 164 47 0 0 0 0 0 0 0 0 0 0
Totale 8.453