Benvenuti nell'Anagrafe della Ricerca d'Ateneo

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20203.070 0 0 0 0 0 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/2025854 30 101 414 71 97 141 0 0 0 0 0 0
Totale 22.720