Benvenuti nell'Anagrafe della Ricerca d'Ateneo

PATRIGNANI, Maurizio
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 10.067
EU - Europa 7.658
AS - Asia 3.398
AF - Africa 116
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 8
SA - Sud America 4
Totale 21.261
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 10.053
CN - Cina 2.938
DK - Danimarca 2.667
GB - Regno Unito 2.101
DE - Germania 632
SE - Svezia 552
IT - Italia 477
UA - Ucraina 381
FI - Finlandia 219
VN - Vietnam 205
RU - Federazione Russa 166
SG - Singapore 158
IE - Irlanda 149
AL - Albania 119
CI - Costa d'Avorio 113
FR - Francia 66
TR - Turchia 64
PL - Polonia 29
BE - Belgio 21
NL - Olanda 19
IN - India 15
CA - Canada 14
CZ - Repubblica Ceca 14
AT - Austria 13
RO - Romania 12
AU - Australia 8
CH - Svizzera 8
JP - Giappone 5
A2 - ???statistics.table.value.countryCode.A2??? 4
BR - Brasile 4
EU - Europa 4
IR - Iran 4
ES - Italia 3
GR - Grecia 3
HK - Hong Kong 2
NZ - Nuova Zelanda 2
VA - Santa Sede (Città del Vaticano) 2
BD - Bangladesh 1
DZ - Algeria 1
HR - Croazia 1
IL - Israele 1
IQ - Iraq 1
KZ - Kazakistan 1
MD - Moldavia 1
ME - Montenegro 1
MY - Malesia 1
NG - Nigeria 1
NO - Norvegia 1
NP - Nepal 1
PT - Portogallo 1
TN - Tunisia 1
TW - Taiwan 1
Totale 21.261
Salva come PNG Salva come JPEG
Città #
Southend 1.942
Woodbridge 1.462
Fairfield 1.429
Wilmington 863
Houston 788
Ann Arbor 769
Ashburn 689
Chandler 637
Seattle 589
Nanjing 556
Cambridge 500
Dearborn 413
Beijing 323
Jacksonville 298
Princeton 233
Shenyang 217
Dong Ket 205
Jinan 203
Nanchang 191
Hebei 153
Rome 153
Dublin 147
Plano 142
Changsha 129
Tianjin 113
Helsinki 106
Singapore 105
Jiaxing 103
Bremen 99
Redwood City 98
Zhengzhou 87
Guangzhou 76
Hangzhou 73
San Diego 68
Ningbo 61
Izmir 60
Haikou 58
Altamura 52
Taizhou 50
Kunming 49
Boardman 43
Shanghai 43
Taiyuan 37
Hefei 30
Lanzhou 30
London 30
Fuzhou 28
Orange 27
Milan 24
Kraków 22
San Paolo di Civitate 22
Brussels 19
Dallas 18
Bari 17
Westminster 16
Lawrence 15
New York 14
Kilburn 13
Los Angeles 13
Washington 12
Mountain View 11
Wuhan 11
Chengdu 10
Pune 10
Auburn Hills 9
Brno 9
Chiswick 9
Mestre 9
Norwalk 9
Alameda 8
Fort Worth 8
Palaiseau 8
Renton 8
Stevenage 8
Venezia 8
Changchun 7
Falls Church 7
Bologna 6
Enterprise 6
Grafing 6
Verona 6
Andover 5
Chaoyang 5
Chongqing 5
Flushing 5
Krakow 5
Lappeenranta 5
Olomouc 5
Sabaudia 5
Saint Petersburg 5
Santa Clara 5
Acton 4
Buffalo 4
Florence 4
Fremont 4
Hounslow 4
Kocaeli 4
Naples 4
New Bedfont 4
Redmond 4
Totale 15.021
Salva come PNG Salva come JPEG
Nome #
Intersection-Link Representations of Graphs 272
Computing NodeTrix representations of clustered graphs 252
Investigating Prefix Propagation through Active BGP Probing 244
Assigning AS Relationships to Satisfy the Gao-Rexford Conditions 238
Infinite Trees and the Future 227
Morphing Planar Graph Drawings Optimally 222
Investigating Prefix Propagation through Active BGP Probing 218
BitConeView: Visualization of Flows in the Bitcoin Transaction Graph 214
Fast enumeration of large k-Plexes 213
BGPlay: a System for Visualizing the Interdomain Routing Evolution 212
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 210
Relaxing the constraints of clustered planarity 207
BGPlay: a System for Visualizing the Interdomain Routing Evolution 206
Bend Minimization for Orthogonal Drawings of Plane Graphs 203
Anchored Drawings of Planar Graphs 202
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 202
Covert Channel for One-Way Delay Measurements 202
L-drawings of directed graphs 202
Clustering Cycles into Cycles of Clusters 202
Finding a Minimum-Depth Embedding of a Planar Graph in O(n^4) Time 201
Computing the Types of the Relationships between Autonomous Systems 201
How to Morph Planar Graph Drawings 201
We-Measure: Toward a low-cost portable posturography for patients with multiple sclerosis using the commercial Wii balance board 199
C-Planarity of C-Connected Clustered Graphs 196
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 195
A Note on the Self-similarity of Some Orthogonal Drawings 195
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 194
A Note on 3D Orthogonal Drawings with Direction Constrained Edges 193
Beyond level planarity 193
Monotone Drawings of Graphs 192
DBdraw - Automatic Layout of Relational Database Schemas 192
A Split&Push Approach to 3D Orthogonal Drawing 190
Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time 190
Morphing Planar Graph Drawings Efficiently 190
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 188
On the Relationship between Map Graphs and Clique Planar Graphs 188
Topological Morphing of Planar Graphs 187
BGPlay3D: Exploiting the Ribbon Representation to Show the Evolution of Interdomain Routing 186
Morphing Planar Graph Drawings with a Polynomial Number of Steps 185
Clustering Cycles into Cycles of Clusters 185
RoutingWatch: Visual exploration and analysis of routing events 185
Drawing Non-planar Graphs with Crossing-free Subgraphs 182
3DCube: A Tool for Three Dimensional Graph Drawing 182
Infinite Trees and the Future 181
Complexity Results for Three-dimensional Orthogonal Graph Drawing 180
Drawing Trees in a Streaming Model 180
Drawing Database Schemas with DBDraw 178
On Embedding a Cycle in a Plane Graph 177
A Note on Minimum Area Straight-line Drawings of Planar Graphs 177
Monotone Drawings of Graphs 176
Testing Planarity of Partially Embedded Graphs 176
Drawing Trees in a Streaming Model 176
Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Size 175
Splitting Clusters To Get C-Planarity 174
Computational Complexity of Traffic Hijacking under BGP and S-BGP 173
Orthogonal 3D Shapes of Theta Graphs 170
Upward and Quasi-Upward Planarity Testing of Embedded Mixed Graphs 169
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 169
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 166
The Complexity of the Matching-Cut Problem 166
Topographic Visualization of Prefix Propagation in the Internet 166
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 166
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 165
Computing the Types of the Relationships between Autonomous Systems 165
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 165
On the area requirements of straight-line orthogonal drawings of ternary trees 163
Drawing Relational Schemas 163
On the Complexity of HV-Rectilinear Planarity Testing 162
Exploring Flow Metrics in Dense Geographical Networks 162
Intersection-link representations of graphs 161
On the Complexity of Orthogonal Compaction 160
Testing Planarity of Partially Embedded Graphs 159
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 159
Drawing Database Schemas 159
Algorithms and Bounds for L-Drawings of Directed Graphs 159
IPv6-in-IPv4 tunnel discovery: methods and experimental results 158
Optimal Morphs of Convex Drawings 158
Industrial Plant Drawer 157
On Embedding a Cycle in a Plane Graph 157
Visualizing Interdomain Routing with BGPlay 157
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm 157
Community detection in social networks: Breaking the taboos 156
On Extending a Partial Straight-Line Drawing 156
Discovering IPv6-in-IPv4 Tunnels in the Internet 156
The Simultaneous Planarity Game 155
Fan-planarity: Properties and complexity 155
Computational Complexity of Traffic Hijacking under BGP and S-BGP 152
Towards Optimal Prepending for Incoming Traffic Engineering 151
On Extending a Partial Straight-Line Drawing 151
On the Topologies of Local Minimum Spanning Trees 150
Fan-planar Graphs: Combinatorial Properties and Complexity Results 150
Investigating Prefix Propagation through Active BGP Probing 149
A Split-and-Push Approach to 3D Orthogonal Drawing 148
L’e-learning nell’insegnamento universitario tradizionale 146
On the Complexity of Orthogonal Compaction 143
Complexity Results for Three-dimensional Orthogonal Graph Drawing 142
NetFork: Mapping Time to Space in Network Visualisation 142
Graph Drawing, 20th International Symposium 141
Non-Convex Representations of Graphs 141
Efficiently clustering very large attributed graphs 136
Totale 17.899
Salva come PNG Salva come JPEG
Categoria #
all - tutte 61.348
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 61.348
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20204.641 0 437 303 427 404 504 660 568 639 444 167 88
2020/20212.627 139 135 179 90 237 160 369 310 356 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/2025101 30 71 0 0 0 0 0 0 0 0 0 0
Totale 21.967