Benvenuti nell'Anagrafe della Ricerca d'Ateneo

FRATI, FABRIZIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 9.757
EU - Europa 8.033
AS - Asia 2.690
AF - Africa 129
OC - Oceania 18
Continente sconosciuto - Info sul continente non disponibili 16
SA - Sud America 1
Totale 20.644
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 9.734
DK - Danimarca 2.792
CN - Cina 2.446
GB - Regno Unito 2.414
DE - Germania 695
SE - Svezia 506
UA - Ucraina 389
IT - Italia 375
RU - Federazione Russa 175
FI - Finlandia 166
IE - Irlanda 154
VN - Vietnam 129
CI - Costa d'Avorio 127
AL - Albania 120
FR - Francia 86
TR - Turchia 64
NL - Olanda 53
CA - Canada 22
IN - India 22
AT - Austria 20
BE - Belgio 18
GR - Grecia 17
RO - Romania 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
HK - Hong Kong 4
NO - Norvegia 4
BY - Bielorussia 3
ES - Italia 2
JP - Giappone 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
KZ - Kazakistan 1
MA - Marocco 1
MD - Moldavia 1
MX - Messico 1
NP - Nepal 1
PT - Portogallo 1
QA - Qatar 1
TW - Taiwan 1
Totale 20.644
Salva come PNG Salva come JPEG
Città #
Southend 2.234
Fairfield 1.523
Woodbridge 1.264
Wilmington 811
Ashburn 728
Ann Arbor 688
Houston 613
Seattle 607
Chandler 586
Nanjing 531
Cambridge 466
Dearborn 459
Jacksonville 319
Beijing 248
Princeton 228
Shenyang 200
Nanchang 174
Jinan 166
Hebei 162
Plano 153
Dublin 151
Bremen 129
Dong Ket 128
Changsha 122
Tianjin 120
Redwood City 111
Jiaxing 96
Rome 87
San Diego 82
Izmir 64
Ningbo 62
Zhengzhou 61
Hangzhou 57
Altamura 54
Helsinki 53
Taizhou 49
Guangzhou 48
Kunming 48
Venezia 43
Bari 40
London 36
San Paolo di Civitate 28
Westminster 28
Haikou 27
Orange 25
Lawrence 24
Taiyuan 23
Boardman 22
Milan 22
Fuzhou 20
Lanzhou 20
Pune 20
Chicago 19
Kilburn 18
Brussels 17
Fort Worth 16
Washington 16
Los Angeles 15
New York 14
Norwalk 14
Changchun 13
Hefei 13
Düsseldorf 12
Alameda 11
Mountain View 11
Atlanta 10
Montreal 10
Shanghai 10
Tappahannock 10
Redmond 9
Stevenage 9
Chiswick 7
Sunnyvale 7
Wuhan 7
Auckland 6
Edinburgh 6
Verona 6
Andover 5
Baghdad 5
Berlin 5
Dallas 5
Flushing 5
Multan 5
New Bedfont 5
Palaiseau 5
Phoenix 5
Amsterdam 4
Bologna 4
Chaoyang 4
Chengdu 4
Florence 4
Fremont 4
Hounslow 4
Xian 4
Acton 3
Augusta 3
Bergen 3
Buffalo 3
Dhaka 3
Eugene 3
Totale 14.441
Salva come PNG Salva come JPEG
Nome #
On planar greedy drawings of 3-connected planar graphs 286
Intersection-Link Representations of Graphs 272
Computing NodeTrix representations of clustered graphs 251
On the Upward Planarity of Mixed Plane Graphs 225
Morphing Planar Graph Drawings Optimally 221
Augmenting Graphs to Minimize the Diameter 221
Planar Packing of Diameter-Four Trees 219
Simultaneous Embeddings with Few Bends and Crossings 211
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs 210
Drawing Partially Embedded and Simultaneously Planar Graphs 208
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs 207
Relaxing the constraints of clustered planarity 206
Increasing-Chord Graphs On Point Sets 204
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area 204
On the Upward Planarity of Mixed Plane Graphs 200
How to Morph Planar Graph Drawings 197
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree 195
On Representing Graphs by Touching Cuboids 195
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph 194
C-Planarity of C-Connected Clustered Graphs 193
Acyclically 3-colorable planar graphs 191
Monotone Drawings of Graphs 191
Point-Set Embeddability of 2-Colored Trees 191
Beyond level planarity 190
Morphing Planar Graph Drawings Efficiently 188
On the Relationship between Map Graphs and Clique Planar Graphs 187
On the Area Requirements of Euclidean Minimum Spanning Trees 186
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs 185
Stack and Queue Layouts via Layered Separators 185
Morphing Planar Graph Drawings with a Polynomial Number of Steps 184
Simultaneous Embedding of Embedded Planar Graphs 184
Strip Planarity Testing for Embedded Planar Graphs 182
Strip Planarity Testing 182
Simultaneous Embedding of Embedded Planar Graphs 181
On the Perspectives Opened by Right Angle Crossing Drawings 181
Crossings between Curves with Many Tangencies 180
Colored Simultaneous Geometric Embeddings 178
Constrained Simultaneous and Near Simultaneous Embeddings 177
Monotone Drawings of Graphs 176
On the Page Number of Upward Planar Directed Acyclic Graphs 176
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces 176
Testing Planarity of Partially Embedded Graphs 175
Succinct greedy drawings do not always exist 175
Embedding Graphs Simultaneously with Fixed Edges 174
Small Area Drawings of Outerplanar Graphs 173
Splitting Clusters To Get C-Planarity 173
A Note on Minimum Area Straight-line Drawings of Planar Graphs 173
Augmenting Graphs to Minimize the Diameter 170
On the Page Number of Upward Planar Directed Acyclic Graphs 169
On the Queue Number of Planar Graphs 168
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features 168
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in Small Area 167
An Algorithm to Construct Greedy Drawings of Triangulations 167
Small Area Drawings of Outerplanar Graphs 167
Drawing Planar Graphs with Many Collinear Vertices 166
Packing and Squeezing Subgraphs into Planar Graphs 166
Planar packing of trees and spider trees 165
Increasing-Chord Graphs On Point Sets 165
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features 163
On the area requirements of straight-line orthogonal drawings of ternary trees 163
Polynomial area bounds for MST embeddings of trees 162
An Algorithm to Construct Greedy Drawings of Triangulations 162
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs 161
Orthogeodesic point-set embedding of trees 161
Upward Geometric Graph Embeddings into Point Sets 161
On the Perspectives Opened by Right Angle Crossing Drawings 160
Straight-line Orthogonal Drawings of Binary and Ternary Trees 160
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 160
Intersection-link representations of graphs 160
Acyclically 3-Colorable Planar Graphs 160
Three Dimensional Drawings of Bounded Degree Trees 159
A Lower Bound on the Area Requirements of Series-Parallel Graphs 159
Multilevel Drawings of Clustered Graphs 159
Testing Planarity of Partially Embedded Graphs 158
Optimal Morphs of Convex Drawings 158
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs 157
Succinct Greedy Drawings Do Not Always Exist 157
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 156
Colored Simultaneous Geometric Embeddings and Universal Pointsets 156
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graph 155
The Simultaneous Planarity Game 154
On the Area Requirements of Euclidean Minimum Spanning Trees 154
A Note on Isosceles Planar Graph Drawing 151
On the Queue Number of Planar Graphs 150
Straight-line Rectangular Drawings of Clustered Graphs 149
On the Topologies of Local Minimum Spanning Trees 148
Straight-line Rectangular Drawings of Clustered Graphs 148
RAC and LAC drawings of planar graphs in subquadratic area 147
Upward Straight-line Embeddings of Directed Graphs into Point Sets 147
Orthogeodesic Point-Set Embedding of Trees 145
Upward Straight-line Embeddings of Directed Graphs into Point Sets 144
Drawing Partially Embedded and Simultaneously Planar Graphs 140
Non-Convex Representations of Graphs 140
Constrained Simultaneous and Near-Simultaneous Embeddings 140
Crossings Between Curves with Many Tangencies 140
A Lower Bound on the Diameter of the Flip Graph 139
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 138
On the Number of Upward Planar Orientations of Maximal Planar Graphs 137
Multilayer Drawings of Clustered Graphs 136
On the number of upward planar orientations of maximal planar graphs 135
Totale 17.440
Salva come PNG Salva come JPEG
Categoria #
all - tutte 57.621
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 57.621
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20191.684 0 0 0 0 0 0 0 0 0 238 762 684
2019/20205.642 1.228 393 291 451 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/2024812 48 54 102 36 120 121 96 210 4 21 0 0
Totale 21.436