Benvenuti nell'Anagrafe della Ricerca d'Ateneo

DA LOZZO, GIORDANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.991
EU - Europa 4.350
AS - Asia 3.498
SA - Sud America 430
AF - Africa 93
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 3
Totale 14.373
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.921
CN - Cina 1.764
RU - Federazione Russa 1.359
SG - Singapore 1.101
GB - Regno Unito 796
DK - Danimarca 546
DE - Germania 467
BR - Brasile 357
SE - Svezia 338
IT - Italia 318
VN - Vietnam 301
FI - Finlandia 97
IN - India 94
UA - Ucraina 82
IE - Irlanda 75
FR - Francia 61
HK - Hong Kong 61
NL - Olanda 57
CI - Costa d'Avorio 54
AL - Albania 37
CA - Canada 36
AR - Argentina 33
KR - Corea 32
TR - Turchia 28
ID - Indonesia 27
AT - Austria 22
MX - Messico 21
BE - Belgio 20
ZA - Sudafrica 19
BD - Bangladesh 16
PL - Polonia 16
GR - Grecia 15
ES - Italia 12
JP - Giappone 12
EC - Ecuador 11
PK - Pakistan 10
IQ - Iraq 8
AE - Emirati Arabi Uniti 7
PE - Perù 7
CO - Colombia 6
LT - Lituania 6
NZ - Nuova Zelanda 6
JO - Giordania 5
NO - Norvegia 5
PY - Paraguay 5
CL - Cile 4
IL - Israele 4
KE - Kenya 4
RO - Romania 4
VE - Venezuela 4
AZ - Azerbaigian 3
BY - Bielorussia 3
DZ - Algeria 3
ET - Etiopia 3
EU - Europa 3
JM - Giamaica 3
KZ - Kazakistan 3
MA - Marocco 3
MY - Malesia 3
PA - Panama 3
TH - Thailandia 3
TN - Tunisia 3
UZ - Uzbekistan 3
AU - Australia 2
BA - Bosnia-Erzegovina 2
CH - Svizzera 2
DO - Repubblica Dominicana 2
EG - Egitto 2
HU - Ungheria 2
LB - Libano 2
SA - Arabia Saudita 2
TT - Trinidad e Tobago 2
AM - Armenia 1
BB - Barbados 1
BG - Bulgaria 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BO - Bolivia 1
BS - Bahamas 1
CR - Costa Rica 1
CZ - Repubblica Ceca 1
EE - Estonia 1
GY - Guiana 1
HR - Croazia 1
IS - Islanda 1
KG - Kirghizistan 1
LA - Repubblica Popolare Democratica del Laos 1
LU - Lussemburgo 1
LV - Lettonia 1
MW - Malawi 1
NP - Nepal 1
PH - Filippine 1
QA - Qatar 1
SI - Slovenia 1
SN - Senegal 1
TJ - Tagikistan 1
UY - Uruguay 1
Totale 14.373
Salva come PNG Salva come JPEG
Città #
Dallas 830
Southend 681
Fairfield 618
Woodbridge 540
Ashburn 502
Singapore 411
Chandler 336
Wilmington 311
Houston 297
Beijing 284
Seattle 260
Ann Arbor 256
Cambridge 217
Boardman 204
Hefei 188
Nanjing 176
Dearborn 158
Rome 147
Dong Ket 136
Shenyang 83
Princeton 82
Jacksonville 81
Ho Chi Minh City 76
Dublin 74
Jinan 72
Nanchang 72
Bremen 71
The Dalles 65
Hong Kong 61
Moscow 59
Hebei 57
Munich 56
Los Angeles 53
Changsha 52
Helsinki 51
Tianjin 51
Delhi 46
Plano 45
Jiaxing 44
Shanghai 44
London 41
Redwood City 39
Chicago 34
Columbus 34
Zhengzhou 34
Ningbo 33
Seoul 32
São Paulo 32
Guangzhou 31
Hanoi 31
New York 26
San Diego 26
Milan 25
Kunming 24
Hangzhou 21
Brussels 20
Montreal 18
Haikou 17
Izmir 17
Taizhou 16
Turku 16
Denver 15
Westminster 15
Ancona 14
Atlanta 14
Boston 14
Brooklyn 14
Falkenstein 14
Pune 14
Shenzhen 14
Warsaw 14
Washington 14
Jakarta 13
Phoenix 13
Santa Clara 13
Altamura 12
Belo Horizonte 12
Düsseldorf 12
Johannesburg 12
Manchester 12
Poplar 12
Lanzhou 11
Mumbai 11
Salt Lake City 11
Chennai 10
Stockholm 10
Tappahannock 10
Amsterdam 9
Frankfurt am Main 9
Haiphong 9
Lawrence 9
Orange 9
Taiyuan 9
Vienna 9
Yubileyny 9
Bari 8
Nuremberg 8
Renton 8
Rio de Janeiro 8
Wuhan 8
Totale 8.856
Salva come PNG Salva come JPEG
Nome #
On planar greedy drawings of 3-connected planar graphs 419
Intersection-Link Representations of Graphs 321
Computing NodeTrix representations of clustered graphs 288
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 286
Relaxing the constraints of clustered planarity 286
Morphing Planar Graph Drawings Optimally 284
Windrose planarity: Embedding graphs with direction-constrained edges 282
Beyond level planarity 277
Anchored Drawings of Planar Graphs 276
L-drawings of directed graphs 276
How to Morph Planar Graph Drawings 274
On the Relationship between Map Graphs and Clique Planar Graphs 261
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 245
Visual discovery of the correlation between BGP routing and round-trip delay active measurements 244
Advancements on SEFE and Partitioned Book Embedding problems 237
Drawing Non-planar Graphs with Crossing-free Subgraphs 236
Algorithms and Bounds for L-Drawings of Directed Graphs 236
Strip Planarity Testing for Embedded Planar Graphs 231
Drawing Planar Graphs with Many Collinear Vertices 227
On the Relationship Between k-Planar and k-Quasi-Planar Graphs 224
Intersection-link representations of graphs 209
Strip Planarity Testing 209
Simultaneous orthogonal planarity 205
Windrose planarity: Embedding graphs with direction-constrained edges 205
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 203
Drawing Graphs on a Smartphone 199
Clustered Planarity with Pipes 195
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 193
Drawing Graphs on a Smartphone 191
Clustered Planarity with Pipes 190
Optimal Morphs of Convex Drawings 186
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 184
3-coloring arrangements of line segments with 4 slopes is hard 179
On Some NP-complete SEFE Problems 173
Computing NodeTrix Representations of Clustered Graphs 173
Planar L-Drawings of directed graphs 171
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 170
Subexponential-time and FPT algorithms for embedded flat clustered planarity 159
Planarity of streamed graphs 156
How to morph a tree on a small grid 144
Planar Embeddings with Small and Uniform Faces 141
Reaching 3-connectivity via edge-edge additions 141
Analogies between the Crossing Number and the Tangle Crossing Number 140
Extending Upward Planar Graph Drawings 139
Approximation algorithms for facial cycles in planar embeddings 135
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth 131
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 130
Computing k-modal embeddings of planar digraphs 129
Graph Product Structure for $h$-Framed Graphs 128
Planar L-Drawings of Directed Graphs 126
Upward planar morphs 125
Drawing Planar Graphs with Many Collinear Vertices 125
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width 123
Beyond Clustered Planar Graphs 122
On Planar Greedy Drawings of 3-Connected Planar Graphs 119
Quantum algorithms for one-sided crossing minimization 115
On Upward-Planar L-Drawings of Graphs 114
C-planarity testing of embedded clustered graphs with bounded dual carving-width 112
Morphing contact representations of graphs 110
Planarity of streamed graphs 110
Simple k-planar graphs are simple (k + 1)-quasiplanar 109
Book embeddings of nonplanar graphs with small faces in few pages 107
Graph Stories in Small Area 106
Graph Stories in Small Area 105
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs 103
Upward Pointset Embeddings of Planar st-Graphs 99
How to Morph a Tree on a Small Grid 99
Morphing Triangle Contact Representations of Triangulations 97
Quantum Graph Drawing 96
Upward book embeddings of st-Graphs 95
SEFE = C-planarity? 94
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths 93
Upward Planar Morphs 91
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth 85
Book embeddings of k-framed graphs and k-map graphs 83
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs 83
Recognizing Map Graphs of Bounded Treewidth 78
Planar L-Drawings of Bimodal Graphs 67
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 66
Upward Pointset Embeddings of Planar st-Graphs 65
Unit-length Rectangular Drawings of Graphs 64
On the upward book thickness problem: Combinatorial and complexity results 62
Extending upward planar graph drawings 62
The Price of Upwardness 62
On the Upward Book Thickness Problem: Combinatorial and Complexity Results 61
Upward Book Embeddability of st-Graphs: Complexity and Algorithms 59
Graph Product Structure for h-Framed Graphs 58
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 56
Recognizing Map Graphs of Bounded Treewidth 56
The Price of Upwardness 52
On Upward-Planar L-Drawings of Graphs 50
Quantum Algorithms for One-Sided Crossing Minimization 50
Recognizing DAGs with page-number 2 is NP-complete 50
Simple Realizability of Abstract Topological Graphs 49
Planar L-Drawings of Bimodal Graphs 48
Unit-length Rectangular Drawings of Graphs 48
The Parametrized Complexity of the Segment Number 47
Weakly Leveled Planarity with Bounded Span 43
Recognizing DAGs with Page-Number 2 Is NP-complete 43
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 42
Totale 14.502
Salva come PNG Salva come JPEG
Categoria #
all - tutte 50.071
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 50.071
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021864 0 0 0 0 0 111 143 111 130 126 52 191
2021/2022735 39 37 55 19 141 41 59 43 70 47 75 109
2022/20231.261 219 198 60 146 80 227 26 112 104 12 54 23
2023/2024633 31 30 75 25 70 93 62 87 2 16 53 89
2024/20252.758 15 55 253 67 54 124 938 539 267 70 140 236
2025/20263.403 400 1.271 432 677 535 88 0 0 0 0 0 0
Totale 14.704