Benvenuti nell'Anagrafe della Ricerca d'Ateneo

FRATI, FABRIZIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 10.139
EU - Europa 8.075
AS - Asia 3.037
AF - Africa 129
OC - Oceania 18
Continente sconosciuto - Info sul continente non disponibili 16
SA - Sud America 1
Totale 21.415
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 10.115
DK - Danimarca 2.793
CN - Cina 2.515
GB - Regno Unito 2.416
DE - Germania 706
SE - Svezia 507
UA - Ucraina 389
IT - Italia 387
SG - Singapore 222
RU - Federazione Russa 175
FI - Finlandia 172
IE - Irlanda 154
VN - Vietnam 130
CI - Costa d'Avorio 127
AL - Albania 120
FR - Francia 90
TR - Turchia 64
NL - Olanda 54
HK - Hong Kong 33
ID - Indonesia 24
CA - Canada 22
IN - India 22
AT - Austria 21
BE - Belgio 18
RO - Romania 18
GR - Grecia 17
AU - Australia 12
EU - Europa 11
CH - Svizzera 10
BD - Bangladesh 7
HU - Ungheria 6
NZ - Nuova Zelanda 6
A2 - ???statistics.table.value.countryCode.A2??? 5
IQ - Iraq 5
PK - Pakistan 5
PL - Polonia 5
NO - Norvegia 4
BY - Bielorussia 3
ES - Italia 2
JP - Giappone 2
LT - Lituania 2
BG - Bulgaria 1
BR - Brasile 1
CZ - Repubblica Ceca 1
DZ - Algeria 1
HR - Croazia 1
IL - Israele 1
IR - Iran 1
IS - Islanda 1
JM - Giamaica 1
JO - Giordania 1
KZ - Kazakistan 1
MA - Marocco 1
MD - Moldavia 1
MX - Messico 1
NP - Nepal 1
PT - Portogallo 1
QA - Qatar 1
SA - Arabia Saudita 1
TW - Taiwan 1
Totale 21.415
Salva come PNG Salva come JPEG
Città #
Southend 2.234
Fairfield 1.523
Woodbridge 1.264
Wilmington 811
Ashburn 730
Ann Arbor 688
Houston 613
Seattle 607
Chandler 586
Nanjing 531
Cambridge 466
Dearborn 459
Boardman 330
Jacksonville 319
Beijing 248
Princeton 228
Shenyang 200
Nanchang 174
Jinan 166
Hebei 162
Plano 153
Singapore 153
Dublin 151
Bremen 129
Dong Ket 128
Changsha 122
Tianjin 120
Redwood City 111
Jiaxing 96
Rome 94
San Diego 82
Izmir 64
Ningbo 62
Zhengzhou 61
Helsinki 59
Hangzhou 57
Altamura 54
Taizhou 49
Guangzhou 48
Kunming 48
Venezia 43
Bari 40
London 38
Hong Kong 29
San Paolo di Civitate 28
Westminster 28
Haikou 27
Orange 25
Lawrence 24
Dallas 23
Taiyuan 23
Milan 22
Fuzhou 20
Jakarta 20
Lanzhou 20
Pune 20
Chicago 19
Kilburn 18
Brussels 17
Fort Worth 16
Los Angeles 16
Washington 16
New York 14
Norwalk 14
Shanghai 14
Changchun 13
Hefei 13
Düsseldorf 12
Alameda 11
Mountain View 11
Atlanta 10
Frankfurt am Main 10
Montreal 10
Tappahannock 10
Redmond 9
Stevenage 9
Wuhan 8
Chiswick 7
Sunnyvale 7
Auckland 6
Edinburgh 6
Verona 6
Amsterdam 5
Andover 5
Baghdad 5
Berlin 5
Flushing 5
Multan 5
New Bedfont 5
Palaiseau 5
Phoenix 5
Bologna 4
Chaoyang 4
Chengdu 4
Florence 4
Fremont 4
Hounslow 4
Malang 4
Santa Clara 4
Stockholm 4
Totale 14.993
Salva come PNG Salva come JPEG
Nome #
On planar greedy drawings of 3-connected planar graphs 307
Intersection-Link Representations of Graphs 278
Computing NodeTrix representations of clustered graphs 254
On the Upward Planarity of Mixed Plane Graphs 230
Augmenting Graphs to Minimize the Diameter 227
Morphing Planar Graph Drawings Optimally 226
Planar Packing of Diameter-Four Trees 222
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 217
Simultaneous Embeddings with Few Bends and Crossings 214
Drawing Partially Embedded and Simultaneously Planar Graphs 212
Relaxing the constraints of clustered planarity 212
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs 210
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area 207
Increasing-Chord Graphs On Point Sets 206
How to Morph Planar Graph Drawings 206
On the Upward Planarity of Mixed Plane Graphs 204
C-Planarity of C-Connected Clustered Graphs 202
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 199
Acyclically 3-colorable planar graphs 199
Beyond level planarity 199
On Representing Graphs by Touching Cuboids 199
Monotone Drawings of Graphs 196
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 196
On the Area Requirements of Euclidean Minimum Spanning Trees 196
Strip Planarity Testing for Embedded Planar Graphs 194
Point-Set Embeddability of 2-Colored Trees 194
Morphing Planar Graph Drawings Efficiently 192
On the Relationship between Map Graphs and Clique Planar Graphs 191
Morphing Planar Graph Drawings with a Polynomial Number of Steps 190
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs 190
Stack and Queue Layouts via Layered Separators 189
Strip Planarity Testing 187
Simultaneous Embedding of Embedded Planar Graphs 187
On the Perspectives Opened by Right Angle Crossing Drawings 185
Simultaneous Embedding of Embedded Planar Graphs 184
Colored Simultaneous Geometric Embeddings 184
Crossings between Curves with Many Tangencies 184
Testing Planarity of Partially Embedded Graphs 182
Constrained Simultaneous and Near Simultaneous Embeddings 181
A Note on Minimum Area Straight-line Drawings of Planar Graphs 181
Monotone Drawings of Graphs 180
Succinct greedy drawings do not always exist 180
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces 180
On the Page Number of Upward Planar Directed Acyclic Graphs 179
Small Area Drawings of Outerplanar Graphs 178
Embedding Graphs Simultaneously with Fixed Edges 178
Augmenting Graphs to Minimize the Diameter 177
Splitting Clusters To Get C-Planarity 176
On the Queue Number of Planar Graphs 173
An Algorithm to Construct Greedy Drawings of Triangulations 173
Increasing-Chord Graphs On Point Sets 173
On the Page Number of Upward Planar Directed Acyclic Graphs 172
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in Small Area 172
Drawing Planar Graphs with Many Collinear Vertices 171
Small Area Drawings of Outerplanar Graphs 171
Planar packing of trees and spider trees 170
An Algorithm to Construct Greedy Drawings of Triangulations 170
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 169
Packing and Squeezing Subgraphs into Planar Graphs 169
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 168
On the area requirements of straight-line orthogonal drawings of ternary trees 168
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 167
Intersection-link representations of graphs 167
Polynomial area bounds for MST embeddings of trees 165
A Lower Bound on the Area Requirements of Series-Parallel Graphs 165
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 165
Orthogeodesic point-set embedding of trees 165
Acyclically 3-Colorable Planar Graphs 165
Upward Geometric Graph Embeddings into Point Sets 165
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs 164
On the Perspectives Opened by Right Angle Crossing Drawings 163
Straight-line Orthogonal Drawings of Binary and Ternary Trees 163
Three Dimensional Drawings of Bounded Degree Trees 163
Testing Planarity of Partially Embedded Graphs 161
Optimal Morphs of Convex Drawings 161
Colored Simultaneous Geometric Embeddings and Universal Pointsets 161
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 160
Succinct Greedy Drawings Do Not Always Exist 160
Multilevel Drawings of Clustered Graphs 160
On the Area Requirements of Euclidean Minimum Spanning Trees 160
A Note on Isosceles Planar Graph Drawing 159
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 159
The Simultaneous Planarity Game 159
Straight-line Rectangular Drawings of Clustered Graphs 156
On the Queue Number of Planar Graphs 153
On the Topologies of Local Minimum Spanning Trees 153
Straight-line Rectangular Drawings of Clustered Graphs 153
Upward Straight-line Embeddings of Directed Graphs into Point Sets 150
Upward Straight-line Embeddings of Directed Graphs into Point Sets 148
Orthogeodesic Point-Set Embedding of Trees 148
RAC and LAC drawings of planar graphs in subquadratic area 147
A Lower Bound on the Diameter of the Flip Graph 145
Drawing Partially Embedded and Simultaneously Planar Graphs 144
Non-Convex Representations of Graphs 144
Constrained Simultaneous and Near-Simultaneous Embeddings 143
Crossings Between Curves with Many Tangencies 143
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 141
On the Number of Upward Planar Orientations of Maximal Planar Graphs 140
Multilayer Drawings of Clustered Graphs 139
On the number of upward planar orientations of maximal planar graphs 139
Totale 17.923
Salva come PNG Salva come JPEG
Categoria #
all - tutte 67.816
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 67.816
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20203.279 0 0 0 0 437 528 600 580 689 211 154 80
2020/20212.651 141 119 162 111 195 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/2024961 48 54 102 36 120 121 96 210 4 28 32 110
2024/2025627 30 87 385 70 55 0 0 0 0 0 0 0
Totale 22.212