Benvenuti nell'Anagrafe della Ricerca d'Ateneo

FRATI, FABRIZIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 11.507
EU - Europa 10.072
AS - Asia 6.066
SA - Sud America 696
AF - Africa 190
OC - Oceania 20
Continente sconosciuto - Info sul continente non disponibili 16
Totale 28.567
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 11.419
CN - Cina 3.352
DK - Danimarca 2.793
GB - Regno Unito 2.456
RU - Federazione Russa 1.872
SG - Singapore 1.825
DE - Germania 779
BR - Brasile 570
SE - Svezia 516
IT - Italia 452
VN - Vietnam 426
UA - Ucraina 396
FI - Finlandia 194
IE - Irlanda 156
CI - Costa d'Avorio 128
AL - Albania 122
IN - India 96
FR - Francia 95
TR - Turchia 80
HK - Hong Kong 69
NL - Olanda 65
ID - Indonesia 48
AR - Argentina 44
CA - Canada 44
BD - Bangladesh 36
AT - Austria 34
KR - Corea 34
MX - Messico 27
EC - Ecuador 26
ZA - Sudafrica 21
BE - Belgio 20
PL - Polonia 20
CO - Colombia 18
IQ - Iraq 18
RO - Romania 18
GR - Grecia 17
ES - Italia 13
JP - Giappone 13
AU - Australia 12
PY - Paraguay 12
CH - Svizzera 11
EU - Europa 11
MA - Marocco 11
PK - Pakistan 9
UZ - Uzbekistan 8
VE - Venezuela 8
HU - Ungheria 7
NZ - Nuova Zelanda 7
PE - Perù 7
BY - Bielorussia 6
DZ - Algeria 6
EG - Egitto 6
JO - Giordania 6
LT - Lituania 6
NO - Norvegia 6
NP - Nepal 6
A2 - ???statistics.table.value.countryCode.A2??? 5
AZ - Azerbaigian 5
CL - Cile 5
TN - Tunisia 5
TT - Trinidad e Tobago 5
IL - Israele 4
KE - Kenya 4
UY - Uruguay 4
BG - Bulgaria 3
GT - Guatemala 3
LA - Repubblica Popolare Democratica del Laos 3
LB - Libano 3
QA - Qatar 3
SA - Arabia Saudita 3
BA - Bosnia-Erzegovina 2
EE - Estonia 2
ET - Etiopia 2
HN - Honduras 2
HR - Croazia 2
IR - Iran 2
KG - Kirghizistan 2
KZ - Kazakistan 2
MD - Moldavia 2
MW - Malawi 2
PA - Panama 2
PT - Portogallo 2
RS - Serbia 2
TH - Thailandia 2
AE - Emirati Arabi Uniti 1
AF - Afghanistan, Repubblica islamica di 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BO - Bolivia 1
CG - Congo 1
CR - Costa Rica 1
CZ - Repubblica Ceca 1
DO - Repubblica Dominicana 1
GE - Georgia 1
GY - Guiana 1
IS - Islanda 1
JM - Giamaica 1
KW - Kuwait 1
KY - Cayman, isole 1
LV - Lettonia 1
Totale 28.556
Salva come PNG Salva come JPEG
Città #
Southend 2.234
Fairfield 1.523
Woodbridge 1.264
Ashburn 933
Wilmington 813
Singapore 701
Ann Arbor 688
Houston 619
Seattle 612
Chandler 586
Nanjing 531
Beijing 512
Dallas 507
Cambridge 466
Dearborn 459
Boardman 328
Jacksonville 319
Princeton 228
Hefei 226
Shenyang 201
Nanchang 174
Jinan 166
Hebei 162
Plano 153
Dublin 151
Bremen 129
Changsha 129
Dong Ket 128
Tianjin 128
Rome 122
Ho Chi Minh City 120
Redwood City 111
Jiaxing 96
San Diego 83
Moscow 70
Hanoi 68
Hong Kong 65
São Paulo 65
Zhengzhou 65
Helsinki 64
Izmir 64
Los Angeles 62
Ningbo 62
Hangzhou 59
Guangzhou 56
Altamura 54
Kunming 51
The Dalles 51
New York 50
Taizhou 49
Delhi 46
London 45
Munich 45
Venezia 43
Chicago 42
Bari 40
Milan 35
Seoul 33
San Paolo di Civitate 28
Westminster 28
Haikou 27
Orange 25
Lawrence 24
Jakarta 23
Taiyuan 23
Fuzhou 21
Lanzhou 21
Pune 21
Denver 20
Atlanta 19
Brussels 19
Fort Worth 19
Kilburn 18
Phoenix 18
Shanghai 18
Rio de Janeiro 17
Warsaw 17
Washington 17
Da Nang 16
Haiphong 16
Manchester 16
Montreal 16
Turku 16
Norwalk 14
San Francisco 14
Santa Clara 14
Boston 13
Brooklyn 13
Changchun 13
Frankfurt am Main 13
Stockholm 13
Amsterdam 12
Baghdad 12
Belo Horizonte 12
Columbus 12
Düsseldorf 12
Falkenstein 12
Quito 12
Alameda 11
Mountain View 11
Totale 17.602
Salva come PNG Salva come JPEG
Nome #
On planar greedy drawings of 3-connected planar graphs 420
Intersection-Link Representations of Graphs 323
Computing NodeTrix representations of clustered graphs 289
Morphing Planar Graph Drawings Optimally 287
Relaxing the constraints of clustered planarity 287
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 287
Beyond level planarity 280
How to Morph Planar Graph Drawings 279
C-Planarity of C-Connected Clustered Graphs 277
Augmenting Graphs to Minimize the Diameter 275
Planar Packing of Diameter-Four Trees 269
Acyclically 3-colorable planar graphs 264
On the Relationship between Map Graphs and Clique Planar Graphs 262
Simultaneous Embeddings with Few Bends and Crossings 260
On the Upward Planarity of Mixed Plane Graphs 251
Morphing Planar Graph Drawings Efficiently 250
A Note on Minimum Area Straight-line Drawings of Planar Graphs 250
Augmenting Graphs to Minimize the Diameter 246
On the Queue Number of Planar Graphs 245
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 245
Morphing Planar Graph Drawings with a Polynomial Number of Steps 244
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs 242
Colored Simultaneous Geometric Embeddings 241
Three Dimensional Drawings of Bounded Degree Trees 240
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area 238
On the Area Requirements of Euclidean Minimum Spanning Trees 237
On the Upward Planarity of Mixed Plane Graphs 236
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 235
Straight-line Orthogonal Drawings of Binary and Ternary Trees 235
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs 235
Strip Planarity Testing for Embedded Planar Graphs 235
An Algorithm to Construct Greedy Drawings of Triangulations 235
Stack and Queue Layouts via Layered Separators 235
An Algorithm to Construct Greedy Drawings of Triangulations 234
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs 233
Drawing Partially Embedded and Simultaneously Planar Graphs 231
A Lower Bound on the Area Requirements of Series-Parallel Graphs 230
Increasing-Chord Graphs On Point Sets 230
Drawing Planar Graphs with Many Collinear Vertices 230
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 226
Acyclically 3-Colorable Planar Graphs 226
Monotone Drawings of Graphs 222
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in Small Area 221
Point-Set Embeddability of 2-Colored Trees 221
On Representing Graphs by Touching Cuboids 221
Simultaneous Embedding of Embedded Planar Graphs 219
Monotone Drawings of Graphs 218
Testing Planarity of Partially Embedded Graphs 218
Non-Convex Representations of Graphs 217
A Note on Isosceles Planar Graph Drawing 215
Simultaneous Embedding of Embedded Planar Graphs 215
Crossings between Curves with Many Tangencies 214
Small Area Drawings of Outerplanar Graphs 212
Intersection-link representations of graphs 211
On the Perspectives Opened by Right Angle Crossing Drawings 211
Strip Planarity Testing 209
Splitting Clusters To Get C-Planarity 208
Succinct greedy drawings do not always exist 208
Constrained Simultaneous and Near Simultaneous Embeddings 207
A Lower Bound on the Diameter of the Flip Graph 207
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 206
Colored Simultaneous Geometric Embeddings and Universal Pointsets 205
On the Page Number of Upward Planar Directed Acyclic Graphs 204
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces 204
Orthogeodesic Point-Set Embedding of Trees 203
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 202
Packing and Squeezing Subgraphs into Planar Graphs 202
On the Page Number of Upward Planar Directed Acyclic Graphs 201
Embedding Graphs Simultaneously with Fixed Edges 200
Increasing-Chord Graphs On Point Sets 200
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 198
On the area requirements of straight-line orthogonal drawings of ternary trees 198
Small Area Drawings of Outerplanar Graphs 198
On the Area Requirements of Euclidean Minimum Spanning Trees 196
Testing Planarity of Partially Embedded Graphs 195
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 195
The Simultaneous Planarity Game 194
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 193
On the Perspectives Opened by Right Angle Crossing Drawings 193
Planar packing of trees and spider trees 193
Polynomial area bounds for MST embeddings of trees 191
Multilevel Drawings of Clustered Graphs 191
On the Queue Number of Planar Graphs 189
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 189
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 189
Upward Geometric Graph Embeddings into Point Sets 189
Optimal Morphs of Convex Drawings 188
Orthogeodesic point-set embedding of trees 187
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs 187
How to Draw a Clustered Tree 185
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 185
Succinct Greedy Drawings Do Not Always Exist 184
Straight-line Rectangular Drawings of Clustered Graphs 183
On the Topologies of Local Minimum Spanning Trees 182
RAC and LAC drawings of planar graphs in subquadratic area 181
Clustered Graph Drawing 181
Upward Straight-line Embeddings of Directed Graphs into Point Sets 177
Computing NodeTrix Representations of Clustered Graphs 175
Upward Straight-line Embeddings of Directed Graphs into Point Sets 175
Straight-line Rectangular Drawings of Clustered Graphs 174
Totale 22.210
Salva come PNG Salva come JPEG
Categoria #
all - tutte 93.910
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 93.910
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.923 0 0 0 0 0 213 429 298 381 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/20264.206 511 946 620 1.009 755 365 0 0 0 0 0 0
Totale 29.390