FRIGIONI, DANIELE
 Distribuzione geografica
Continente #
NA - Nord America 5.455
AS - Asia 3.054
EU - Europa 2.814
SA - Sud America 249
AF - Africa 35
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 8
Totale 11.625
Nazione #
US - Stati Uniti d'America 5.372
SG - Singapore 1.201
CN - Cina 757
IE - Irlanda 647
TR - Turchia 506
RU - Federazione Russa 503
IT - Italia 361
DE - Germania 302
SE - Svezia 273
HK - Hong Kong 246
BR - Brasile 212
GB - Regno Unito 212
UA - Ucraina 196
VN - Vietnam 186
FR - Francia 127
FI - Finlandia 107
CA - Canada 52
IN - India 42
BE - Belgio 23
JP - Giappone 23
BD - Bangladesh 20
MX - Messico 17
AR - Argentina 14
IQ - Iraq 13
ZA - Sudafrica 13
PL - Polonia 12
ES - Italia 11
NL - Olanda 10
AU - Australia 7
NP - Nepal 6
PH - Filippine 6
PK - Pakistan 6
RO - Romania 6
AE - Emirati Arabi Uniti 5
CO - Colombia 5
EG - Egitto 5
EU - Europa 5
IL - Israele 5
MD - Moldavia 5
EC - Ecuador 4
KE - Kenya 4
KR - Corea 4
MA - Marocco 4
MY - Malesia 4
PY - Paraguay 4
UZ - Uzbekistan 4
VE - Venezuela 4
A2 - ???statistics.table.value.countryCode.A2??? 3
CR - Costa Rica 3
JM - Giamaica 3
JO - Giordania 3
KZ - Kazakistan 3
NZ - Nuova Zelanda 3
AL - Albania 2
CL - Cile 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
DZ - Algeria 2
GT - Guatemala 2
HU - Ungheria 2
LT - Lituania 2
NO - Norvegia 2
PE - Perù 2
QA - Qatar 2
TH - Thailandia 2
TN - Tunisia 2
AT - Austria 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BO - Bolivia 1
BS - Bahamas 1
BY - Bielorussia 1
CG - Congo 1
DM - Dominica 1
DO - Repubblica Dominicana 1
EE - Estonia 1
ET - Etiopia 1
GA - Gabon 1
GE - Georgia 1
GY - Guiana 1
HN - Honduras 1
ID - Indonesia 1
IR - Iran 1
KG - Kirghizistan 1
KH - Cambogia 1
LB - Libano 1
MN - Mongolia 1
NI - Nicaragua 1
OM - Oman 1
PR - Porto Rico 1
RS - Serbia 1
SA - Arabia Saudita 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
TG - Togo 1
Totale 11.625
Città #
Dallas 950
Jacksonville 763
Singapore 726
Dublin 646
Chandler 604
San Jose 485
Hong Kong 244
Boardman 236
Ashburn 226
Santa Clara 225
Nanjing 190
Izmir 185
The Dalles 127
San Mateo 124
Wilmington 106
Council Bluffs 105
Lawrence 97
Princeton 97
L’Aquila 94
Moscow 94
New York 86
Beijing 71
Ann Arbor 66
Ho Chi Minh City 65
Nanchang 65
Lauterbourg 64
Milan 62
L'aquila 55
Hanoi 50
Munich 47
Woodbridge 42
Shenyang 41
Los Angeles 40
Hangzhou 34
Tianjin 33
Hebei 31
Mountain View 30
Seattle 28
Jiaxing 25
São Paulo 25
Kunming 23
Brussels 22
Hefei 20
Orem 20
San Francisco 20
Tokyo 20
Berlin 19
Frankfurt am Main 17
Ottawa 17
Pescara 17
Shanghai 16
Verona 16
Des Moines 14
Helsinki 14
Norwalk 13
Changsha 12
Chennai 12
Jinan 12
Lanzhou 12
Montreal 12
Columbus 11
Guangzhou 11
London 11
Rio de Janeiro 11
Ankara 10
Haiphong 10
Warsaw 10
Chicago 9
Falkenstein 9
Rome 9
Zhengzhou 9
Houston 8
Toronto 8
Atlanta 7
Brooklyn 7
Changchun 7
Denver 7
Johannesburg 7
Bologna 6
Da Nang 6
Istanbul 6
Mexico City 6
Poplar 6
Turku 6
Amsterdam 5
Biên Hòa 5
Boston 5
Chisinau 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
Totale 7.883
Nome #
A New HW/SW Co-Design Approach for Monitored Systems-on-Chip Development 570
A Fully Dynamic Algorithm for Distributed Shortest Paths 201
Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms 181
Engineering graph-based models for dynamic timetable information systems 174
Distance queries in large-scale fully dynamic complex networks 166
Recoverable robustness in shunting and timetabling 147
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 147
Explore and repair graphs with black holes using mobile entities 144
Rigorous DC Solution of Partial Element Equivalent Circuit Models 144
On the clustered shortest-path tree problem 141
Fully dynamic 2-hop cover labeling 140
Hybrid Formulation of the Equation Systems of the 3-D PEEC Model Based on Graph Algorithms 138
Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs 136
Efficient algorithms for distributed shortest paths on power-law networks 136
Delay Management Problem: Complexity Results and Robust Algorithms 135
Tariff regulation of the integrated water service: an Italian case 134
Interacting with Topological Invariants of Spatial Databases 132
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 131
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks 131
Improved protocols for luminous asynchronous robots 130
Characterizing the Computational Power of Anonymous Mobile Robots 129
Characterizing the Computational Power of Mobile Robots on Graphs and Implications for the Euclidean Plane 129
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 127
Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems” 127
A Loop-free Shortest-path Routing Algorithm for Dynamic Networks 124
Exploring and Making Safe Dangerous Networks using Mobile Entities 121
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation 120
A uniform approach to semi-dynamic problems on digraphs 119
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem 119
VISTO: A new CBIR system for vector images 118
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study 117
Engineering a new loop-free shortest paths routing algorithm 117
Journey Planning Algorithms for Massive Delay-Prone Transit Networks 116
Engineering Graph-Based Models for Dynamic Timetable Information Systems 116
A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation 115
Dynamic Update of Minimum Cost Paths in Computer Networks 113
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 113
A tool for automatically selecting optimal model transformation chains 113
On mining distances in large-scale dynamic graphs 113
Supporting a Focus+Context Interaction Style for Spatial Databases 112
Dynamic Maintenance of Arc-Flags in Road Networks 111
Exploration of Geographic Databases: Supporting a Focus+Context Interaction Style 111
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. 111
Semi Dynamic Algorithms for Maintaining Single Source Shortest Paths Trees 110
An Experimental Study of Dynamic Algorithms for Transitive Closure 110
Partially dynamic efficient algorithms for distributed shortest paths 109
Sentient Spaces: Intelligent Totem Use Case in the ECSEL FRACTAL Project 108
Counting edges in a DAG 108
A Fully Dynamic Algorithm for Distributed Shortest Paths 107
Incremental Algorithms for the Single Source Shortest Path Problem 106
Path-Fault-Tolerant Approximate Shortest-Path Trees 105
A Speed-up Technique for Distributed Shortest Paths Computation 105
Dynamically Switching Vertices in Planar Graphs 105
On Formal Aspects of Zooming in Geographic Maps 104
Dynamically Maintaining Shortest Path Trees under Batches of Updates 104
Pruning the Computation of Distributed Shortest Paths in Power-law Networks 104
A General Strategy for Decomposing Topological Invariants of Spatial Databases and an Application 103
Maintenance of Multi-level Overlay Graphs for Timetable Queries 103
Enhancing the computation of distributed shortest paths on real dynamic networks 103
Semi Dynamic Breadth First Search in Digraphs 102
Dynamic Algorithms for Classes of Constraint Satisfaction Problems 102
Tuning a CBIR System for vector images: the interface support 102
Decomposing Spatial Databases and Applications 102
Multiple Zooming in Geographic Maps 102
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Paths Problem 101
Robust Algorithms and Price of Robustness in Shunting Problems 101
Preface 100
Dynamically Switching Vertices in Planar Graphs 100
Partially Dynamic Concurrent Update of Distributed Shortest Paths 100
Semi-Dynamic Shortest Paths and Breadth First Search in Digraphs 99
Directed Hypergraphs: Problems, Algorithmic Results and a General Decremental Approach 99
A Visual Environment for Tuning a Content-Based Vector Image Retrieval Engine 97
Interacting with Geographic Databases: a Focus+Context Approach 97
Partially Dynamic Maintenance of Minimum Weight Hyperpaths 96
On the formalization of zoom-based interaction with geographic databases 96
Fully Dynamic Output Bounded Single Source Shortest Paths Problem 95
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae 95
A mixed nodal-mesh formulation of the PEEC method based on efficient graph algorithms 94
Interactive Poster: A Zooming Model for Geographic Maps 94
Engineering a new algorithm for distributed shortest paths on dynamic networks 94
Dynamization of the Backtrack-free Search for the Constraint Satisfaction Problem 94
Dynamic Arc Flags in Road Networks 94
Evaluation of a CBIR System for Vector Images 93
Robust Algorithms and Price of Robustness in Shunting Problems 93
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem 91
Proceedings 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) 90
Evaluation of VISTO: a new Vector Image Search Tool 90
System-Level Timing Performance Estimation Based on a Unifying HW/SW Performance Metric 89
Fully Dynamic Update of Arc-Flags 89
Fully Dynamic Shortest Paths and Negative Cycle Detection in Digraphs with Arbitrary Arc Weights 89
Dynamic multi-level overlay graphs for shortest paths 88
On the Dynamization of Shortest Path Overlay Graphs 88
Fully Dynamic Shortest Paths in Digraphs with Arbitrary Arc Weights 88
Engineering Shortest-Path Algorithms for Dynamic Networks 87
An experimental study of distributed algorithms for shortest paths on real networks 87
Evaluating the Effectiveness and the Efficiency of a Vector Image Search Tool 87
A Zooming Model for Geographic Maps 86
SLIDE-x-ML: System-Level Infrastructure for Dataset E-xtraction and Machine Learning Framework for High-Level Synthesis Estimations 85
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees 85
An Experimental Study of Dynamic Algorithms for Directed Graph 85
Totale 11.609
Categoria #
all - tutte 45.302
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 45.302


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202129 0 0 0 0 0 0 0 0 0 0 0 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/20263.834 138 446 710 418 262 257 536 112 264 449 195 47
Totale 11.761