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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021234 0 0 0 0 0 0 0 0 0 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/20263.529 138 446 710 418 262 257 536 112 264 386 0 0
Totale 11.456