DI BATTISTA, Giuseppe
 Distribuzione geografica
Continente #
NA - Nord America 18.320
EU - Europa 14.894
AS - Asia 5.463
AF - Africa 197
OC - Oceania 55
SA - Sud America 44
Continente sconosciuto - Info sul continente non disponibili 17
Totale 38.990
Nazione #
US - Stati Uniti d'America 18.235
DK - Danimarca 4.812
CN - Cina 4.786
GB - Regno Unito 4.072
DE - Germania 1.275
SE - Svezia 961
IT - Italia 942
UA - Ucraina 859
FI - Finlandia 404
VN - Vietnam 363
RU - Federazione Russa 320
FR - Francia 304
IE - Irlanda 256
AL - Albania 228
CI - Costa d'Avorio 179
TR - Turchia 107
NL - Olanda 90
BE - Belgio 88
CA - Canada 77
AT - Austria 60
IN - India 52
AU - Australia 50
PL - Polonia 50
CH - Svizzera 41
JP - Giappone 35
BR - Brasile 34
IR - Iran 26
RO - Romania 24
GR - Grecia 17
ES - Italia 15
PT - Portogallo 14
SG - Singapore 14
CZ - Repubblica Ceca 12
KR - Corea 10
EU - Europa 9
IL - Israele 9
A2 - ???statistics.table.value.countryCode.A2??? 8
ID - Indonesia 8
RS - Serbia 8
HR - Croazia 7
MY - Malesia 7
NO - Norvegia 7
TW - Taiwan 7
BD - Bangladesh 6
CU - Cuba 6
EG - Egitto 6
LV - Lettonia 6
PH - Filippine 6
SK - Slovacchia (Repubblica Slovacca) 6
HK - Hong Kong 4
JO - Giordania 4
MD - Moldavia 4
NZ - Nuova Zelanda 4
IQ - Iraq 3
LB - Libano 3
PK - Pakistan 3
SA - Arabia Saudita 3
AR - Argentina 2
BG - Bulgaria 2
CL - Cile 2
CO - Colombia 2
CY - Cipro 2
EE - Estonia 2
ET - Etiopia 2
HU - Ungheria 2
LT - Lituania 2
MA - Marocco 2
PE - Perù 2
VA - Santa Sede (Città del Vaticano) 2
ZA - Sudafrica 2
BA - Bosnia-Erzegovina 1
BO - Bolivia 1
BW - Botswana 1
CR - Costa Rica 1
DJ - Gibuti 1
DZ - Algeria 1
KH - Cambogia 1
KZ - Kazakistan 1
LU - Lussemburgo 1
MO - Macao, regione amministrativa speciale della Cina 1
MX - Messico 1
NC - Nuova Caledonia 1
NG - Nigeria 1
NP - Nepal 1
SN - Senegal 1
TH - Thailandia 1
TN - Tunisia 1
UY - Uruguay 1
Totale 38.990
Città #
Southend 3.696
Woodbridge 2.796
Fairfield 2.623
Wilmington 1.620
Houston 1.423
Ann Arbor 1.356
Ashburn 1.166
Seattle 1.015
Nanjing 1.000
Chandler 977
Dearborn 923
Cambridge 898
Jacksonville 591
Beijing 450
Princeton 450
Shenyang 385
Dong Ket 359
Nanchang 340
Jinan 300
Hebei 283
Plano 267
Dublin 252
Rome 237
Redwood City 225
Changsha 214
Tianjin 207
Helsinki 176
Jiaxing 176
Bremen 166
Hangzhou 148
Guangzhou 136
San Diego 129
Zhengzhou 127
Bari 126
Altamura 110
Ningbo 108
Kunming 106
Izmir 103
Taizhou 89
Palaiseau 86
Brussels 79
San Paolo di Civitate 65
London 61
Hefei 57
Shanghai 55
Taiyuan 55
Haikou 54
Milan 52
Boardman 47
Lanzhou 45
Orange 45
Fuzhou 39
Washington 30
Flushing 24
Kraków 21
Kilburn 20
Westminster 20
Fort Worth 19
New York 19
Chiswick 18
Auburn Hills 17
Changchun 17
Fremont 17
Pune 17
Wuhan 17
Minneapolis 16
Mountain View 16
Alameda 15
Ottawa 15
Verona 15
Lawrence 14
Stevenage 14
Chengdu 13
Hagen 13
Hounslow 13
Norwalk 13
Sunnyvale 13
Venezia 13
Dallas 11
Perugia 11
Buffalo 10
Karlsruhe 10
Los Angeles 10
North York 10
Toronto 10
Vienna 10
Winnipeg 10
Bologna 9
Chicago 9
Eindhoven 9
Xian 9
Düsseldorf 8
Hilliard 8
Sydney 8
Belgrade 7
Bern 7
Bordeaux 7
Ferentino 7
Grafing 7
Kansas City 7
Totale 27.126
Nome #
Graph Drawing: Algorithms for the Visualization of Graphs 1.271
Intersection-Link Representations of Graphs 276
Computing NodeTrix representations of clustered graphs 251
Investigating Prefix Propagation through Active BGP Probing 243
How to handle ARP in a software-defined network 236
Assigning AS Relationships to Satisfy the Gao-Rexford Conditions 235
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective (Invited Lecture) 233
Infinite Trees and the Future 226
Morphing Planar Graph Drawings Optimally 221
Monitoring the status of MPLS VPN and VPLS based on BGP signaling information 221
On the Stability of Interdomain Routing 221
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm 220
Intra-domain routing with Pathlets 220
Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing 217
Investigating Prefix Propagation through Active BGP Probing 217
How to Extract BGP Peering Information from the Internet Routing Registry 213
Supporting end-to-end connectivity in federated networks using SDN 212
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 210
BitConeView: Visualization of Flows in the Bitcoin Transaction Graph 210
BGPlay: a System for Visualizing the Interdomain Routing Evolution 207
Computing Orthogonal Drawings with the Minimum Number of Bends 206
Relaxing the constraints of clustered planarity 206
Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium 205
Rethinking Virtual Private Networks in the Software-Defined Era 205
An Algorithm for Testing Planarity of Hierarchical Graphs 205
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area 204
BGPlay: a System for Visualizing the Interdomain Routing Evolution 202
Clustering Cycles into Cycles of Clusters 202
Intra-Domain Pathlet Routing 201
How to Morph Planar Graph Drawings 200
Finding a Minimum-Depth Embedding of a Planar Graph in O(n^4) Time 199
Anchored Drawings of Planar Graphs 199
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
Dynamic traceroute visualization at multiple abstraction levels 197
Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing 195
Automatic Graph Drawing and Readability of Diagrams 195
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 195
A framework for dynamic graph drawing 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 194
DBdraw - Automatic Layout of Relational Database Schemas 192
Monotone Drawings of Graphs 191
Computing Proximity Drawings of Trees in the 3-Dimensional Space 191
Small Point Sets for Simply-Nested Planar Graphs 191
Incremental Planarity Testing 191
A Split&Push Approach to 3D Orthogonal Drawing 190
Automatic Layout of PERT Diagrams with XPERT 190
A Tailorable and Extensible Automatic Layout Facility 190
Windrose planarity: Embedding graphs with direction-constrained edges 190
Beyond level planarity 190
Upward Drawings of Triconnected Digraphs 189
Local Transit Policies and the Complexity of BGP Stability Testing 189
Algorithms for Drawing Graphs: an Annotated Bibliography 189
Is it really worth to peer at IXPs? A comparative study 189
Topological Morphing of Planar Graphs 189
Visual discovery of the correlation between BGP routing and round-trip delay active measurements 188
Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time 188
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 188
Upward Drawings of Acyclic Digraphs 187
Algorithms for Plane Representations of Acyclic Digraphs 187
On the Relationship between Map Graphs and Clique Planar Graphs 187
How to Visualize the K-root Name Server 186
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees 186
From Theory to Practice: Efficiently Checking BGP Configurations for Guaranteed Convergence 186
How to Visualize the K-Root Name Server (Demo) 186
Angles of Planar Triangular Graphs 186
Automatic Drawing of Statistical Diagrams 185
Strip Planarity Testing for Embedded Planar Graphs 185
Morphing Planar Graph Drawings with a Polynomial Number of Steps 184
Visualization of the High Level Structure of the Internet with Hermes 184
Simultaneous Embedding of Embedded Planar Graphs 184
Making MPLS VPNs Manageable through the Adoption of SDN 183
An Experimental Comparison of Four Graph Drawing Algorithms 182
Simultaneous Embedding of Embedded Planar Graphs 182
On-line Maintenance of the Four-Connected Components of a Graph 182
Strip Planarity Testing 182
Clustering Cycles into Cycles of Clusters 181
Kathará: A container-based framework for implementing network function virtualization and software defined networks 181
On the Perspectives Opened by Right Angle Crossing Drawings 181
Infinite Trees and the Future 180
Drawing Trees in a Streaming Model 180
How to Draw a Series-Parallel Digraph 179
Drawing Directed Acyclic Graphs: An Experimental Study 179
Turn-Regularity and Planar Orthogonal Drawings 179
Tracking Back the Root Cause of a Path Change in Interdomain Routing 178
How to Draw a Series-Parallel Digraph 177
Drawing Database Schemas with DBDraw 177
On Embedding a Cycle in a Plane Graph 177
Angles of Planar Triangular Graphs 177
Monotone Drawings of Graphs 176
Spirality and Optimal Orthogonal Drawings 176
Drawing Trees in a Streaming Model 176
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces 176
Testing Planarity of Partially Embedded Graphs 175
Succinct greedy drawings do not always exist 175
Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Size 174
Visualization Applications and Design Studies, Guest editors' introduction 174
Small Area Drawings of Outerplanar Graphs 173
Output-Sensitive Reporting of Disjoint Paths 173
Totale 20.567
Categoria #
all - tutte 95.169
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 95.169


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20193.189 0 0 0 0 0 0 0 0 33 406 1.385 1.365
2019/202010.406 2.172 895 445 907 747 1.052 1.256 981 1.055 443 308 145
2020/20214.637 263 248 355 188 400 291 706 501 600 374 150 561
2021/20222.861 137 459 68 50 514 72 426 110 211 105 258 451
2022/20233.367 469 601 152 440 245 669 18 263 319 20 109 62
2023/20241.360 86 121 174 59 192 193 103 414 18 0 0 0
Totale 40.125