PATRIGNANI, Maurizio
 Distribuzione geografica
Continente #
NA - Nord America 13.947
EU - Europa 10.675
AS - Asia 8.615
SA - Sud America 1.038
Continente sconosciuto - Info sul continente non disponibili 753
AF - Africa 262
OC - Oceania 15
Totale 35.305
Nazione #
US - Stati Uniti d'America 13.713
CN - Cina 4.231
DK - Danimarca 2.668
SG - Singapore 2.343
GB - Regno Unito 2.184
RU - Federazione Russa 2.100
VN - Vietnam 1.038
DE - Germania 928
IT - Italia 812
BR - Brasile 772
SE - Svezia 571
UA - Ucraina 404
FI - Finlandia 274
BD - Bangladesh 223
IE - Irlanda 160
HK - Hong Kong 132
AL - Albania 127
IN - India 125
CI - Costa d'Avorio 117
CA - Canada 109
FR - Francia 109
TR - Turchia 97
AR - Argentina 84
ID - Indonesia 59
MX - Messico 58
NL - Olanda 58
PL - Polonia 53
EC - Ecuador 51
AT - Austria 48
KR - Corea 46
IQ - Iraq 42
PK - Pakistan 41
ZA - Sudafrica 35
ES - Italia 34
CO - Colombia 33
JP - Giappone 33
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
JM - Giamaica 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
PT - Portogallo 8
BO - Bolivia 7
HN - Honduras 7
TH - Thailandia 7
TT - Trinidad e Tobago 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
RS - Serbia 6
BG - Bulgaria 5
EE - Estonia 5
A2 - ???statistics.table.value.countryCode.A2??? 4
BH - Bahrain 4
BY - Bielorussia 4
EU - Europa 4
GE - Georgia 4
GT - Guatemala 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
PR - Porto Rico 3
SI - Slovenia 3
AF - Afghanistan, Repubblica islamica di 2
AG - Antigua e Barbuda 2
AM - Armenia 2
Totale 34.515
Città #
Southend 1.942
Woodbridge 1.463
Fairfield 1.429
Ashburn 1.137
Singapore 1.076
Wilmington 868
Houston 798
Ann Arbor 769
San Jose 718
Dallas 670
Chandler 637
Seattle 606
Beijing 600
Nanjing 557
Cambridge 502
Dearborn 413
Hefei 348
Boardman 329
Jacksonville 299
Ho Chi Minh City 287
Rome 247
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
Los Angeles 127
Helsinki 123
Tianjin 121
Hong Kong 118
Jiaxing 105
Bremen 99
New York 98
Redwood City 98
The Dalles 97
Guangzhou 89
Zhengzhou 88
Moscow 86
São Paulo 84
Munich 82
Milan 81
Hangzhou 73
San Diego 71
Santa Clara 67
Izmir 61
Ningbo 61
Haikou 58
Shanghai 53
Altamura 52
Kunming 52
Council Bluffs 51
Da Nang 51
Taizhou 51
London 50
Chicago 45
Seoul 41
Taiyuan 37
Turku 36
Orem 33
Montreal 31
Denver 30
Lanzhou 30
Fuzhou 28
Columbus 27
Orange 27
Phoenix 27
Brooklyn 26
Haiphong 26
Buffalo 25
Amsterdam 24
Brussels 24
San Francisco 24
Tokyo 24
Warsaw 24
Atlanta 23
Rio de Janeiro 23
Jakarta 22
Kraków 22
San Paolo di Civitate 22
Baghdad 21
Chennai 21
Bari 20
Boston 20
Tashkent 20
Johannesburg 19
Manchester 19
Nuremberg 19
Quito 19
Stockholm 19
Curitiba 18
Yubileyny 18
Mexico City 17
Naples 17
Washington 17
Totale 20.922
Nome #
Intersection-Link Representations of Graphs 356
Assigning AS Relationships to Satisfy the Gao-Rexford Conditions 349
Relaxing the constraints of clustered planarity 340
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 332
Clustering Cycles into Cycles of Clusters 330
Clustering Cycles into Cycles of Clusters 321
Infinite Trees and the Future 317
BitConeView: Visualization of Flows in the Bitcoin Transaction Graph 316
Fast enumeration of large k-Plexes 313
A Note on the Self-similarity of Some Orthogonal Drawings 313
Computing the Types of the Relationships between Autonomous Systems 312
Anchored Drawings of Planar Graphs 311
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 310
Computing NodeTrix representations of clustered graphs 306
Finding a Minimum-Depth Embedding of a Planar Graph in O(n^4) Time 305
C-Planarity of C-Connected Clustered Graphs 304
Morphing Planar Graph Drawings Optimally 303
How to Morph Planar Graph Drawings 303
A Note on 3D Orthogonal Drawings with Direction Constrained Edges 302
Beyond level planarity 302
Investigating Prefix Propagation through Active BGP Probing 300
BGPlay: a System for Visualizing the Interdomain Routing Evolution 297
L-drawings of directed graphs 295
BGPlay: a System for Visualizing the Interdomain Routing Evolution 292
Bend Minimization for Orthogonal Drawings of Plane Graphs 290
RoutingWatch: Visual exploration and analysis of routing events 287
Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time 281
Covert Channel for One-Way Delay Measurements 281
A Split&Push Approach to 3D Orthogonal Drawing 280
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 280
On the Relationship between Map Graphs and Clique Planar Graphs 280
A Note on Minimum Area Straight-line Drawings of Planar Graphs 276
BGPlay3D: Exploiting the Ribbon Representation to Show the Evolution of Interdomain Routing 274
Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Size 272
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 270
Morphing Planar Graph Drawings Efficiently 269
Investigating Prefix Propagation through Active BGP Probing 267
Morphing Planar Graph Drawings with a Polynomial Number of Steps 265
3DCube: A Tool for Three Dimensional Graph Drawing 264
Algorithms and Bounds for L-Drawings of Directed Graphs 262
DBdraw - Automatic Layout of Relational Database Schemas 261
Drawing Non-planar Graphs with Crossing-free Subgraphs 260
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 258
We-Measure: Toward a low-cost portable posturography for patients with multiple sclerosis using the commercial Wii balance board 258
Drawing Relational Schemas 254
Monotone Drawings of Graphs 253
Complexity Results for Three-dimensional Orthogonal Graph Drawing 252
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 252
On Embedding a Cycle in a Plane Graph 250
Drawing Database Schemas 247
Testing Planarity of Partially Embedded Graphs 247
Visualizing Interdomain Routing with BGPlay 246
Monotone Drawings of Graphs 243
Computational Complexity of Traffic Hijacking under BGP and S-BGP 243
Computing the Types of the Relationships between Autonomous Systems 242
Active BGP Probing 241
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 241
A Split-and-Push Approach to 3D Orthogonal Drawing 240
Drawing Database Schemas with DBDraw 239
Complexity Results for Three-dimensional Orthogonal Graph Drawing 239
NetFork: Mapping Time to Space in Network Visualisation 238
On Embedding a Cycle in a Plane Graph 237
IPv6-in-IPv4 tunnel discovery: methods and experimental results 237
Exploring Flow Metrics in Dense Geographical Networks 236
Topological Morphing of Planar Graphs 234
Intersection-link representations of graphs 232
Computational Complexity of Traffic Hijacking under BGP and S-BGP 229
Community detection in social networks: Breaking the taboos 229
Non-Convex Representations of Graphs 227
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 227
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 223
Infinite Trees and the Future 220
Fan-planarity: Properties and complexity 220
Drawing Trees in a Streaming Model 219
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 218
Drawing Trees in a Streaming Model 218
Discovering IPv6-in-IPv4 Tunnels in the Internet 218
Splitting Clusters To Get C-Planarity 218
On the area requirements of straight-line orthogonal drawings of ternary trees 217
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm 217
The Complexity of the Matching-Cut Problem 216
Towards Optimal Prepending for Incoming Traffic Engineering 216
Topographic Visualization of Prefix Propagation in the Internet 216
Upward and Quasi-Upward Planarity Testing of Embedded Mixed Graphs 215
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs 215
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 215
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 214
The Simultaneous Planarity Game 214
Testing Planarity of Partially Embedded Graphs 212
Towards Optimal Prepending for Incoming Traffic Engineering 212
On Extending a Partial Straight-Line Drawing 212
Visualizing Co-phylogenetic reconciliations 212
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 211
On the Complexity of HV-Rectilinear Planarity Testing 209
Optimal Morphs of Convex Drawings 207
Efficiently clustering very large attributed graphs 207
Upward Pointset Embeddings of Planar st-Graphs 206
On the Complexity of Orthogonal Compaction 205
Industrial Plant Drawer 205
MPLS Virtual Private Networks 204
Totale 25.630
Categoria #
all - tutte 108.728
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 108.728


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20221.502 0 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.735 596 1.304 628 1.156 876 551 1.120 167 662 1.082 365 228
2026/2027339 189 150 0 0 0 0 0 0 0 0 0 0
Totale 35.305