DA LOZZO, GIORDANO
 Distribuzione geografica
Continente #
NA - Nord America 7.123
EU - Europa 4.706
AS - Asia 4.567
SA - Sud America 583
Continente sconosciuto - Info sul continente non disponibili 372
AF - Africa 137
OC - Oceania 8
Totale 17.496
Nazione #
US - Stati Uniti d'America 6.983
CN - Cina 1.954
RU - Federazione Russa 1.370
SG - Singapore 1.353
GB - Regno Unito 813
DE - Germania 598
VN - Vietnam 555
DK - Danimarca 548
BR - Brasile 441
IT - Italia 438
SE - Svezia 341
BD - Bangladesh 138
IN - India 137
HK - Hong Kong 104
FI - Finlandia 102
UA - Ucraina 90
IE - Irlanda 79
FR - Francia 73
CA - Canada 69
NL - Olanda 63
CI - Costa d'Avorio 56
AR - Argentina 53
AL - Albania 41
TR - Turchia 39
ID - Indonesia 37
KR - Corea 36
MX - Messico 35
PK - Pakistan 32
IQ - Iraq 31
ZA - Sudafrica 28
AT - Austria 22
EC - Ecuador 22
PL - Polonia 22
BE - Belgio 20
ES - Italia 20
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
JM - Giamaica 10
JO - Giordania 10
KE - Kenya 10
SA - Arabia Saudita 10
TN - Tunisia 10
CL - Cile 9
NP - Nepal 8
PY - Paraguay 8
TH - Thailandia 8
AZ - Azerbaigian 7
RO - Romania 7
CR - Costa Rica 6
LT - Lituania 6
NO - Norvegia 6
NZ - Nuova Zelanda 6
BO - Bolivia 5
DZ - Algeria 5
EG - Egitto 5
ET - Etiopia 5
IL - Israele 5
CH - Svizzera 4
DO - Repubblica Dominicana 4
KZ - Kazakistan 4
LB - Libano 4
PA - Panama 4
TT - Trinidad e Tobago 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
GT - Guatemala 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
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
BZ - Belize 1
CY - Cipro 1
EE - Estonia 1
Totale 17.112
Città #
Dallas 838
Southend 681
Ashburn 658
Fairfield 618
Singapore 603
Woodbridge 541
San Jose 444
Chandler 336
Wilmington 312
Houston 298
Beijing 295
Seattle 262
Ann Arbor 256
Cambridge 217
Boardman 204
Hefei 188
Nanjing 176
Rome 176
Ho Chi Minh City 163
Dearborn 158
Dong Ket 136
Frankfurt am Main 130
Hong Kong 94
Hanoi 91
Los Angeles 84
Shenyang 83
Princeton 82
Jacksonville 81
Dublin 77
Jinan 72
Nanchang 72
Bremen 71
The Dalles 65
Moscow 60
Hebei 57
Munich 56
Helsinki 55
Changsha 52
Tianjin 51
Delhi 49
New York 47
Shanghai 47
Plano 46
Chicago 45
London 45
São Paulo 45
Jiaxing 44
Redwood City 39
Orem 37
Columbus 35
Zhengzhou 34
Ningbo 33
Seoul 32
Guangzhou 31
Santa Clara 30
Milan 29
Atlanta 27
San Diego 26
Council Bluffs 25
Chennai 24
Kunming 24
Phoenix 24
Montreal 23
Hangzhou 21
Brussels 20
Da Nang 19
Haiphong 19
Manchester 19
Warsaw 19
Brooklyn 18
Haikou 17
Izmir 17
Baghdad 16
Denver 16
Mumbai 16
Salt Lake City 16
Taizhou 16
Turku 16
Amsterdam 15
Boston 15
Johannesburg 15
Washington 15
Westminster 15
Ancona 14
Falkenstein 14
Naples 14
Pune 14
Shenzhen 14
Buffalo 13
Jakarta 13
Poplar 13
Tokyo 13
Toronto 13
Altamura 12
Belo Horizonte 12
Düsseldorf 12
Rio de Janeiro 12
Stockholm 12
Bologna 11
Lanzhou 11
Totale 10.291
Nome #
On planar greedy drawings of 3-connected planar graphs 446
Intersection-Link Representations of Graphs 356
Relaxing the constraints of clustered planarity 340
Windrose planarity: Embedding graphs with direction-constrained edges 329
Anchored Drawings of Planar Graphs 311
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 310
Computing NodeTrix representations of clustered graphs 306
Morphing Planar Graph Drawings Optimally 303
How to Morph Planar Graph Drawings 303
Beyond level planarity 302
L-drawings of directed graphs 295
Strip Planarity Testing for Embedded Planar Graphs 287
On the Relationship between Map Graphs and Clique Planar Graphs 280
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 270
Visual discovery of the correlation between BGP routing and round-trip delay active measurements 264
Advancements on SEFE and Partitioned Book Embedding problems 264
Algorithms and Bounds for L-Drawings of Directed Graphs 262
Drawing Non-planar Graphs with Crossing-free Subgraphs 260
Drawing Planar Graphs with Many Collinear Vertices 253
Simultaneous orthogonal planarity 246
On the Relationship Between k-Planar and k-Quasi-Planar Graphs 246
Intersection-link representations of graphs 232
Clustered Planarity with Pipes 228
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 227
Strip Planarity Testing 225
Windrose planarity: Embedding graphs with direction-constrained edges 222
Clustered Planarity with Pipes 222
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 215
Drawing Graphs on a Smartphone 213
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 211
Drawing Graphs on a Smartphone 209
Optimal Morphs of Convex Drawings 207
Upward Pointset Embeddings of Planar st-Graphs 206
3-coloring arrangements of line segments with 4 slopes is hard 200
Planarity of streamed graphs 191
On Some NP-complete SEFE Problems 190
Computing NodeTrix Representations of Clustered Graphs 189
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 187
Planar L-Drawings of directed graphs 186
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 177
Subexponential-time and FPT algorithms for embedded flat clustered planarity 171
Analogies between the Crossing Number and the Tangle Crossing Number 168
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width 168
Computing k-modal embeddings of planar digraphs 163
How to morph a tree on a small grid 162
Reaching 3-connectivity via edge-edge additions 160
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth 157
Approximation algorithms for facial cycles in planar embeddings 156
Extending Upward Planar Graph Drawings 155
Graph Product Structure for $h$-Framed Graphs 154
Planar Embeddings with Small and Uniform Faces 151
Quantum Graph Drawing 148
Planar L-Drawings of Directed Graphs 146
Quantum algorithms for one-sided crossing minimization 146
C-planarity testing of embedded clustered graphs with bounded dual carving-width 144
Drawing Planar Graphs with Many Collinear Vertices 143
Beyond Clustered Planar Graphs 141
On Planar Greedy Drawings of 3-Connected Planar Graphs 140
Upward planar morphs 139
On Upward-Planar L-Drawings of Graphs 133
Book embeddings of k-framed graphs and k-map graphs 132
Morphing Triangle Contact Representations of Triangulations 130
Simple k-planar graphs are simple (k + 1)-quasiplanar 130
Morphing contact representations of graphs 129
Graph Stories in Small Area 128
Book embeddings of nonplanar graphs with small faces in few pages 127
How to Morph a Tree on a Small Grid 127
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth 126
Graph Stories in Small Area 123
Planarity of streamed graphs 123
Upward book embeddings of st-Graphs 118
Upward Pointset Embeddings of Planar st-Graphs 113
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs 113
SEFE = C-planarity? 113
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths 112
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs 111
Upward Planar Morphs 108
Recognizing Map Graphs of Bounded Treewidth 104
Upward Book Embeddability of st-Graphs: Complexity and Algorithms 103
Graph Product Structure for h-Framed Graphs 89
Extending upward planar graph drawings 88
Unit-length Rectangular Drawings of Graphs 87
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 87
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 87
The Price of Upwardness 86
Simple Realizability of Abstract Topological Graphs 83
On Upward-Planar L-Drawings of Graphs 82
On the upward book thickness problem: Combinatorial and complexity results 81
Planar L-Drawings of Bimodal Graphs 81
Quantum Algorithms for One-Sided Crossing Minimization 79
On the Upward Book Thickness Problem: Combinatorial and Complexity Results 77
Weakly Leveled Planarity with Bounded Span 75
The Price of Upwardness 74
Unit-length Rectangular Drawings of Graphs 74
The Parametrized Complexity of the Segment Number 70
Recognizing Map Graphs of Bounded Treewidth 70
Planar L-Drawings of Bimodal Graphs 69
Recognizing DAGs with page-number 2 is NP-complete 69
Quantum Graph Drawing [Best Student Paper] 69
Recognizing DAGs with Page-Number 2 Is NP-complete 67
Totale 17.129
Categoria #
all - tutte 59.761
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 59.761


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022696 0 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.923 400 1.270 430 676 534 359 639 87 392 741 265 130
2026/2027272 113 159 0 0 0 0 0 0 0 0 0 0
Totale 17.496