Benvenuti nell'Anagrafe della Ricerca d'Ateneo

DA LOZZO, GIORDANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.202
EU - Europa 2.668
AS - Asia 1.363
AF - Africa 55
OC - Oceania 7
Continente sconosciuto - Info sul continente non disponibili 3
SA - Sud America 2
Totale 8.300
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.188
CN - Cina 1.102
GB - Regno Unito 754
DK - Danimarca 546
DE - Germania 376
SE - Svezia 329
IT - Italia 177
VN - Vietnam 137
RU - Federazione Russa 91
UA - Ucraina 78
SG - Singapore 75
IE - Irlanda 74
FI - Finlandia 71
CI - Costa d'Avorio 54
FR - Francia 50
AL - Albania 36
NL - Olanda 30
BE - Belgio 17
TR - Turchia 17
GR - Grecia 15
IN - India 15
CA - Canada 13
ID - Indonesia 6
AT - Austria 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
CZ - Repubblica Ceca 1
DZ - Algeria 1
EE - Estonia 1
HR - Croazia 1
HU - Ungheria 1
MX - Messico 1
PE - Perù 1
PY - Paraguay 1
QA - Qatar 1
Totale 8.300
Salva come PNG Salva come JPEG
Città #
Southend 681
Fairfield 618
Woodbridge 540
Chandler 336
Ashburn 324
Wilmington 310
Houston 293
Ann Arbor 256
Seattle 255
Cambridge 217
Nanjing 176
Dearborn 158
Dong Ket 136
Beijing 134
Princeton 82
Shenyang 82
Jacksonville 81
Rome 80
Dublin 73
Nanchang 72
Bremen 71
Jinan 71
Hebei 57
Singapore 49
Tianjin 48
Changsha 45
Plano 45
Jiaxing 44
Helsinki 41
Shanghai 40
Redwood City 39
Ningbo 33
Zhengzhou 30
London 28
Boardman 26
San Diego 25
Guangzhou 24
Kunming 22
Hangzhou 21
Chicago 18
Brussels 17
Haikou 17
Izmir 17
Taizhou 16
Westminster 15
Pune 14
Altamura 12
Düsseldorf 12
Dallas 11
Lanzhou 11
Montreal 10
Tappahannock 10
Washington 10
Hefei 9
Lawrence 9
Milan 9
Orange 9
Bari 8
Renton 8
Taiyuan 8
Atlanta 7
Fuzhou 7
Kilburn 7
Berlin 6
Phoenix 6
Redmond 6
Venezia 6
Amsterdam 5
Auckland 5
Changchun 5
Chiswick 5
Fort Worth 5
Fremont 5
Grafing 5
Multan 5
Norwalk 5
Bologna 4
Falls Church 4
Florence 4
Lappeenranta 4
Malang 4
Palaiseau 4
Wuhan 4
Bergen 3
Flushing 3
Frankfurt am Main 3
Indiana 3
Las Vegas 3
New York 3
Prescot 3
Santa Clara 3
Utrecht 3
Acton 2
Alameda 2
Bad Muenstereifel 2
Boydton 2
Chaoyang 2
Chengdu 2
Columbus 2
Edinburgh 2
Totale 6.074
Salva come PNG Salva come JPEG
Nome #
On planar greedy drawings of 3-connected planar graphs 299
Intersection-Link Representations of Graphs 272
Computing NodeTrix representations of clustered graphs 252
Morphing Planar Graph Drawings Optimally 222
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs 210
Relaxing the constraints of clustered planarity 207
Anchored Drawings of Planar Graphs 202
L-drawings of directed graphs 202
How to Morph Planar Graph Drawings 201
Beyond level planarity 193
Windrose planarity: Embedding graphs with direction-constrained edges 189
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data 188
On the Relationship between Map Graphs and Clique Planar Graphs 188
Visual discovery of the correlation between BGP routing and round-trip delay active measurements 187
Strip Planarity Testing 185
Strip Planarity Testing for Embedded Planar Graphs 184
Drawing Non-planar Graphs with Crossing-free Subgraphs 182
Drawing Planar Graphs with Many Collinear Vertices 167
Drawing Graphs on a Smartphone 166
Advancements on SEFE and Partitioned Book Embedding problems 163
Simultaneous orthogonal planarity 162
Intersection-link representations of graphs 161
Algorithms and Bounds for L-Drawings of Directed Graphs 159
Optimal Morphs of Convex Drawings 158
The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) 157
Drawing Graphs on a Smartphone 155
On the Relationship Between k-Planar and k-Quasi-Planar Graphs 151
The Importance of Being Proper: (In Clustered-Level Planarity and T-Level Planarity) 139
Computing NodeTrix Representations of Clustered Graphs 134
On Some NP-complete SEFE Problems 133
Windrose planarity: Embedding graphs with direction-constrained edges 132
Clustered Planarity with Pipes 130
Beyond level planarity: Cyclic, torus, and simultaneous level planarity 123
Clustered Planarity with Pipes 118
Planarity of streamed graphs 117
Planar L-Drawings of directed graphs 116
Reaching 3-connectivity via edge-edge additions 116
3-coloring arrangements of line segments with 4 slopes is hard 115
Planar Embeddings with Small and Uniform Faces 112
Extending Upward Planar Graph Drawings 105
Subexponential-time and FPT algorithms for embedded flat clustered planarity 104
Analogies between the Crossing Number and the Tangle Crossing Number 82
How to morph a tree on a small grid 82
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 78
Drawing Planar Graphs with Many Collinear Vertices 75
Approximation algorithms for facial cycles in planar embeddings 75
Upward planar morphs 74
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs 69
Graph Stories in Small Area 66
SEFE = C-planarity? 64
On Planar Greedy Drawings of 3-Connected Planar Graphs 62
Simple k-planar graphs are simple (k + 1)-quasiplanar 62
Beyond Clustered Planar Graphs 62
Planarity of streamed graphs 59
Upward book embeddings of st-Graphs 58
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth 56
Graph Stories in Small Area 51
Morphing contact representations of graphs 50
Computing k-modal embeddings of planar digraphs 50
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width 47
Book embeddings of nonplanar graphs with small faces in few pages 44
C-planarity testing of embedded clustered graphs with bounded dual carving-width 44
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 41
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs 39
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths 38
How to Morph a Tree on a Small Grid 37
Upward Planar Morphs 35
Extending upward planar graph drawings 29
Planar L-Drawings of Bimodal Graphs 29
On the Upward Book Thickness Problem: Combinatorial and Complexity Results 27
Recognizing Map Graphs of Bounded Treewidth 20
Morphing Triangle Contact Representations of Triangulations 18
Unit-length Rectangular Drawings of Graphs 12
On Upward-Planar L-Drawings of Graphs 10
Graph Product Structure for h-Framed Graphs 9
Recognizing DAGs with page-number 2 is NP-complete 9
Book embeddings of k-framed graphs and k-map graphs 8
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth 8
Planar L-Drawings of Bimodal Graphs 8
Special Issue on Parameterized and Approximation Algorithms in Graph Drawing Guest Editors’ Foreword 7
On the upward book thickness problem: Combinatorial and complexity results 7
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths 7
null 6
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees 5
Upward Book Embeddability of st-Graphs: Complexity and Algorithms 5
Recognizing DAGs with Page-Number 2 Is NP-complete 5
Recognizing Map Graphs of Bounded Treewidth 5
Graph Product Structure for h-Framed Graphs 2
Totale 8.592
Salva come PNG Salva come JPEG
Categoria #
all - tutte 29.499
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 29.499
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.795 0 151 99 163 164 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/2024634 31 30 75 25 70 93 62 87 2 16 54 89
2024/202548 15 33 0 0 0 0 0 0 0 0 0 0
Totale 8.592