D'EMIDIO, MATTIA
 Distribuzione geografica
Continente #
NA - Nord America 1.483
EU - Europa 905
AS - Asia 503
Continente sconosciuto - Info sul continente non disponibili 4
OC - Oceania 3
Totale 2.898
Nazione #
US - Stati Uniti d'America 1.478
IE - Irlanda 340
CN - Cina 244
TR - Turchia 166
IT - Italia 140
DE - Germania 109
UA - Ucraina 88
SE - Svezia 87
GB - Regno Unito 69
SG - Singapore 63
FI - Finlandia 32
FR - Francia 21
IN - India 16
BE - Belgio 11
CA - Canada 4
VN - Vietnam 4
AU - Australia 3
EU - Europa 3
KR - Corea 3
HK - Hong Kong 2
MD - Moldavia 2
RO - Romania 2
A2 - ???statistics.table.value.countryCode.A2??? 1
BD - Bangladesh 1
BN - Brunei Darussalam 1
DM - Dominica 1
IL - Israele 1
LU - Lussemburgo 1
NL - Olanda 1
PH - Filippine 1
PK - Pakistan 1
RU - Federazione Russa 1
SI - Slovenia 1
Totale 2.898
Città #
Chandler 353
Jacksonville 347
Dublin 340
Izmir 76
Nanjing 74
Wilmington 65
New York 60
Singapore 57
L'aquila 53
Lawrence 48
Princeton 48
Boardman 46
Ashburn 42
San Mateo 33
Ann Arbor 26
Nanchang 23
Berlin 22
Beijing 19
Seattle 18
Shenyang 16
Milan 14
Mountain View 14
Tianjin 12
Woodbridge 12
Brussels 11
Hebei 10
Jiaxing 9
Des Moines 8
Hangzhou 8
Jinan 8
Houston 7
Kunming 7
Los Angeles 7
Norwalk 7
Teramo 7
Changsha 6
Guangzhou 6
Helsinki 6
Pune 6
Dearborn 5
Falls Church 5
Haikou 5
Lanzhou 5
Santa Clara 5
Changchun 4
Dallas 4
Pescara 4
Verona 4
Lappeenranta 3
Napoli 3
Redwood City 3
Shanghai 3
Zhengzhou 3
Bellante 2
Chicago 2
Chisinau 2
Dong Ket 2
Grafing 2
London 2
Martino 2
Melbourne 2
Ningbo 2
Andover 1
Bandar Seri Begawan 1
Brasov 1
Bremen 1
Brisbane 1
Cambridge 1
Cedar Knolls 1
Central District 1
Dalian 1
Denver 1
Dhaka 1
Düsseldorf 1
Edinburgh 1
Englewood 1
Evansville 1
Fort Saskatchewan 1
Frankfurt am Main 1
Fremont 1
Fuzhou 1
Hanoi 1
Hefei 1
Kharkov 1
Kirkland 1
Kitzingen 1
Las Vegas 1
Marano Di Napoli 1
Merced 1
Naperville 1
Niagara Falls 1
Nottingham 1
Nuremberg 1
Ottawa 1
Raleigh 1
Redmond 1
Roseau 1
Saigon 1
Saint Paul 1
San Salvo 1
Totale 2.043
Nome #
Distance queries in large-scale fully dynamic complex networks 98
Characterizing the Computational Power of Anonymous Mobile Robots 93
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
Rigorous DC Solution of Partial Element Equivalent Circuit Models 81
Engineering a new loop-free shortest paths routing algorithm 80
Exploring and Making Safe Dangerous Networks using Mobile Entities 76
Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms 76
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
Multi-robot Task Allocation Problem: Current Trends and New Ideas 72
Bamboo Garden Trimming Problem: Priority Schedulings 72
Engineering graph-based models for dynamic timetable information systems 71
Dynamic Maintenance of Arc-Flags in Road Networks 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
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
Improved protocols for luminous asynchronous robots 67
On the clustered shortest-path tree problem 66
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks 65
EASIER: An Evolutionary Approach for Multi-objective Software ArchItecturE Refactoring 60
Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems” 58
Characterizing the Computational Power of Mobile Robots on Graphs and Implications for the Euclidean Plane 57
Fully Dynamic Update of Arc-Flags 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
On mining distances in large-scale dynamic graphs 54
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 52
Collision-free allocation of temporally constrained tasks in multi-robot systems 52
A tool for automatically selecting optimal model transformation chains 51
Engineering Shortest-Path Algorithms for Dynamic Networks 49
Priority scheduling in the Bamboo garden trimming problem 49
Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings 47
Pruning the Computation of Distributed Shortest Paths in Power-law Networks 45
On the effectiveness of the genetic paradigm for polygonization 45
Dynamic Public Transit Labeling 44
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem 44
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction 39
Leader Election and Compaction for Asynchronous Silent Programmable Matter 39
Journey Planning Algorithms for Massive Delay-Prone Transit Networks 36
Creating an Holistic Emergency Alert Management Platform 36
Digraph k-Coloring Games: From Theory to Practice 35
Report on SEA 2018 33
Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs 30
Top-k Distance Queries on Large Time-Evolving Graphs 9
Totale 2.992
Categoria #
all - tutte 11.921
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 11.921


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020288 0 2 46 7 8 50 65 4 45 6 12 43
2020/2021402 6 49 2 48 45 9 56 1 76 26 74 10
2021/2022265 13 9 30 16 16 10 9 22 21 2 16 101
2022/2023955 67 70 23 94 68 92 3 67 428 4 25 14
2023/2024253 26 13 15 16 18 96 1 17 2 7 4 38
2024/202579 58 21 0 0 0 0 0 0 0 0 0 0
Totale 2.992