DA LOZZO, GIORDANO
 Distribuzione geografica
Continente #
NA - Nord America 6.903
EU - Europa 4.672
AS - Asia 4.532
SA - Sud America 577
AF - Africa 137
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 4
Totale 16.833
Nazione #
US - Stati Uniti d'America 6.776
CN - Cina 1.951
RU - Federazione Russa 1.369
SG - Singapore 1.344
GB - Regno Unito 813
DE - Germania 598
VN - Vietnam 554
DK - Danimarca 548
BR - Brasile 437
IT - Italia 410
SE - Svezia 341
IN - India 137
BD - Bangladesh 118
FI - Finlandia 102
HK - Hong Kong 102
UA - Ucraina 88
IE - Irlanda 79
FR - Francia 73
CA - Canada 63
NL - Olanda 63
CI - Costa d'Avorio 56
AR - Argentina 52
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
NP - Nepal 8
PY - Paraguay 8
TH - Thailandia 8
AZ - Azerbaigian 7
CR - Costa Rica 6
JM - Giamaica 6
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
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
CY - Cipro 1
EE - Estonia 1
IR - Iran 1
Totale 16.819
Città #
Dallas 836
Southend 681
Fairfield 618
Ashburn 604
Singapore 602
Woodbridge 541
San Jose 407
Chandler 336
Wilmington 311
Houston 298
Beijing 294
Seattle 261
Ann Arbor 256
Cambridge 217
Boardman 204
Hefei 188
Nanjing 176
Rome 168
Ho Chi Minh City 162
Dearborn 158
Dong Ket 136
Frankfurt am Main 130
Hong Kong 93
Hanoi 91
Shenyang 83
Princeton 82
Jacksonville 81
Los Angeles 80
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
Shanghai 47
Plano 46
Chicago 45
London 45
New York 45
Jiaxing 44
São Paulo 41
Redwood City 39
Orem 37
Columbus 35
Zhengzhou 34
Ningbo 33
Seoul 32
Guangzhou 31
Santa Clara 28
Milan 27
San Diego 26
Atlanta 25
Council Bluffs 25
Chennai 24
Kunming 24
Montreal 23
Hangzhou 21
Brussels 20
Da Nang 19
Haiphong 19
Manchester 19
Warsaw 19
Brooklyn 17
Haikou 17
Izmir 17
Phoenix 17
Baghdad 16
Denver 16
Mumbai 16
Taizhou 16
Turku 16
Amsterdam 15
Boston 15
Johannesburg 15
Washington 15
Westminster 15
Ancona 14
Falkenstein 14
Pune 14
Shenzhen 14
Jakarta 13
Naples 13
Poplar 13
Salt Lake City 13
Tokyo 13
Altamura 12
Belo Horizonte 12
Düsseldorf 12
Rio de Janeiro 12
Stockholm 12
Lanzhou 11
Nuremberg 11
Quito 11
Tashkent 11
Totale 10.152
Nome #
On planar greedy drawings of 3-connected planar graphs 442
Intersection-Link Representations of Graphs 355
Relaxing the constraints of clustered planarity 326
Windrose planarity: Embedding graphs with direction-constrained edges 322
Anchored Drawings of Planar Graphs 307
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 306
Computing NodeTrix representations of clustered graphs 304
Morphing Planar Graph Drawings Optimally 302
Beyond level planarity 302
How to Morph Planar Graph Drawings 301
L-drawings of directed graphs 295
Strip Planarity Testing for Embedded Planar Graphs 280
On the Relationship between Map Graphs and Clique Planar Graphs 278
Visual discovery of the correlation between BGP routing and round-trip delay active measurements 263
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 263
Advancements on SEFE and Partitioned Book Embedding problems 261
Algorithms and Bounds for L-Drawings of Directed Graphs 261
Drawing Non-planar Graphs with Crossing-free Subgraphs 259
Drawing Planar Graphs with Many Collinear Vertices 252
On the Relationship Between k-Planar and k-Quasi-Planar Graphs 242
Simultaneous orthogonal planarity 233
Intersection-link representations of graphs 231
Clustered Planarity with Pipes 227
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 227
Strip Planarity Testing 224
Windrose planarity: Embedding graphs with direction-constrained edges 219
Clustered Planarity with Pipes 219
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 213
Drawing Graphs on a Smartphone 212
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 207
Optimal Morphs of Convex Drawings 207
Drawing Graphs on a Smartphone 206
Upward Pointset Embeddings of Planar st-Graphs 200
3-coloring arrangements of line segments with 4 slopes is hard 199
Computing NodeTrix Representations of Clustered Graphs 189
On Some NP-complete SEFE Problems 188
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 187
Planarity of streamed graphs 184
Planar L-Drawings of directed graphs 181
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 175
Subexponential-time and FPT algorithms for embedded flat clustered planarity 166
Analogies between the Crossing Number and the Tangle Crossing Number 164
How to morph a tree on a small grid 160
Computing k-modal embeddings of planar digraphs 160
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width 160
Reaching 3-connectivity via edge-edge additions 159
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth 156
Extending Upward Planar Graph Drawings 155
Approximation algorithms for facial cycles in planar embeddings 154
Planar Embeddings with Small and Uniform Faces 149
Graph Product Structure for $h$-Framed Graphs 148
Planar L-Drawings of Directed Graphs 145
Quantum Graph Drawing 145
Drawing Planar Graphs with Many Collinear Vertices 142
C-planarity testing of embedded clustered graphs with bounded dual carving-width 142
On Planar Greedy Drawings of 3-Connected Planar Graphs 140
Beyond Clustered Planar Graphs 140
Quantum algorithms for one-sided crossing minimization 138
Upward planar morphs 136
Simple k-planar graphs are simple (k + 1)-quasiplanar 129
On Upward-Planar L-Drawings of Graphs 128
Morphing contact representations of graphs 128
Graph Stories in Small Area 128
Book embeddings of k-framed graphs and k-map 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
Morphing Triangle Contact Representations of Triangulations 125
How to Morph a Tree on a Small Grid 125
Graph Stories in Small Area 121
Upward book embeddings of st-Graphs 118
Planarity of streamed graphs 118
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs 111
SEFE = C-planarity? 111
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths 110
Upward Pointset Embeddings of Planar st-Graphs 108
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs 107
Upward Planar Morphs 105
Upward Book Embeddability of st-Graphs: Complexity and Algorithms 101
Recognizing Map Graphs of Bounded Treewidth 101
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 87
Extending upward planar graph drawings 87
Unit-length Rectangular Drawings of Graphs 85
Graph Product Structure for h-Framed Graphs 84
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 84
The Price of Upwardness 83
Simple Realizability of Abstract Topological Graphs 80
On the upward book thickness problem: Combinatorial and complexity results 80
On Upward-Planar L-Drawings of Graphs 79
Planar L-Drawings of Bimodal Graphs 79
Quantum Algorithms for One-Sided Crossing Minimization 77
On the Upward Book Thickness Problem: Combinatorial and Complexity Results 76
Weakly Leveled Planarity with Bounded Span 72
Unit-length Rectangular Drawings of Graphs 72
The Price of Upwardness 70
Recognizing Map Graphs of Bounded Treewidth 69
The Parametrized Complexity of the Segment Number 68
Quantum Graph Drawing [Best Student Paper] 68
Planar L-Drawings of Bimodal Graphs 67
Recognizing DAGs with page-number 2 is NP-complete 67
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths 63
Totale 16.857
Categoria #
all - tutte 57.031
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.031


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021191 0 0 0 0 0 0 0 0 0 0 0 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.899 400 1.270 430 676 534 359 639 87 392 741 265 106
Totale 17.200