FRATI, FABRIZIO
 Distribuzione geografica
Continente #
NA - Nord America 12.256
EU - Europa 10.346
AS - Asia 7.173
SA - Sud America 858
AF - Africa 238
OC - Oceania 21
Continente sconosciuto - Info sul continente non disponibili 18
Totale 30.910
Nazione #
US - Stati Uniti d'America 12.139
CN - Cina 3.512
DK - Danimarca 2.795
GB - Regno Unito 2.477
SG - Singapore 2.081
RU - Federazione Russa 1.896
DE - Germania 902
VN - Vietnam 741
BR - Brasile 636
SE - Svezia 517
IT - Italia 477
UA - Ucraina 401
FI - Finlandia 202
IN - India 175
IE - Irlanda 164
CI - Costa d'Avorio 130
AL - Albania 125
HK - Hong Kong 115
FR - Francia 105
TR - Turchia 96
BD - Bangladesh 82
NL - Olanda 71
ID - Indonesia 64
AR - Argentina 62
CA - Canada 55
IQ - Iraq 43
CO - Colombia 39
EC - Ecuador 39
KR - Corea 39
AT - Austria 35
MX - Messico 35
PK - Pakistan 35
ZA - Sudafrica 28
JP - Giappone 26
ES - Italia 24
PL - Polonia 22
PY - Paraguay 21
VE - Venezuela 21
BE - Belgio 20
RO - Romania 20
UZ - Uzbekistan 20
MA - Marocco 19
PH - Filippine 19
GR - Grecia 18
CL - Cile 15
TH - Thailandia 14
AU - Australia 13
CH - Svizzera 13
MY - Malesia 13
NP - Nepal 12
SA - Arabia Saudita 12
TN - Tunisia 12
EU - Europa 11
JO - Giordania 11
KE - Kenya 11
PE - Perù 11
EG - Egitto 9
HU - Ungheria 9
BO - Bolivia 8
DZ - Algeria 8
AZ - Azerbaigian 7
BY - Bielorussia 7
IL - Israele 7
NZ - Nuova Zelanda 7
LB - Libano 6
LT - Lituania 6
NO - Norvegia 6
PT - Portogallo 6
RS - Serbia 6
A2 - ???statistics.table.value.countryCode.A2??? 5
CR - Costa Rica 5
KZ - Kazakistan 5
PS - Palestinian Territory 5
SN - Senegal 5
TT - Trinidad e Tobago 5
UY - Uruguay 5
BG - Bulgaria 4
PA - Panama 4
QA - Qatar 4
AE - Emirati Arabi Uniti 3
CZ - Repubblica Ceca 3
ET - Etiopia 3
GT - Guatemala 3
HN - Honduras 3
HR - Croazia 3
KG - Kirghizistan 3
LA - Repubblica Popolare Democratica del Laos 3
MD - Moldavia 3
OM - Oman 3
TW - Taiwan 3
BA - Bosnia-Erzegovina 2
DO - Repubblica Dominicana 2
EE - Estonia 2
IR - Iran 2
KH - Cambogia 2
LV - Lettonia 2
LY - Libia 2
MW - Malawi 2
XK - ???statistics.table.value.countryCode.XK??? 2
ZM - Zambia 2
Totale 30.883
Città #
Southend 2.234
Fairfield 1.523
Woodbridge 1.264
Ashburn 991
Singapore 903
Wilmington 813
Ann Arbor 688
Houston 620
Seattle 613
Chandler 586
Nanjing 531
Beijing 517
Dallas 509
San Jose 469
Cambridge 466
Dearborn 459
Boardman 328
Jacksonville 319
Princeton 228
Hefei 226
Ho Chi Minh City 208
Shenyang 201
Nanchang 174
Jinan 166
Hebei 162
Dublin 159
Plano 153
Hanoi 150
Frankfurt am Main 131
Rome 130
Bremen 129
Changsha 129
Dong Ket 128
Tianjin 128
Redwood City 111
Hong Kong 97
Jiaxing 96
San Diego 83
Los Angeles 77
Helsinki 71
São Paulo 71
Moscow 70
Izmir 65
Zhengzhou 65
Ningbo 62
New York 61
Hangzhou 59
Guangzhou 57
Altamura 54
The Dalles 54
Kunming 51
Delhi 49
London 49
Taizhou 49
Orem 46
Munich 45
Chicago 43
Venezia 43
Bari 40
Milan 36
Da Nang 34
Seoul 33
Chennai 32
San Paolo di Civitate 28
Westminster 28
Haikou 27
Rio de Janeiro 26
Orange 25
Pune 25
Santa Clara 25
Haiphong 24
Jakarta 24
Lawrence 24
Baghdad 23
Taiyuan 23
Atlanta 22
Manchester 22
Fuzhou 21
Lanzhou 21
Council Bluffs 20
Denver 20
Brussels 19
Fort Worth 19
Montreal 19
Shanghai 19
Tokyo 19
Warsaw 19
Kilburn 18
Phoenix 18
Tashkent 18
Amsterdam 17
Quito 17
Washington 17
Mumbai 16
Turku 16
Johannesburg 15
New Delhi 14
Norwalk 14
San Francisco 14
Boston 13
Totale 18.887
Nome #
On planar greedy drawings of 3-connected planar graphs 436
Intersection-Link Representations of Graphs 348
Relaxing the constraints of clustered planarity 315
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 307
Computing NodeTrix representations of clustered graphs 301
Morphing Planar Graph Drawings Optimally 299
How to Morph Planar Graph Drawings 299
C-Planarity of C-Connected Clustered Graphs 298
Beyond level planarity 297
Augmenting Graphs to Minimize the Diameter 291
Planar Packing of Diameter-Four Trees 281
Acyclically 3-colorable planar graphs 280
Augmenting Graphs to Minimize the Diameter 279
Strip Planarity Testing for Embedded Planar Graphs 275
On the Relationship between Map Graphs and Clique Planar Graphs 275
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 273
A Note on Minimum Area Straight-line Drawings of Planar Graphs 271
Simultaneous Embeddings with Few Bends and Crossings 267
Morphing Planar Graph Drawings Efficiently 265
On the Upward Planarity of Mixed Plane Graphs 264
Morphing Planar Graph Drawings with a Polynomial Number of Steps 261
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs 260
Colored Simultaneous Geometric Embeddings 256
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area 253
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 251
On the Queue Number of Planar Graphs 250
On the Area Requirements of Euclidean Minimum Spanning Trees 250
Three Dimensional Drawings of Bounded Degree Trees 248
An Algorithm to Construct Greedy Drawings of Triangulations 248
An Algorithm to Construct Greedy Drawings of Triangulations 248
On the Upward Planarity of Mixed Plane Graphs 248
Stack and Queue Layouts via Layered Separators 247
Drawing Planar Graphs with Many Collinear Vertices 246
A Lower Bound on the Area Requirements of Series-Parallel Graphs 244
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs 243
Acyclically 3-Colorable Planar Graphs 240
Straight-line Orthogonal Drawings of Binary and Ternary Trees 239
Testing Planarity of Partially Embedded Graphs 239
Monotone Drawings of Graphs 238
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs 238
Drawing Partially Embedded and Simultaneously Planar Graphs 238
Increasing-Chord Graphs On Point Sets 238
Monotone Drawings of Graphs 235
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 235
Simultaneous Embedding of Embedded Planar Graphs 234
A Note on Isosceles Planar Graph Drawing 232
Point-Set Embeddability of 2-Colored Trees 232
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in Small Area 231
On Representing Graphs by Touching Cuboids 229
Small Area Drawings of Outerplanar Graphs 227
Intersection-link representations of graphs 226
Simultaneous Embedding of Embedded Planar Graphs 226
Crossings between Curves with Many Tangencies 225
Colored Simultaneous Geometric Embeddings and Universal Pointsets 224
On the Perspectives Opened by Right Angle Crossing Drawings 224
Strip Planarity Testing 223
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 223
A Lower Bound on the Diameter of the Flip Graph 221
Non-Convex Representations of Graphs 221
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 218
Packing and Squeezing Subgraphs into Planar Graphs 218
Constrained Simultaneous and Near Simultaneous Embeddings 217
Succinct greedy drawings do not always exist 217
On the Area Requirements of Euclidean Minimum Spanning Trees 215
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 214
Splitting Clusters To Get C-Planarity 214
Multilevel Drawings of Clustered Graphs 213
On the Page Number of Upward Planar Directed Acyclic Graphs 212
On the area requirements of straight-line orthogonal drawings of ternary trees 211
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 211
On the Page Number of Upward Planar Directed Acyclic Graphs 210
Orthogeodesic Point-Set Embedding of Trees 210
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 210
The Simultaneous Planarity Game 209
Embedding Graphs Simultaneously with Fixed Edges 209
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces 209
Testing Planarity of Partially Embedded Graphs 208
Small Area Drawings of Outerplanar Graphs 208
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs 207
Increasing-Chord Graphs On Point Sets 207
Straight-line Rectangular Drawings of Clustered Graphs 205
Orthogeodesic point-set embedding of trees 204
Optimal Morphs of Convex Drawings 203
Planar packing of trees and spider trees 203
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 202
Polynomial area bounds for MST embeddings of trees 201
Clustered Graph Drawing 200
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 200
On the Perspectives Opened by Right Angle Crossing Drawings 199
On the Queue Number of Planar Graphs 197
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 196
On the Topologies of Local Minimum Spanning Trees 195
Upward Geometric Graph Embeddings into Point Sets 194
How to Draw a Clustered Tree 191
RAC and LAC drawings of planar graphs in subquadratic area 190
Succinct Greedy Drawings Do Not Always Exist 189
Straight-line Rectangular Drawings of Clustered Graphs 188
Constrained Simultaneous and Near-Simultaneous Embeddings 187
Upward Straight-line Embeddings of Directed Graphs into Point Sets 184
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 184
Totale 23.571
Categoria #
all - tutte 98.371
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 98.371


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021602 0 0 0 0 0 0 0 0 0 253 119 230
2021/20221.747 90 255 46 21 293 42 235 70 134 83 172 306
2022/20232.087 330 314 108 268 141 411 25 169 189 14 85 33
2023/2024955 48 54 102 36 120 121 96 210 4 28 27 109
2024/20253.605 29 87 381 70 54 122 1.185 753 395 56 180 293
2025/20266.571 511 946 620 1.009 755 379 848 116 614 773 0 0
Totale 31.755