DA LOZZO, GIORDANO
 Distribuzione geografica
Continente #
NA - Nord America 4.423
EU - Europa 2.781
AS - Asia 1.529
AF - Africa 56
OC - Oceania 7
Continente sconosciuto - Info sul continente non disponibili 3
SA - Sud America 3
Totale 8.802
Nazione #
US - Stati Uniti d'America 4.407
CN - Cina 1.173
GB - Regno Unito 760
DK - Danimarca 546
DE - Germania 393
SE - Svezia 329
IT - Italia 198
RU - Federazione Russa 139
SG - Singapore 139
VN - Vietnam 138
UA - Ucraina 78
FI - Finlandia 76
IE - Irlanda 74
CI - Costa d'Avorio 54
FR - Francia 53
AL - Albania 36
NL - Olanda 32
BE - Belgio 20
HK - Hong Kong 18
TR - Turchia 17
GR - Grecia 15
IN - India 15
CA - Canada 14
ID - Indonesia 14
AT - Austria 6
LT - Lituania 5
NZ - Nuova Zelanda 5
PK - Pakistan 5
PL - Polonia 4
BY - Bielorussia 3
EU - Europa 3
JP - Giappone 3
NO - Norvegia 3
RO - Romania 3
AU - Australia 2
CH - Svizzera 2
IL - Israele 2
CL - Cile 1
CZ - Repubblica Ceca 1
DZ - Algeria 1
EE - Estonia 1
HR - Croazia 1
HU - Ungheria 1
IS - Islanda 1
JM - Giamaica 1
JO - Giordania 1
LB - Libano 1
LU - Lussemburgo 1
MA - Marocco 1
MX - Messico 1
PE - Perù 1
PH - Filippine 1
PY - Paraguay 1
QA - Qatar 1
SA - Arabia Saudita 1
Totale 8.802
Città #
Southend 681
Fairfield 618
Woodbridge 540
Chandler 336
Ashburn 325
Wilmington 310
Houston 293
Ann Arbor 256
Seattle 255
Cambridge 217
Boardman 204
Nanjing 176
Dearborn 158
Dong Ket 136
Beijing 133
Singapore 107
Rome 95
Princeton 82
Shenyang 82
Jacksonville 81
Dublin 73
Jinan 72
Nanchang 72
Bremen 71
Hebei 57
Tianjin 48
Helsinki 46
Changsha 45
Plano 45
Jiaxing 44
Shanghai 41
Redwood City 39
Ningbo 33
London 32
Zhengzhou 30
Moscow 26
San Diego 25
Guangzhou 24
Kunming 23
Hangzhou 21
Brussels 20
Chicago 18
Hong Kong 18
Haikou 17
Izmir 17
Taizhou 16
Westminster 15
Pune 14
Altamura 12
Düsseldorf 12
Washington 12
Lanzhou 11
Shenzhen 11
Dallas 10
Jakarta 10
Montreal 10
Tappahannock 10
Frankfurt am Main 9
Hefei 9
Lawrence 9
Milan 9
Munich 9
Orange 9
Taiyuan 9
Bari 8
Renton 8
Atlanta 7
Fuzhou 7
Kilburn 7
Amsterdam 6
Berlin 6
North Bergen 6
Phoenix 6
Redmond 6
Venezia 6
Auckland 5
Changchun 5
Chiswick 5
Fort Worth 5
Fremont 5
Grafing 5
Multan 5
Norwalk 5
Wuhan 5
Bologna 4
Falls Church 4
Florence 4
Lappeenranta 4
Los Angeles 4
Malang 4
Palaiseau 4
Santa Clara 4
Bergen 3
Flushing 3
Indiana 3
Las Vegas 3
New York 3
Prescot 3
Toronto 3
Utrecht 3
Totale 6.422
Nome #
On planar greedy drawings of 3-connected planar graphs 307
Intersection-Link Representations of Graphs 278
Computing NodeTrix representations of clustered graphs 254
Morphing Planar Graph Drawings Optimally 227
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 215
Relaxing the constraints of clustered planarity 213
Anchored Drawings of Planar Graphs 211
L-drawings of directed graphs 209
How to Morph Planar Graph Drawings 207
Windrose planarity: Embedding graphs with direction-constrained edges 201
Beyond level planarity 199
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 196
Strip Planarity Testing for Embedded Planar Graphs 195
Visual discovery of the correlation between BGP routing and round-trip delay active measurements 193
On the Relationship between Map Graphs and Clique Planar Graphs 191
Strip Planarity Testing 188
Drawing Non-planar Graphs with Crossing-free Subgraphs 187
Drawing Planar Graphs with Many Collinear Vertices 173
Advancements on SEFE and Partitioned Book Embedding problems 171
Drawing Graphs on a Smartphone 171
Intersection-link representations of graphs 167
Simultaneous orthogonal planarity 166
Algorithms and Bounds for L-Drawings of Directed Graphs 165
Optimal Morphs of Convex Drawings 162
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 160
On the Relationship Between k-Planar and k-Quasi-Planar Graphs 158
Drawing Graphs on a Smartphone 156
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 143
Computing NodeTrix Representations of Clustered Graphs 139
On Some NP-complete SEFE Problems 137
Windrose planarity: Embedding graphs with direction-constrained edges 137
Clustered Planarity with Pipes 136
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 129
Clustered Planarity with Pipes 124
Planarity of streamed graphs 123
3-coloring arrangements of line segments with 4 slopes is hard 121
Planar L-Drawings of directed graphs 119
Reaching 3-connectivity via edge-edge additions 118
Planar Embeddings with Small and Uniform Faces 115
Subexponential-time and FPT algorithms for embedded flat clustered planarity 107
Extending Upward Planar Graph Drawings 107
How to morph a tree on a small grid 88
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 87
Analogies between the Crossing Number and the Tangle Crossing Number 86
Drawing Planar Graphs with Many Collinear Vertices 83
Approximation algorithms for facial cycles in planar embeddings 81
Upward planar morphs 77
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs 73
Graph Stories in Small Area 69
Beyond Clustered Planar Graphs 69
SEFE = C-planarity? 67
Simple k-planar graphs are simple (k + 1)-quasiplanar 66
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth 65
On Planar Greedy Drawings of 3-Connected Planar Graphs 64
Planarity of streamed graphs 62
Upward book embeddings of st-Graphs 61
Computing k-modal embeddings of planar digraphs 59
Morphing contact representations of graphs 56
Graph Stories in Small Area 56
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width 54
C-planarity testing of embedded clustered graphs with bounded dual carving-width 51
Book embeddings of nonplanar graphs with small faces in few pages 48
How to Morph a Tree on a Small Grid 44
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 43
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths 43
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs 41
Upward Planar Morphs 40
Extending upward planar graph drawings 33
Planar L-Drawings of Bimodal Graphs 32
On the Upward Book Thickness Problem: Combinatorial and Complexity Results 30
Morphing Triangle Contact Representations of Triangulations 27
Recognizing Map Graphs of Bounded Treewidth 24
Unit-length Rectangular Drawings of Graphs 19
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth 17
Graph Product Structure for h-Framed Graphs 14
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths 14
Book embeddings of k-framed graphs and k-map graphs 13
On Upward-Planar L-Drawings of Graphs 13
Recognizing Map Graphs of Bounded Treewidth 12
Special Issue on Parameterized and Approximation Algorithms in Graph Drawing Guest Editors’ Foreword 11
Planar L-Drawings of Bimodal Graphs 11
On the upward book thickness problem: Combinatorial and complexity results 11
Recognizing DAGs with page-number 2 is NP-complete 11
Upward Book Embeddability of st-Graphs: Complexity and Algorithms 10
null 10
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 8
Exact Algorithms for Clustered Planarity with Linear Saturators 8
Weakly Leveled Planarity with Bounded Span 8
Recognizing DAGs with Page-Number 2 Is NP-complete 8
The Price of Upwardness 8
Upward Pointset Embeddings of Planar st-Graphs 7
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs 7
The Parametrized Complexity of the Segment Number 7
Quantum Algorithms for One-Sided Crossing Minimization 7
Quantum Graph Drawing [Best Student Paper] 7
Simple Realizability of Abstract Topological Graphs 4
Unit-length Rectangular Drawings of Graphs 4
Graph Product Structure for h-Framed Graphs 1
Totale 9.104
Categoria #
all - tutte 33.738
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 33.738


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.218 0 0 0 0 0 201 278 250 266 130 48 45
2020/20211.157 39 82 60 55 57 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/2025561 15 55 253 67 54 117 0 0 0 0 0 0
Totale 9.104