PATRIGNANI, Maurizio
 Distribuzione geografica
Continente #
NA - Nord America 13.697
EU - Europa 10.629
AS - Asia 8.548
SA - Sud America 1.019
AF - Africa 262
OC - Oceania 15
Continente sconosciuto - Info sul continente non disponibili 9
Totale 34.179
Nazione #
US - Stati Uniti d'America 13.489
CN - Cina 4.226
DK - Danimarca 2.668
SG - Singapore 2.337
GB - Regno Unito 2.183
RU - Federazione Russa 2.099
VN - Vietnam 1.038
DE - Germania 928
IT - Italia 779
BR - Brasile 760
SE - Svezia 571
UA - Ucraina 403
FI - Finlandia 274
BD - Bangladesh 169
IE - Irlanda 160
HK - Hong Kong 130
AL - Albania 127
IN - India 125
CI - Costa d'Avorio 117
FR - Francia 108
CA - Canada 99
TR - Turchia 97
AR - Argentina 82
ID - Indonesia 59
MX - Messico 57
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
CL - Cile 28
MA - Marocco 28
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
JM - Giamaica 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
CR - Costa Rica 6
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
EE - Estonia 5
TT - Trinidad e Tobago 5
A2 - ???statistics.table.value.countryCode.A2??? 4
BH - Bahrain 4
BY - Bielorussia 4
EU - Europa 4
GE - Georgia 4
HN - Honduras 4
LB - Libano 4
NZ - Nuova Zelanda 4
TW - Taiwan 4
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
GT - Guatemala 2
Totale 34.137
Città #
Southend 1.942
Woodbridge 1.463
Fairfield 1.429
Ashburn 1.076
Singapore 1.070
Wilmington 867
Houston 798
Ann Arbor 769
San Jose 677
Dallas 666
Chandler 637
Seattle 605
Beijing 596
Nanjing 557
Cambridge 502
Dearborn 413
Hefei 348
Boardman 329
Jacksonville 299
Ho Chi Minh City 287
Rome 242
Princeton 233
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
Los Angeles 120
Hong Kong 116
Jiaxing 105
Bremen 99
Redwood City 98
New York 97
The Dalles 97
Guangzhou 89
Zhengzhou 88
Moscow 86
Munich 82
Milan 80
São Paulo 77
Hangzhou 73
San Diego 71
Izmir 61
Ningbo 61
Haikou 58
Santa Clara 54
Shanghai 53
Altamura 52
Kunming 52
Council Bluffs 51
Da Nang 51
Taizhou 51
London 50
Chicago 44
Seoul 41
Taiyuan 37
Turku 36
Orem 33
Montreal 31
Lanzhou 30
Denver 29
Fuzhou 28
Orange 27
Columbus 26
Haiphong 26
Brooklyn 24
Brussels 24
San Francisco 24
Tokyo 24
Warsaw 24
Amsterdam 23
Atlanta 23
Rio de Janeiro 23
Jakarta 22
Kraków 22
San Paolo di Civitate 22
Baghdad 21
Chennai 21
Boston 20
Tashkent 20
Johannesburg 19
Manchester 19
Nuremberg 19
Phoenix 19
Stockholm 19
Bari 18
Quito 18
Yubileyny 18
Buffalo 17
Curitiba 17
Los Lunas 16
Mexico City 16
Naples 16
Totale 20.739
Nome #
Intersection-Link Representations of Graphs 355
Assigning AS Relationships to Satisfy the Gao-Rexford Conditions 346
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 331
Clustering Cycles into Cycles of Clusters 328
Relaxing the constraints of clustered planarity 326
Clustering Cycles into Cycles of Clusters 318
BitConeView: Visualization of Flows in the Bitcoin Transaction Graph 315
Infinite Trees and the Future 314
Computing the Types of the Relationships between Autonomous Systems 312
Fast enumeration of large k-Plexes 311
Anchored Drawings of Planar Graphs 307
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 306
Computing NodeTrix representations of clustered graphs 304
Finding a Minimum-Depth Embedding of a Planar Graph in O(n^4) Time 303
Morphing Planar Graph Drawings Optimally 302
Beyond level planarity 302
C-Planarity of C-Connected Clustered Graphs 302
How to Morph Planar Graph Drawings 301
Investigating Prefix Propagation through Active BGP Probing 298
L-drawings of directed graphs 295
BGPlay: a System for Visualizing the Interdomain Routing Evolution 295
A Note on the Self-similarity of Some Orthogonal Drawings 295
BGPlay: a System for Visualizing the Interdomain Routing Evolution 291
A Note on 3D Orthogonal Drawings with Direction Constrained Edges 289
Bend Minimization for Orthogonal Drawings of Plane Graphs 289
RoutingWatch: Visual exploration and analysis of routing events 286
A Split&Push Approach to 3D Orthogonal Drawing 280
Covert Channel for One-Way Delay Measurements 280
Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time 279
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 278
On the Relationship between Map Graphs and Clique Planar Graphs 278
A Note on Minimum Area Straight-line Drawings of Planar Graphs 275
BGPlay3D: Exploiting the Ribbon Representation to Show the Evolution of Interdomain Routing 273
Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Size 270
Morphing Planar Graph Drawings Efficiently 268
Investigating Prefix Propagation through Active BGP Probing 266
Morphing Planar Graph Drawings with a Polynomial Number of Steps 263
3DCube: A Tool for Three Dimensional Graph Drawing 263
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 263
Algorithms and Bounds for L-Drawings of Directed Graphs 261
DBdraw - Automatic Layout of Relational Database Schemas 260
Drawing Non-planar Graphs with Crossing-free Subgraphs 259
We-Measure: Toward a low-cost portable posturography for patients with multiple sclerosis using the commercial Wii balance board 257
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 256
Drawing Relational Schemas 253
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 249
Drawing Database Schemas 245
Testing Planarity of Partially Embedded Graphs 245
Visualizing Interdomain Routing with BGPlay 243
Monotone Drawings of Graphs 242
Computing the Types of the Relationships between Autonomous Systems 242
Monotone Drawings of Graphs 241
Computational Complexity of Traffic Hijacking under BGP and S-BGP 241
Active BGP Probing 240
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 240
Drawing Database Schemas with DBDraw 239
Complexity Results for Three-dimensional Orthogonal Graph Drawing 239
A Split-and-Push Approach to 3D Orthogonal Drawing 239
IPv6-in-IPv4 tunnel discovery: methods and experimental results 237
Complexity Results for Three-dimensional Orthogonal Graph Drawing 237
NetFork: Mapping Time to Space in Network Visualisation 237
Topological Morphing of Planar Graphs 234
On Embedding a Cycle in a Plane Graph 233
Exploring Flow Metrics in Dense Geographical Networks 233
Intersection-link representations of graphs 231
Community detection in social networks: Breaking the taboos 229
Computational Complexity of Traffic Hijacking under BGP and S-BGP 228
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 227
Non-Convex Representations of Graphs 224
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 221
Infinite Trees and the Future 220
Fan-planarity: Properties and complexity 219
Drawing Trees in a Streaming Model 218
Drawing Trees in a Streaming Model 218
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 217
Discovering IPv6-in-IPv4 Tunnels in the Internet 217
On the area requirements of straight-line orthogonal drawings of ternary trees 216
Splitting Clusters To Get C-Planarity 216
Topographic Visualization of Prefix Propagation in the Internet 215
Upward and Quasi-Upward Planarity Testing of Embedded Mixed Graphs 214
The Complexity of the Matching-Cut Problem 214
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm 214
Towards Optimal Prepending for Incoming Traffic Engineering 213
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 213
The Simultaneous Planarity Game 212
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs 212
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 211
Testing Planarity of Partially Embedded Graphs 211
Visualizing Co-phylogenetic reconciliations 211
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 211
Towards Optimal Prepending for Incoming Traffic Engineering 210
On Extending a Partial Straight-Line Drawing 209
On the Complexity of HV-Rectilinear Planarity Testing 208
Optimal Morphs of Convex Drawings 207
Efficiently clustering very large attributed graphs 206
L’e-learning nell’insegnamento universitario tradizionale 204
On the Complexity of Orthogonal Compaction 203
Orthogonal 3D Shapes of Theta Graphs 202
MPLS Virtual Private Networks 202
Totale 25.412
Categoria #
all - tutte 104.621
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 104.621


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021309 0 0 0 0 0 0 0 0 0 0 0 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.692 596 1.304 628 1.156 876 551 1.120 167 662 1.082 365 185
Totale 34.923