FRIGIONI, DANIELE
 Distribuzione geografica
Continente #
NA - Nord America 4.548
AS - Asia 2.717
EU - Europa 2.421
SA - Sud America 233
AF - Africa 26
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 8
Totale 9.963
Nazione #
US - Stati Uniti d'America 4.481
SG - Singapore 1.101
CN - Cina 720
IE - Irlanda 644
TR - Turchia 505
IT - Italia 348
DE - Germania 290
SE - Svezia 273
HK - Hong Kong 239
RU - Federazione Russa 233
GB - Regno Unito 203
BR - Brasile 202
UA - Ucraina 196
FI - Finlandia 106
FR - Francia 54
VN - Vietnam 44
CA - Canada 43
IN - India 33
BE - Belgio 23
MX - Messico 17
AR - Argentina 14
IQ - Iraq 13
BD - Bangladesh 11
JP - Giappone 11
PL - Polonia 11
ZA - Sudafrica 10
ES - Italia 8
AU - Australia 7
NL - Olanda 6
RO - Romania 6
CO - Colombia 5
EG - Egitto 5
EU - Europa 5
IL - Israele 5
MD - Moldavia 5
PK - Pakistan 5
AE - Emirati Arabi Uniti 4
MA - Marocco 4
PY - Paraguay 4
UZ - Uzbekistan 4
A2 - ???statistics.table.value.countryCode.A2??? 3
EC - Ecuador 3
JO - Giordania 3
KE - Kenya 3
KR - Corea 3
KZ - Kazakistan 3
NP - Nepal 3
NZ - Nuova Zelanda 3
CR - Costa Rica 2
CZ - Repubblica Ceca 2
DZ - Algeria 2
HU - Ungheria 2
LT - Lituania 2
NO - Norvegia 2
PE - Perù 2
QA - Qatar 2
AT - Austria 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BO - Bolivia 1
CG - Congo 1
DK - Danimarca 1
DM - Dominica 1
DO - Repubblica Dominicana 1
EE - Estonia 1
ET - Etiopia 1
GT - Guatemala 1
GY - Guiana 1
IR - Iran 1
JM - Giamaica 1
KG - Kirghizistan 1
KH - Cambogia 1
MN - Mongolia 1
OM - Oman 1
PR - Porto Rico 1
RS - Serbia 1
SA - Arabia Saudita 1
SK - Slovacchia (Repubblica Slovacca) 1
TH - Thailandia 1
VE - Venezuela 1
Totale 9.963
Città #
Dallas 944
Jacksonville 763
Singapore 663
Dublin 644
Chandler 604
Hong Kong 238
Boardman 235
Santa Clara 208
Nanjing 190
Izmir 185
Ashburn 124
San Mateo 124
Wilmington 106
Lawrence 97
Princeton 97
L’Aquila 94
New York 79
Ann Arbor 66
Nanchang 65
Beijing 63
Milan 61
The Dalles 58
Moscow 57
L'aquila 55
Munich 46
Woodbridge 42
Shenyang 41
Hangzhou 34
Los Angeles 34
Tianjin 33
Hebei 31
Mountain View 30
Seattle 28
Jiaxing 25
São Paulo 25
Kunming 23
Brussels 22
Hefei 20
Berlin 19
Ottawa 16
Pescara 16
Verona 16
Shanghai 15
Des Moines 14
Helsinki 14
Norwalk 13
Changsha 12
Hanoi 12
Jinan 12
Lanzhou 12
Columbus 11
Council Bluffs 11
Guangzhou 11
Ho Chi Minh City 11
Montreal 11
Orem 11
San Francisco 11
Ankara 10
Rio de Janeiro 10
Falkenstein 9
Tokyo 9
Warsaw 9
Zhengzhou 9
Houston 8
London 8
Rome 8
Toronto 8
Brooklyn 7
Changchun 7
Chicago 7
Frankfurt am Main 7
Johannesburg 7
Bologna 6
Chennai 6
Denver 6
Mexico City 6
Poplar 6
Turku 6
Boston 5
Chisinau 5
Istanbul 5
Ningbo 5
Pune 5
Stockholm 5
Taizhou 5
Teramo 5
Wuhan 5
Ancona 4
Baghdad 4
Dearborn 4
Dhaka 4
Düsseldorf 4
Fremont 4
Haikou 4
Tashkent 4
Amsterdam 3
Andover 3
Aracaju 3
Atlanta 3
Auburn Hills 3
Totale 6.753
Nome #
A New HW/SW Co-Design Approach for Monitored Systems-on-Chip Development 538
A Fully Dynamic Algorithm for Distributed Shortest Paths 183
Distance queries in large-scale fully dynamic complex networks 148
Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms 147
Engineering graph-based models for dynamic timetable information systems 137
Recoverable robustness in shunting and timetabling 131
Explore and repair graphs with black holes using mobile entities 129
Rigorous DC Solution of Partial Element Equivalent Circuit Models 128
Fully dynamic 2-hop cover labeling 125
Hybrid Formulation of the Equation Systems of the 3-D PEEC Model Based on Graph Algorithms 123
On the clustered shortest-path tree problem 123
Characterizing the Computational Power of Anonymous Mobile Robots 121
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 121
Efficient algorithms for distributed shortest paths on power-law networks 121
Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs 116
Characterizing the Computational Power of Mobile Robots on Graphs and Implications for the Euclidean Plane 115
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks 115
Tariff regulation of the integrated water service: an Italian case 113
Interacting with Topological Invariants of Spatial Databases 113
A Loop-free Shortest-path Routing Algorithm for Dynamic Networks 113
Improved protocols for luminous asynchronous robots 113
Delay Management Problem: Complexity Results and Robust Algorithms 111
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 110
Engineering a new loop-free shortest paths routing algorithm 110
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 108
Exploring and Making Safe Dangerous Networks using Mobile Entities 107
Semi Dynamic Algorithms for Maintaining Single Source Shortest Paths Trees 105
Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems” 105
VISTO: A new CBIR system for vector images 101
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation 100
Engineering Graph-Based Models for Dynamic Timetable Information Systems 100
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 99
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem 99
A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation 98
Dynamic Update of Minimum Cost Paths in Computer Networks 97
Journey Planning Algorithms for Massive Delay-Prone Transit Networks 97
Dynamic Maintenance of Arc-Flags in Road Networks 96
Dynamically Switching Vertices in Planar Graphs 96
A uniform approach to semi-dynamic problems on digraphs 95
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study 95
Supporting a Focus+Context Interaction Style for Spatial Databases 94
A tool for automatically selecting optimal model transformation chains 94
A Fully Dynamic Algorithm for Distributed Shortest Paths 93
Incremental Algorithms for the Single Source Shortest Path Problem 93
Semi-Dynamic Shortest Paths and Breadth First Search in Digraphs 92
Exploration of Geographic Databases: Supporting a Focus+Context Interaction Style 92
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. 92
Multiple Zooming in Geographic Maps 92
Dynamic Algorithms for Classes of Constraint Satisfaction Problems 91
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Paths Problem 91
An Experimental Study of Dynamic Algorithms for Transitive Closure 91
Counting edges in a DAG 91
Preface 91
Dynamically Maintaining Shortest Path Trees under Batches of Updates 91
Maintenance of Multi-level Overlay Graphs for Timetable Queries 91
Semi Dynamic Breadth First Search in Digraphs 90
Partially dynamic efficient algorithms for distributed shortest paths 90
On Formal Aspects of Zooming in Geographic Maps 90
Robust Algorithms and Price of Robustness in Shunting Problems 90
Tuning a CBIR System for vector images: the interface support 89
A Speed-up Technique for Distributed Shortest Paths Computation 88
Decomposing Spatial Databases and Applications 88
On mining distances in large-scale dynamic graphs 88
Dynamic Arc Flags in Road Networks 88
Partially Dynamic Concurrent Update of Distributed Shortest Paths 88
Enhancing the computation of distributed shortest paths on real dynamic networks 87
Path-Fault-Tolerant Approximate Shortest-Path Trees 85
Engineering a new algorithm for distributed shortest paths on dynamic networks 85
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae 84
A Visual Environment for Tuning a Content-Based Vector Image Retrieval Engine 84
A mixed nodal-mesh formulation of the PEEC method based on efficient graph algorithms 83
Fully Dynamic Output Bounded Single Source Shortest Paths Problem 83
Pruning the Computation of Distributed Shortest Paths in Power-law Networks 82
Robust Algorithms and Price of Robustness in Shunting Problems 82
Interactive Poster: A Zooming Model for Geographic Maps 81
Directed Hypergraphs: Problems, Algorithmic Results and a General Decremental Approach 81
Partially Dynamic Maintenance of Minimum Weight Hyperpaths 80
Evaluating the Effectiveness and the Efficiency of a Vector Image Search Tool 80
Dynamically Switching Vertices in Planar Graphs 80
Dynamization of the Backtrack-free Search for the Constraint Satisfaction Problem 80
A General Strategy for Decomposing Topological Invariants of Spatial Databases and an Application 79
Fully Dynamic Shortest Paths in Digraphs with Arbitrary Arc Weights 79
Interacting with Geographic Databases: a Focus+Context Approach 79
Fully Dynamic Update of Arc-Flags 77
On the Dynamization of Shortest Path Overlay Graphs 77
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem 77
Sentient Spaces: Intelligent Totem Use Case in the ECSEL FRACTAL Project 76
An experimental study of distributed algorithms for shortest paths on real networks 76
Dynamic multi-level overlay graphs for shortest paths 74
A Zooming Model for Geographic Maps 74
On the formalization of zoom-based interaction with geographic databases 74
An Experimental Study of Dynamic Algorithms for Directed Graph 74
Evaluation of a CBIR System for Vector Images 74
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees 73
Engineering Shortest-Path Algorithms for Dynamic Networks 73
Evaluation of VISTO: a new Vector Image Search Tool 72
Fully Dynamic Shortest Paths and Negative Cycle Detection in Digraphs with Arbitrary Arc Weights 70
Preface 69
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study 66
Proceedings 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) 62
Totale 9.982
Categoria #
all - tutte 40.783
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 40.783


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021490 0 0 0 0 0 27 106 1 122 38 167 29
2021/2022619 38 53 88 47 35 12 15 24 38 6 40 223
2022/20231.770 136 104 35 167 153 177 3 99 817 6 42 31
2023/2024476 156 19 22 62 25 92 4 25 1 23 3 44
2024/20251.815 116 42 166 50 237 120 212 211 350 91 113 107
2025/20262.172 138 446 710 418 262 198 0 0 0 0 0 0
Totale 10.099