Benvenuti nell'Anagrafe della Ricerca d'Ateneo

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/20267.326 511 946 620 1.009 755 379 848 116 614 965 383 180
2026/202737 37 0 0 0 0 0 0 0 0 0 0 0
Totale 32.547