PATRIGNANI, Maurizio
 Distribuzione geografica
Continente #
NA - Nord America 13.208
EU - Europa 10.555
AS - Asia 8.450
SA - Sud America 1.011
AF - Africa 262
OC - Oceania 15
Continente sconosciuto - Info sul continente non disponibili 9
Totale 33.510
Nazione #
US - Stati Uniti d'America 13.041
CN - Cina 4.220
DK - Danimarca 2.668
SG - Singapore 2.331
GB - Regno Unito 2.183
RU - Federazione Russa 2.099
VN - Vietnam 1.038
DE - Germania 928
BR - Brasile 753
IT - Italia 705
SE - Svezia 571
UA - Ucraina 403
FI - Finlandia 274
IE - Irlanda 160
HK - Hong Kong 130
AL - Albania 127
IN - India 124
CI - Costa d'Avorio 117
FR - Francia 108
TR - Turchia 97
BD - Bangladesh 84
AR - Argentina 82
CA - Canada 73
ID - Indonesia 59
MX - Messico 56
NL - Olanda 56
PL - Polonia 53
AT - Austria 48
EC - Ecuador 47
KR - Corea 46
IQ - Iraq 42
PK - Pakistan 41
ZA - Sudafrica 35
JP - Giappone 33
CO - Colombia 32
ES - Italia 30
MA - Marocco 28
CL - Cile 27
BE - Belgio 26
SA - Arabia Saudita 23
UZ - Uzbekistan 22
MY - Malesia 20
TN - Tunisia 20
EG - Egitto 19
RO - Romania 18
CZ - Repubblica Ceca 17
VE - Venezuela 17
PH - Filippine 16
PY - Paraguay 16
JO - Giordania 15
PE - Perù 14
UY - Uruguay 14
CH - Svizzera 13
NP - Nepal 13
KZ - Kazakistan 12
LT - Lituania 11
AU - Australia 10
AE - Emirati Arabi Uniti 9
IR - Iran 9
PA - Panama 9
SN - Senegal 9
AZ - Azerbaigian 8
IL - Israele 8
BO - Bolivia 7
TH - Thailandia 7
DO - Repubblica Dominicana 6
DZ - Algeria 6
ET - Etiopia 6
GR - Grecia 6
HU - Ungheria 6
KE - Kenya 6
OM - Oman 6
PT - Portogallo 6
RS - Serbia 6
BG - Bulgaria 5
CR - Costa Rica 5
EE - Estonia 5
A2 - ???statistics.table.value.countryCode.A2??? 4
BH - Bahrain 4
BY - Bielorussia 4
EU - Europa 4
GE - Georgia 4
JM - Giamaica 4
LB - Libano 4
NZ - Nuova Zelanda 4
TW - Taiwan 4
HN - Honduras 3
HR - Croazia 3
KG - Kirghizistan 3
KH - Cambogia 3
LY - Libia 3
MD - Moldavia 3
NI - Nicaragua 3
AF - Afghanistan, Repubblica islamica di 2
AM - Armenia 2
AO - Angola 2
BA - Bosnia-Erzegovina 2
DM - Dominica 2
GY - Guiana 2
LK - Sri Lanka 2
Totale 33.471
Città #
Southend 1.942
Woodbridge 1.462
Fairfield 1.429
Singapore 1.068
Ashburn 1.039
Wilmington 866
Houston 796
Ann Arbor 769
Dallas 660
Chandler 637
Seattle 601
Beijing 592
Nanjing 557
San Jose 518
Cambridge 501
Dearborn 413
Hefei 348
Boardman 329
Jacksonville 299
Ho Chi Minh City 287
Princeton 233
Rome 226
Shenyang 217
Dong Ket 205
Jinan 203
Nanchang 193
Hanoi 186
Frankfurt am Main 169
Dublin 157
Hebei 153
Plano 142
Changsha 137
Helsinki 123
Tianjin 121
Hong Kong 116
Jiaxing 105
Los Angeles 102
Bremen 99
Redwood City 98
The Dalles 97
Guangzhou 89
Zhengzhou 88
Moscow 86
Munich 82
Milan 77
Hangzhou 73
São Paulo 72
New York 70
San Diego 69
Izmir 61
Ningbo 61
Haikou 58
Altamura 52
Kunming 52
Da Nang 51
Shanghai 51
Taizhou 51
London 50
Council Bluffs 45
Seoul 41
Santa Clara 39
Chicago 38
Taiyuan 37
Turku 36
Orem 31
Lanzhou 30
Fuzhou 28
Orange 27
Denver 26
Haiphong 26
Brussels 24
Columbus 24
Montreal 24
Tokyo 24
Warsaw 24
Amsterdam 23
Brooklyn 23
Rio de Janeiro 23
Jakarta 22
Kraków 22
San Paolo di Civitate 22
Baghdad 21
Chennai 21
Tashkent 20
Johannesburg 19
Manchester 19
Nuremberg 19
Phoenix 19
Stockholm 19
Quito 18
Yubileyny 18
Atlanta 17
Bari 17
Boston 17
Curitiba 17
Los Lunas 16
Westminster 16
Amman 15
Biên Hòa 15
Brasília 15
Totale 20.385
Nome #
Intersection-Link Representations of Graphs 349
Assigning AS Relationships to Satisfy the Gao-Rexford Conditions 345
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 329
Clustering Cycles into Cycles of Clusters 325
Relaxing the constraints of clustered planarity 315
Infinite Trees and the Future 314
Clustering Cycles into Cycles of Clusters 314
BitConeView: Visualization of Flows in the Bitcoin Transaction Graph 314
Computing the Types of the Relationships between Autonomous Systems 309
Fast enumeration of large k-Plexes 308
Anchored Drawings of Planar Graphs 305
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 304
Computing NodeTrix representations of clustered graphs 301
Morphing Planar Graph Drawings Optimally 299
How to Morph Planar Graph Drawings 299
C-Planarity of C-Connected Clustered Graphs 298
Finding a Minimum-Depth Embedding of a Planar Graph in O(n^4) Time 297
Beyond level planarity 297
Investigating Prefix Propagation through Active BGP Probing 296
L-drawings of directed graphs 295
BGPlay: a System for Visualizing the Interdomain Routing Evolution 292
A Note on the Self-similarity of Some Orthogonal Drawings 291
Bend Minimization for Orthogonal Drawings of Plane Graphs 288
BGPlay: a System for Visualizing the Interdomain Routing Evolution 288
A Note on 3D Orthogonal Drawings with Direction Constrained Edges 283
RoutingWatch: Visual exploration and analysis of routing events 283
A Split&Push Approach to 3D Orthogonal Drawing 277
Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time 276
Covert Channel for One-Way Delay Measurements 276
On the Relationship between Map Graphs and Clique Planar Graphs 275
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 273
A Note on Minimum Area Straight-line Drawings of Planar Graphs 271
BGPlay3D: Exploiting the Ribbon Representation to Show the Evolution of Interdomain Routing 271
Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Size 269
Investigating Prefix Propagation through Active BGP Probing 266
Morphing Planar Graph Drawings Efficiently 265
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 263
Morphing Planar Graph Drawings with a Polynomial Number of Steps 261
3DCube: A Tool for Three Dimensional Graph Drawing 261
Algorithms and Bounds for L-Drawings of Directed Graphs 259
Drawing Non-planar Graphs with Crossing-free Subgraphs 258
DBdraw - Automatic Layout of Relational Database Schemas 258
We-Measure: Toward a low-cost portable posturography for patients with multiple sclerosis using the commercial Wii balance board 256
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 251
Drawing Relational Schemas 250
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 250
On Embedding a Cycle in a Plane Graph 245
Drawing Database Schemas 242
Computing the Types of the Relationships between Autonomous Systems 242
Visualizing Interdomain Routing with BGPlay 241
Testing Planarity of Partially Embedded Graphs 239
Monotone Drawings of Graphs 238
Active BGP Probing 238
Computational Complexity of Traffic Hijacking under BGP and S-BGP 238
Drawing Database Schemas with DBDraw 236
Monotone Drawings of Graphs 235
IPv6-in-IPv4 tunnel discovery: methods and experimental results 235
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 235
NetFork: Mapping Time to Space in Network Visualisation 235
A Split-and-Push Approach to 3D Orthogonal Drawing 235
Complexity Results for Three-dimensional Orthogonal Graph Drawing 234
Topological Morphing of Planar Graphs 232
Complexity Results for Three-dimensional Orthogonal Graph Drawing 231
Exploring Flow Metrics in Dense Geographical Networks 231
Community detection in social networks: Breaking the taboos 229
Computational Complexity of Traffic Hijacking under BGP and S-BGP 227
On Embedding a Cycle in a Plane Graph 226
Intersection-link representations of graphs 226
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 223
Non-Convex Representations of Graphs 221
Infinite Trees and the Future 220
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 218
Fan-planarity: Properties and complexity 217
Discovering IPv6-in-IPv4 Tunnels in the Internet 216
Drawing Trees in a Streaming Model 216
Drawing Trees in a Streaming Model 215
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 214
Splitting Clusters To Get C-Planarity 214
Topographic Visualization of Prefix Propagation in the Internet 212
Towards Optimal Prepending for Incoming Traffic Engineering 211
On the area requirements of straight-line orthogonal drawings of ternary trees 211
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 211
Upward and Quasi-Upward Planarity Testing of Embedded Mixed Graphs 210
The Complexity of the Matching-Cut Problem 210
Visualizing Co-phylogenetic reconciliations 210
The Simultaneous Planarity Game 209
Testing Planarity of Partially Embedded Graphs 208
Towards Optimal Prepending for Incoming Traffic Engineering 208
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 208
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 207
On Extending a Partial Straight-Line Drawing 207
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm 207
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs 207
On the Complexity of HV-Rectilinear Planarity Testing 203
Optimal Morphs of Convex Drawings 203
Orthogonal 3D Shapes of Theta Graphs 202
MPLS Virtual Private Networks 202
L’e-learning nell’insegnamento universitario tradizionale 201
Efficiently clustering very large attributed graphs 201
On Extending a Partial Straight-Line Drawing 200
Totale 25.116
Categoria #
all - tutte 100.152
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 100.152


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021652 0 0 0 0 0 0 0 0 0 214 129 309
2021/20221.600 98 205 51 18 295 62 175 65 133 71 150 277
2022/20232.055 326 381 96 262 120 413 8 154 188 11 59 37
2023/20241.145 58 64 120 25 195 114 117 265 7 23 35 122
2024/20254.365 30 101 414 71 97 149 1.423 906 387 119 287 381
2025/20268.022 596 1.304 628 1.156 876 551 1.120 167 662 962 0 0
Totale 34.253