FRIGIONI, DANIELE
 Distribuzione geografica
Continente #
NA - Nord America 2.880
EU - Europa 1.987
AS - Asia 1.249
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 8
AF - Africa 1
Totale 6.135
Nazione #
US - Stati Uniti d'America 2.857
IE - Irlanda 650
CN - Cina 595
TR - Turchia 488
IT - Italia 280
SE - Svezia 267
DE - Germania 227
UA - Ucraina 195
GB - Regno Unito 179
SG - Singapore 125
FI - Finlandia 95
FR - Francia 50
BE - Belgio 23
CA - Canada 22
IN - India 22
AU - Australia 7
RO - Romania 6
EU - Europa 5
IL - Israele 5
MD - Moldavia 5
VN - Vietnam 4
A2 - ???statistics.table.value.countryCode.A2??? 3
KR - Corea 3
NZ - Nuova Zelanda 3
JP - Giappone 2
NO - Norvegia 2
PL - Polonia 2
RU - Federazione Russa 2
BD - Bangladesh 1
BG - Bulgaria 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
DM - Dominica 1
HK - Hong Kong 1
IQ - Iraq 1
MA - Marocco 1
NL - Olanda 1
PK - Pakistan 1
SA - Arabia Saudita 1
Totale 6.135
Città #
Jacksonville 763
Dublin 650
Chandler 604
Nanjing 190
Izmir 185
Boardman 137
San Mateo 124
Singapore 112
Wilmington 106
Lawrence 97
Princeton 97
L’Aquila 90
Ann Arbor 66
Nanchang 65
New York 60
L'aquila 55
Milan 49
Ashburn 44
Woodbridge 42
Shenyang 41
Beijing 33
Tianjin 33
Hangzhou 32
Hebei 31
Mountain View 30
Seattle 26
Jiaxing 25
Kunming 23
Brussels 22
Berlin 19
Ottawa 16
Verona 16
Des Moines 14
Norwalk 13
Changsha 12
Jinan 12
Lanzhou 12
Los Angeles 12
Guangzhou 11
Shanghai 11
Helsinki 9
Zhengzhou 9
Changchun 7
Houston 6
Chisinau 5
Dallas 5
Ningbo 5
Pescara 5
Pune 5
Taizhou 5
Teramo 5
Wuhan 5
Dearborn 4
Düsseldorf 4
Fremont 4
Haikou 4
Santa Clara 4
Andover 3
Auburn Hills 3
Chengdu 3
Chicago 3
Frankfurt am Main 3
Fuzhou 3
London 3
Napoli 3
Addison 2
Auckland 2
Bellante 2
Brasov 2
Dong Ket 2
Falls Church 2
Lawrenceville 2
Martino 2
Nuremberg 2
Oslo 2
Philadelphia 2
Redwood City 2
Shaoxing 2
Tappahannock 2
Vancouver 2
Venezia 2
West Jordan 2
Aquila 1
Baghdad 1
Cambridge 1
Cedar Knolls 1
Columbus 1
Dagenham 1
Dalian 1
Denver 1
Dhaka 1
Eden Prairie 1
Edmonton 1
Englewood 1
Evansville 1
Fort Saskatchewan 1
Grafing 1
Gympie 1
Hackensack 1
Hallandale 1
Totale 4.147
Nome #
A Fully Dynamic Algorithm for Distributed Shortest Paths 160
Distance queries in large-scale fully dynamic complex networks 98
Characterizing the Computational Power of Anonymous Mobile Robots 93
Recoverable robustness in shunting and timetabling 92
Hybrid Formulation of the Equation Systems of the 3-D PEEC Model Based on Graph Algorithms 87
A Loop-free Shortest-path Routing Algorithm for Dynamic Networks 87
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 85
Interacting with Topological Invariants of Spatial Databases 83
Rigorous DC Solution of Partial Element Equivalent Circuit Models 81
Engineering a new loop-free shortest paths routing algorithm 80
Delay Management Problem: Complexity Results and Robust Algorithms 78
VISTO: A new CBIR system for vector images 76
Exploring and Making Safe Dangerous Networks using Mobile Entities 76
Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms 76
Semi Dynamic Algorithms for Maintaining Single Source Shortest Paths Trees 75
Efficient algorithms for distributed shortest paths on power-law networks 75
Explore and repair graphs with black holes using mobile entities 73
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 72
Dynamic Update of Minimum Cost Paths in Computer Networks 71
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation 71
Engineering graph-based models for dynamic timetable information systems 71
Dynamic Maintenance of Arc-Flags in Road Networks 70
Incremental Algorithms for the Single Source Shortest Path Problem 70
Fully dynamic 2-hop cover labeling 70
Enhancing the computation of distributed shortest paths on real dynamic networks 70
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. 69
Multiple Zooming in Geographic Maps 69
Semi Dynamic Breadth First Search in Digraphs 68
Tariff regulation of the integrated water service: an Italian case 68
A Speed-up Technique for Distributed Shortest Paths Computation 68
Dynamically Maintaining Shortest Path Trees under Batches of Updates 68
Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs 68
Engineering Graph-Based Models for Dynamic Timetable Information Systems 68
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 67
On Formal Aspects of Zooming in Geographic Maps 67
Decomposing Spatial Databases and Applications 67
Robust Algorithms and Price of Robustness in Shunting Problems 67
Improved protocols for luminous asynchronous robots 67
A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation 66
Maintenance of Multi-level Overlay Graphs for Timetable Queries 66
On the clustered shortest-path tree problem 66
Dynamic Arc Flags in Road Networks 66
A uniform approach to semi-dynamic problems on digraphs 65
Tuning a CBIR System for vector images: the interface support 65
Exploration of Geographic Databases: Supporting a Focus+Context Interaction Style 65
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks 65
Dynamically Switching Vertices in Planar Graphs 65
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Paths Problem 64
Engineering a new algorithm for distributed shortest paths on dynamic networks 63
Dynamic Algorithms for Classes of Constraint Satisfaction Problems 62
Counting edges in a DAG 62
Directed Hypergraphs: Problems, Algorithmic Results and a General Decremental Approach 61
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae 61
Partially Dynamic Concurrent Update of Distributed Shortest Paths 61
An Experimental Study of Dynamic Algorithms for Transitive Closure 60
Semi-Dynamic Shortest Paths and Breadth First Search in Digraphs 60
A Visual Environment for Tuning a Content-Based Vector Image Retrieval Engine 60
Fully Dynamic Output Bounded Single Source Shortest Paths Problem 59
A mixed nodal-mesh formulation of the PEEC method based on efficient graph algorithms 58
Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems” 58
A Zooming Model for Geographic Maps 57
An experimental study of distributed algorithms for shortest paths on real networks 57
Characterizing the Computational Power of Mobile Robots on Graphs and Implications for the Euclidean Plane 57
A Fully Dynamic Algorithm for Distributed Shortest Paths 56
Fully Dynamic Update of Arc-Flags 56
Supporting a Focus+Context Interaction Style for Spatial Databases 56
Path-Fault-Tolerant Approximate Shortest-Path Trees 56
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study 56
Preface 55
Robust Algorithms and Price of Robustness in Shunting Problems 55
Evaluating the Effectiveness and the Efficiency of a Vector Image Search Tool 55
Interacting with Geographic Databases: a Focus+Context Approach 55
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees 54
Partially Dynamic Maintenance of Minimum Weight Hyperpaths 54
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem 54
On mining distances in large-scale dynamic graphs 54
Dynamically Switching Vertices in Planar Graphs 54
Partially dynamic efficient algorithms for distributed shortest paths 53
An Experimental Study of Dynamic Algorithms for Directed Graph 53
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study 52
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 52
Dynamization of the Backtrack-free Search for the Constraint Satisfaction Problem 52
A General Strategy for Decomposing Topological Invariants of Spatial Databases and an Application 51
On the formalization of zoom-based interaction with geographic databases 51
Preface 51
Fully Dynamic Shortest Paths in Digraphs with Arbitrary Arc Weights 51
A tool for automatically selecting optimal model transformation chains 51
Fully Dynamic Shortest Paths and Negative Cycle Detection in Digraphs with Arbitrary Arc Weights 49
Engineering Shortest-Path Algorithms for Dynamic Networks 49
null 49
Dynamic multi-level overlay graphs for shortest paths 47
Interactive Poster: A Zooming Model for Geographic Maps 47
On the Dynamization of Shortest Path Overlay Graphs 47
Pruning the Computation of Distributed Shortest Paths in Power-law Networks 45
Evaluation of a CBIR System for Vector Images 45
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem 44
Journey Planning Algorithms for Massive Delay-Prone Transit Networks 36
Sentient Spaces: Intelligent Totem Use Case in the ECSEL FRACTAL Project 19
Proceedings 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) 16
Evaluation of VISTO: a new Vector Image Search Tool 9
Totale 6.259
Categoria #
all - tutte 22.952
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.952


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020639 0 2 109 10 16 102 152 3 100 9 35 101
2020/2021801 13 99 1 102 96 27 106 1 122 38 167 29
2021/2022619 38 53 88 47 35 12 15 24 38 6 40 223
2022/20231.777 136 104 35 167 153 177 3 99 823 6 43 31
2023/2024476 156 19 22 62 25 92 4 25 1 23 3 44
2024/2025140 118 22 0 0 0 0 0 0 0 0 0 0
Totale 6.259