DA LOZZO, GIORDANO
 Distribuzione geografica
Continente #
NA - Nord America 6.586
EU - Europa 4.619
AS - Asia 4.451
SA - Sud America 577
AF - Africa 137
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 4
Totale 16.382
Nazione #
US - Stati Uniti d'America 6.485
CN - Cina 1.948
RU - Federazione Russa 1.369
SG - Singapore 1.337
GB - Regno Unito 813
DE - Germania 598
VN - Vietnam 554
DK - Danimarca 548
BR - Brasile 437
IT - Italia 357
SE - Svezia 341
IN - India 136
FI - Finlandia 102
HK - Hong Kong 102
UA - Ucraina 88
IE - Irlanda 79
FR - Francia 73
NL - Olanda 63
CI - Costa d'Avorio 56
AR - Argentina 52
BD - Bangladesh 49
CA - Canada 45
AL - Albania 41
TR - Turchia 39
ID - Indonesia 37
KR - Corea 36
MX - Messico 34
PK - Pakistan 32
IQ - Iraq 31
ZA - Sudafrica 28
AT - Austria 22
PL - Polonia 22
EC - Ecuador 21
BE - Belgio 20
ES - Italia 19
JP - Giappone 19
PH - Filippine 19
CO - Colombia 17
GR - Grecia 16
MY - Malesia 15
UZ - Uzbekistan 14
MA - Marocco 11
PE - Perù 11
VE - Venezuela 11
AE - Emirati Arabi Uniti 10
JO - Giordania 10
KE - Kenya 10
SA - Arabia Saudita 10
TN - Tunisia 10
CL - Cile 9
PY - Paraguay 8
TH - Thailandia 8
AZ - Azerbaigian 7
NP - Nepal 7
LT - Lituania 6
NZ - Nuova Zelanda 6
RO - Romania 6
BO - Bolivia 5
DZ - Algeria 5
EG - Egitto 5
ET - Etiopia 5
IL - Israele 5
NO - Norvegia 5
CH - Svizzera 4
CR - Costa Rica 4
DO - Repubblica Dominicana 4
JM - Giamaica 4
KZ - Kazakistan 4
LB - Libano 4
PA - Panama 4
BA - Bosnia-Erzegovina 3
BY - Bielorussia 3
EU - Europa 3
HU - Ungheria 3
LV - Lettonia 3
PT - Portogallo 3
QA - Qatar 3
UY - Uruguay 3
AU - Australia 2
CZ - Repubblica Ceca 2
GY - Guiana 2
HR - Croazia 2
KG - Kirghizistan 2
LA - Repubblica Popolare Democratica del Laos 2
RS - Serbia 2
SI - Slovenia 2
SN - Senegal 2
TT - Trinidad e Tobago 2
TW - Taiwan 2
AF - Afghanistan, Repubblica islamica di 1
AM - Armenia 1
BB - Barbados 1
BG - Bulgaria 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BS - Bahamas 1
CY - Cipro 1
EE - Estonia 1
GT - Guatemala 1
IR - Iran 1
Totale 16.369
Città #
Dallas 831
Southend 681
Fairfield 618
Singapore 601
Ashburn 573
Woodbridge 540
Chandler 336
Wilmington 311
Houston 298
San Jose 293
Beijing 292
Seattle 261
Ann Arbor 256
Cambridge 217
Boardman 204
Hefei 188
Nanjing 176
Ho Chi Minh City 162
Rome 160
Dearborn 158
Dong Ket 136
Frankfurt am Main 130
Hong Kong 93
Hanoi 91
Shenyang 83
Princeton 82
Jacksonville 81
Dublin 77
Los Angeles 76
Jinan 72
Nanchang 72
Bremen 71
The Dalles 65
Moscow 60
Hebei 57
Munich 56
Helsinki 55
Changsha 52
Tianjin 51
Delhi 49
Shanghai 47
Plano 46
London 45
Jiaxing 44
São Paulo 41
Chicago 39
New York 39
Redwood City 39
Orem 36
Columbus 34
Zhengzhou 34
Ningbo 33
Seoul 32
Guangzhou 31
San Diego 26
Milan 25
Chennai 24
Kunming 24
Montreal 22
Santa Clara 22
Hangzhou 21
Brussels 20
Council Bluffs 19
Da Nang 19
Haiphong 19
Manchester 19
Warsaw 19
Atlanta 17
Haikou 17
Izmir 17
Phoenix 17
Baghdad 16
Denver 16
Taizhou 16
Turku 16
Amsterdam 15
Boston 15
Brooklyn 15
Johannesburg 15
Mumbai 15
Westminster 15
Ancona 14
Falkenstein 14
Pune 14
Shenzhen 14
Washington 14
Jakarta 13
Poplar 13
Tokyo 13
Altamura 12
Belo Horizonte 12
Düsseldorf 12
Rio de Janeiro 12
Salt Lake City 12
Stockholm 12
Lanzhou 11
Nuremberg 11
Quito 11
Tashkent 11
Mexico City 10
Totale 9.941
Nome #
On planar greedy drawings of 3-connected planar graphs 436
Intersection-Link Representations of Graphs 349
Windrose planarity: Embedding graphs with direction-constrained edges 316
Relaxing the constraints of clustered planarity 315
Anchored Drawings of Planar Graphs 305
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 304
Computing NodeTrix representations of clustered graphs 301
Morphing Planar Graph Drawings Optimally 299
How to Morph Planar Graph Drawings 299
Beyond level planarity 297
L-drawings of directed graphs 295
Strip Planarity Testing for Embedded Planar Graphs 275
On the Relationship between Map Graphs and Clique Planar Graphs 275
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 263
Algorithms and Bounds for L-Drawings of Directed Graphs 259
Visual discovery of the correlation between BGP routing and round-trip delay active measurements 258
Advancements on SEFE and Partitioned Book Embedding problems 258
Drawing Non-planar Graphs with Crossing-free Subgraphs 258
Drawing Planar Graphs with Many Collinear Vertices 246
On the Relationship Between k-Planar and k-Quasi-Planar Graphs 237
Simultaneous orthogonal planarity 227
Intersection-link representations of graphs 226
Clustered Planarity with Pipes 226
Strip Planarity Testing 223
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 223
Clustered Planarity with Pipes 218
Windrose planarity: Embedding graphs with direction-constrained edges 217
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 211
Drawing Graphs on a Smartphone 207
Drawing Graphs on a Smartphone 205
Optimal Morphs of Convex Drawings 203
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 202
3-coloring arrangements of line segments with 4 slopes is hard 198
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 184
On Some NP-complete SEFE Problems 183
Computing NodeTrix Representations of Clustered Graphs 183
Planar L-Drawings of directed graphs 179
Planarity of streamed graphs 168
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 167
Subexponential-time and FPT algorithms for embedded flat clustered planarity 166
Analogies between the Crossing Number and the Tangle Crossing Number 162
Reaching 3-connectivity via edge-edge additions 158
How to morph a tree on a small grid 158
Computing k-modal embeddings of planar digraphs 155
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth 154
Approximation algorithms for facial cycles in planar embeddings 153
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width 153
Extending Upward Planar Graph Drawings 152
Planar Embeddings with Small and Uniform Faces 149
Graph Product Structure for $h$-Framed Graphs 147
Planar L-Drawings of Directed Graphs 144
C-planarity testing of embedded clustered graphs with bounded dual carving-width 142
Quantum algorithms for one-sided crossing minimization 138
Drawing Planar Graphs with Many Collinear Vertices 138
Beyond Clustered Planar Graphs 138
On Planar Greedy Drawings of 3-Connected Planar Graphs 135
Upward planar morphs 132
Morphing contact representations of graphs 128
Simple k-planar graphs are simple (k + 1)-quasiplanar 128
On Upward-Planar L-Drawings of Graphs 127
Book embeddings of nonplanar graphs with small faces in few pages 126
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth 125
Quantum Graph Drawing 125
Upward Pointset Embeddings of Planar st-Graphs 124
Morphing Triangle Contact Representations of Triangulations 124
Graph Stories in Small Area 124
How to Morph a Tree on a Small Grid 122
Graph Stories in Small Area 118
Upward book embeddings of st-Graphs 117
Planarity of streamed graphs 116
Book embeddings of k-framed graphs and k-map graphs 111
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs 111
SEFE = C-planarity? 109
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths 104
Upward Pointset Embeddings of Planar st-Graphs 103
Upward Planar Morphs 102
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs 101
Recognizing Map Graphs of Bounded Treewidth 97
Upward Book Embeddability of st-Graphs: Complexity and Algorithms 93
Graph Product Structure for h-Framed Graphs 83
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 83
Unit-length Rectangular Drawings of Graphs 81
Extending upward planar graph drawings 81
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 80
Simple Realizability of Abstract Topological Graphs 77
On the upward book thickness problem: Combinatorial and complexity results 77
Planar L-Drawings of Bimodal Graphs 77
The Price of Upwardness 77
On the Upward Book Thickness Problem: Combinatorial and Complexity Results 75
Quantum Algorithms for One-Sided Crossing Minimization 73
Unit-length Rectangular Drawings of Graphs 70
The Price of Upwardness 69
Weakly Leveled Planarity with Bounded Span 68
On Upward-Planar L-Drawings of Graphs 68
Recognizing Map Graphs of Bounded Treewidth 68
Planar L-Drawings of Bimodal Graphs 65
The Parametrized Complexity of the Segment Number 65
Recognizing DAGs with page-number 2 is NP-complete 65
Quantum Graph Drawing [Best Student Paper] 65
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths 57
Totale 16.428
Categoria #
all - tutte 54.177
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 54.177


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021369 0 0 0 0 0 0 0 0 0 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/20265.448 400 1.270 430 676 534 359 639 87 392 661 0 0
Totale 16.749