FRATI, FABRIZIO
 Distribuzione geografica
Continente #
NA - Nord America 13.219
EU - Europa 10.446
AS - Asia 7.285
SA - Sud America 900
Continente sconosciuto - Info sul continente non disponibili 868
AF - Africa 238
OC - Oceania 21
Totale 32.977
Nazione #
US - Stati Uniti d'America 13.046
CN - Cina 3.515
DK - Danimarca 2.795
GB - Regno Unito 2.480
SG - Singapore 2.086
RU - Federazione Russa 1.896
DE - Germania 903
VN - Vietnam 743
BR - Brasile 653
IT - Italia 560
SE - Svezia 517
UA - Ucraina 404
FI - Finlandia 202
IN - India 177
IE - Irlanda 164
BD - Bangladesh 163
CI - Costa d'Avorio 130
AL - Albania 126
HK - Hong Kong 116
FR - Francia 106
TR - Turchia 97
CA - Canada 86
NL - Olanda 71
ID - Indonesia 68
AR - Argentina 66
CO - Colombia 49
EC - Ecuador 45
IQ - Iraq 43
KR - Corea 39
MX - Messico 37
PK - Pakistan 37
AT - Austria 35
ZA - Sudafrica 28
ES - Italia 27
JP - Giappone 26
VE - Venezuela 25
PL - Polonia 22
PH - Filippine 21
PY - Paraguay 21
RO - Romania 21
BE - Belgio 20
UZ - Uzbekistan 20
MA - Marocco 19
GR - Grecia 18
CL - Cile 16
MY - Malesia 15
SA - Arabia Saudita 15
TH - Thailandia 14
AU - Australia 13
CH - Svizzera 13
NP - Nepal 13
TN - Tunisia 12
EU - Europa 11
JO - Giordania 11
KE - Kenya 11
PE - Perù 11
HU - Ungheria 10
EG - Egitto 9
PT - Portogallo 9
BO - Bolivia 8
DZ - Algeria 8
LB - Libano 8
TT - Trinidad e Tobago 8
AZ - Azerbaigian 7
BY - Bielorussia 7
HN - Honduras 7
IL - Israele 7
JM - Giamaica 7
NZ - Nuova Zelanda 7
CR - Costa Rica 6
LT - Lituania 6
NO - Norvegia 6
RS - Serbia 6
A2 - ???statistics.table.value.countryCode.A2??? 5
GT - Guatemala 5
KZ - Kazakistan 5
PS - Palestinian Territory 5
SN - Senegal 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
HR - Croazia 3
KG - Kirghizistan 3
LA - Repubblica Popolare Democratica del Laos 3
MD - Moldavia 3
OM - Oman 3
TW - Taiwan 3
AM - Armenia 2
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
Totale 32.091
Città #
Southend 2.234
Fairfield 1.523
Woodbridge 1.265
Ashburn 1.055
Singapore 906
San Jose 895
Wilmington 814
Ann Arbor 688
Houston 623
Seattle 616
Chandler 586
Nanjing 531
Beijing 519
Dallas 516
Cambridge 467
Dearborn 459
Boardman 328
Jacksonville 323
Princeton 228
Hefei 226
Ho Chi Minh City 209
Shenyang 201
Nanchang 174
Jinan 166
Hebei 162
Dublin 159
Plano 153
Rome 151
Hanoi 150
Frankfurt am Main 131
Bremen 129
Changsha 129
Dong Ket 128
Tianjin 128
Redwood City 111
Hong Kong 98
Jiaxing 96
Los Angeles 94
San Diego 84
New York 82
São Paulo 74
The Dalles 73
Helsinki 71
Moscow 70
Izmir 65
Zhengzhou 65
Ningbo 62
Hangzhou 59
Guangzhou 57
Altamura 54
London 52
Chicago 51
Kunming 51
Delhi 49
Taizhou 49
Orem 46
Munich 45
Milan 43
Santa Clara 43
Venezia 43
Bari 42
Da Nang 34
Seoul 33
Chennai 32
Council Bluffs 28
San Paolo di Civitate 28
Westminster 28
Atlanta 27
Haikou 27
Phoenix 26
Rio de Janeiro 26
Orange 25
Pune 25
Haiphong 24
Jakarta 24
Lawrence 24
Montreal 24
Baghdad 23
Buffalo 23
Taiyuan 23
Manchester 22
Fuzhou 21
Lanzhou 21
Denver 20
Brussels 19
Fort Worth 19
Shanghai 19
Tokyo 19
Warsaw 19
Kilburn 18
Quito 18
Tashkent 18
Washington 18
Amsterdam 17
Brooklyn 17
Columbus 17
Mumbai 17
San Francisco 17
Turku 16
Johannesburg 15
Totale 19.572
Nome #
On planar greedy drawings of 3-connected planar graphs 446
Intersection-Link Representations of Graphs 357
Relaxing the constraints of clustered planarity 341
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 310
Computing NodeTrix representations of clustered graphs 307
How to Morph Planar Graph Drawings 305
Morphing Planar Graph Drawings Optimally 304
C-Planarity of C-Connected Clustered Graphs 304
Beyond level planarity 302
Augmenting Graphs to Minimize the Diameter 294
Augmenting Graphs to Minimize the Diameter 293
Planar Packing of Diameter-Four Trees 289
Strip Planarity Testing for Embedded Planar Graphs 289
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 286
Acyclically 3-colorable planar graphs 284
On the Relationship between Map Graphs and Clique Planar Graphs 280
A Note on Minimum Area Straight-line Drawings of Planar Graphs 278
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs 274
Simultaneous Embeddings with Few Bends and Crossings 273
Morphing Planar Graph Drawings Efficiently 271
On the Upward Planarity of Mixed Plane Graphs 267
Morphing Planar Graph Drawings with a Polynomial Number of Steps 265
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area 262
Colored Simultaneous Geometric Embeddings 261
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 258
On the Queue Number of Planar Graphs 258
A Note on Isosceles Planar Graph Drawing 257
An Algorithm to Construct Greedy Drawings of Triangulations 256
Monotone Drawings of Graphs 255
On the Area Requirements of Euclidean Minimum Spanning Trees 255
On the Upward Planarity of Mixed Plane Graphs 255
Drawing Planar Graphs with Many Collinear Vertices 253
Three Dimensional Drawings of Bounded Degree Trees 252
An Algorithm to Construct Greedy Drawings of Triangulations 252
Stack and Queue Layouts via Layered Separators 250
A Lower Bound on the Area Requirements of Series-Parallel Graphs 248
Testing Planarity of Partially Embedded Graphs 248
Straight-line Orthogonal Drawings of Binary and Ternary Trees 246
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs 246
Acyclically 3-Colorable Planar Graphs 245
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs 244
Monotone Drawings of Graphs 243
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 243
Increasing-Chord Graphs On Point Sets 243
Drawing Partially Embedded and Simultaneously Planar Graphs 242
Point-Set Embeddability of 2-Colored Trees 239
Simultaneous Embedding of Embedded Planar Graphs 237
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in Small Area 237
Simultaneous Embedding of Embedded Planar Graphs 235
On Representing Graphs by Touching Cuboids 235
Small Area Drawings of Outerplanar Graphs 234
Intersection-link representations of graphs 232
Crossings between Curves with Many Tangencies 232
Colored Simultaneous Geometric Embeddings and Universal Pointsets 230
On the Perspectives Opened by Right Angle Crossing Drawings 229
A Lower Bound on the Diameter of the Flip Graph 228
Non-Convex Representations of Graphs 228
Strip Planarity Testing 227
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 227
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 224
Succinct greedy drawings do not always exist 224
Packing and Squeezing Subgraphs into Planar Graphs 223
Constrained Simultaneous and Near Simultaneous Embeddings 222
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 220
Splitting Clusters To Get C-Planarity 220
On the Page Number of Upward Planar Directed Acyclic Graphs 219
On the Area Requirements of Euclidean Minimum Spanning Trees 219
On the area requirements of straight-line orthogonal drawings of ternary trees 218
Orthogeodesic Point-Set Embedding of Trees 218
The Simultaneous Planarity Game 217
Multilevel Drawings of Clustered Graphs 217
Small Area Drawings of Outerplanar Graphs 217
On the Page Number of Upward Planar Directed Acyclic Graphs 216
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 216
Testing Planarity of Partially Embedded Graphs 215
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs 215
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces 215
Embedding Graphs Simultaneously with Fixed Edges 214
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 214
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 213
Increasing-Chord Graphs On Point Sets 211
Polynomial area bounds for MST embeddings of trees 209
Straight-line Rectangular Drawings of Clustered Graphs 209
Orthogeodesic point-set embedding of trees 208
Optimal Morphs of Convex Drawings 207
Planar packing of trees and spider trees 207
Upward Pointset Embeddings of Planar st-Graphs 206
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 205
On the Perspectives Opened by Right Angle Crossing Drawings 203
Clustered Graph Drawing 203
On the Queue Number of Planar Graphs 202
How to Draw a Clustered Tree 201
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 199
Succinct Greedy Drawings Do Not Always Exist 199
Upward Geometric Graph Embeddings into Point Sets 199
On the Topologies of Local Minimum Spanning Trees 198
RAC and LAC drawings of planar graphs in subquadratic area 194
Straight-line Rectangular Drawings of Clustered Graphs 193
Constrained Simultaneous and Near-Simultaneous Embeddings 191
Upward Straight-line Embeddings of Directed Graphs into Point Sets 191
Totale 24.252
Categoria #
all - tutte 107.803
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 107.803


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20221.402 0 0 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/20267.326 511 946 620 1.009 755 379 848 116 614 965 383 180
2026/2027467 138 179 150 0 0 0 0 0 0 0 0 0
Totale 32.977