Benvenuti nell'Anagrafe della Ricerca d'Ateneo

PATRIGNANI, Maurizio
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 10.018
EU - Europa 7.637
AS - Asia 3.202
AF - Africa 116
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 8
SA - Sud America 4
Totale 20.995
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 10.004
CN - Cina 2.899
DK - Danimarca 2.667
GB - Regno Unito 2.101
DE - Germania 631
SE - Svezia 552
IT - Italia 474
UA - Ucraina 381
FI - Finlandia 218
VN - Vietnam 205
RU - Federazione Russa 166
IE - Irlanda 149
AL - Albania 119
CI - Costa d'Avorio 113
FR - Francia 65
TR - Turchia 64
PL - Polonia 27
BE - Belgio 21
NL - Olanda 19
IN - India 15
CA - Canada 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
CZ - Repubblica Ceca 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
SG - Singapore 1
TN - Tunisia 1
TW - Taiwan 1
Totale 20.995
Salva come PNG Salva come JPEG
Città #
Southend 1.942
Woodbridge 1.462
Fairfield 1.429
Wilmington 863
Houston 788
Ann Arbor 769
Ashburn 686
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 150
Dublin 147
Plano 142
Changsha 129
Tianjin 113
Helsinki 106
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
Taiyuan 37
Shanghai 34
Hefei 30
Lanzhou 30
London 30
Boardman 29
Fuzhou 28
Orange 27
Milan 24
Kraków 22
San Paolo di Civitate 22
Brussels 19
Bari 17
Westminster 16
Lawrence 15
New York 14
Kilburn 13
Washington 12
Mountain View 11
Wuhan 11
Chengdu 10
Pune 10
Auburn Hills 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
Dallas 6
Enterprise 6
Grafing 6
Verona 6
Andover 5
Chaoyang 5
Chongqing 5
Flushing 5
Sabaudia 5
Saint Petersburg 5
Acton 4
Buffalo 4
Florence 4
Fremont 4
Hounslow 4
Kocaeli 4
Lappeenranta 4
Los Angeles 4
Naples 4
New Bedfont 4
Redmond 4
Southwark 4
Sunnyvale 4
Xian 4
Aci Sant'antonio 3
Atlanta 3
Totale 14.859
Salva come PNG Salva come JPEG
Nome #
Intersection-Link Representations of Graphs 272
Computing NodeTrix representations of clustered graphs 251
Investigating Prefix Propagation through Active BGP Probing 243
Assigning AS Relationships to Satisfy the Gao-Rexford Conditions 236
Infinite Trees and the Future 226
Morphing Planar Graph Drawings Optimally 221
Investigating Prefix Propagation through Active BGP Probing 217
Fast enumeration of large k-Plexes 212
BitConeView: Visualization of Flows in the Bitcoin Transaction Graph 210
BGPlay: a System for Visualizing the Interdomain Routing Evolution 207
Relaxing the constraints of clustered planarity 206
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 204
BGPlay: a System for Visualizing the Interdomain Routing Evolution 202
Covert Channel for One-Way Delay Measurements 201
Bend Minimization for Orthogonal Drawings of Plane Graphs 200
L-drawings of directed graphs 200
Clustering Cycles into Cycles of Clusters 200
Finding a Minimum-Depth Embedding of a Planar Graph in O(n^4) Time 199
Anchored Drawings of Planar Graphs 199
We-Measure: Toward a low-cost portable posturography for patients with multiple sclerosis using the commercial Wii balance board 198
Computing the Types of the Relationships between Autonomous Systems 198
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 197
How to Morph Planar Graph Drawings 197
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 195
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 194
C-Planarity of C-Connected Clustered Graphs 193
DBdraw - Automatic Layout of Relational Database Schemas 192
A Note on the Self-similarity of Some Orthogonal Drawings 192
A Note on 3D Orthogonal Drawings with Direction Constrained Edges 191
Monotone Drawings of Graphs 191
Beyond level planarity 190
A Split&Push Approach to 3D Orthogonal Drawing 188
Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time 188
Morphing Planar Graph Drawings Efficiently 188
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 187
On the Relationship between Map Graphs and Clique Planar Graphs 187
Topological Morphing of Planar Graphs 185
Morphing Planar Graph Drawings with a Polynomial Number of Steps 184
RoutingWatch: Visual exploration and analysis of routing events 184
BGPlay3D: Exploiting the Ribbon Representation to Show the Evolution of Interdomain Routing 184
Drawing Non-planar Graphs with Crossing-free Subgraphs 181
3DCube: A Tool for Three Dimensional Graph Drawing 181
Clustering Cycles into Cycles of Clusters 181
Infinite Trees and the Future 180
Drawing Trees in a Streaming Model 180
Complexity Results for Three-dimensional Orthogonal Graph Drawing 179
Drawing Database Schemas with DBDraw 177
On Embedding a Cycle in a Plane Graph 177
Monotone Drawings of Graphs 176
Drawing Trees in a Streaming Model 176
Testing Planarity of Partially Embedded Graphs 175
Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Size 174
Computational Complexity of Traffic Hijacking under BGP and S-BGP 173
Splitting Clusters To Get C-Planarity 173
A Note on Minimum Area Straight-line Drawings of Planar Graphs 173
Upward and Quasi-Upward Planarity Testing of Embedded Mixed Graphs 169
Orthogonal 3D Shapes of Theta Graphs 169
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 168
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 166
The Complexity of the Matching-Cut Problem 165
Topographic Visualization of Prefix Propagation in the Internet 165
Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations 165
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 163
On the area requirements of straight-line orthogonal drawings of ternary trees 163
Computing the Types of the Relationships between Autonomous Systems 162
Drawing Relational Schemas 162
Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation 162
On the Complexity of HV-Rectilinear Planarity Testing 161
Exploring Flow Metrics in Dense Geographical Networks 160
Intersection-link representations of graphs 160
On the Complexity of Orthogonal Compaction 159
Optimal Morphs of Convex Drawings 158
Drawing Database Schemas 158
Testing Planarity of Partially Embedded Graphs 157
IPv6-in-IPv4 tunnel discovery: methods and experimental results 157
Algorithms and Bounds for L-Drawings of Directed Graphs 157
Industrial Plant Drawer 156
On Embedding a Cycle in a Plane Graph 156
Visualizing Interdomain Routing with BGPlay 156
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 155
Discovering IPv6-in-IPv4 Tunnels in the Internet 155
The Simultaneous Planarity Game 154
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm 154
Community detection in social networks: Breaking the taboos 154
On Extending a Partial Straight-Line Drawing 154
Fan-planarity: Properties and complexity 153
Computational Complexity of Traffic Hijacking under BGP and S-BGP 150
Towards Optimal Prepending for Incoming Traffic Engineering 149
On Extending a Partial Straight-Line Drawing 149
On the Topologies of Local Minimum Spanning Trees 148
Fan-planar Graphs: Combinatorial Properties and Complexity Results 147
Investigating Prefix Propagation through Active BGP Probing 147
A Split-and-Push Approach to 3D Orthogonal Drawing 146
L’e-learning nell’insegnamento universitario tradizionale 145
On the Complexity of Orthogonal Compaction 142
Complexity Results for Three-dimensional Orthogonal Graph Drawing 140
Non-Convex Representations of Graphs 140
Graph Drawing, 20th International Symposium 139
NetFork: Mapping Time to Space in Network Visualisation 139
Visualizing Co-phylogenetic reconciliations 135
Totale 17.734
Salva come PNG Salva come JPEG
Categoria #
all - tutte 56.530
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 56.530
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20191.679 0 0 0 0 0 0 0 0 0 211 752 716
2019/20205.816 1.175 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/2024978 58 64 120 25 195 114 117 265 7 13 0 0
Totale 21.699