BINUCCI, Carla
 Distribuzione geografica
Continente #
NA - Nord America 901
EU - Europa 737
AS - Asia 517
Continente sconosciuto - Info sul continente non disponibili 2
OC - Oceania 1
SA - Sud America 1
Totale 2.159
Nazione #
US - Stati Uniti d'America 891
VN - Vietnam 324
IE - Irlanda 185
IT - Italia 165
UA - Ucraina 116
HK - Hong Kong 88
SE - Svezia 76
FI - Finlandia 69
SG - Singapore 63
RU - Federazione Russa 29
DE - Germania 23
CN - Cina 22
GB - Regno Unito 19
PL - Polonia 11
FR - Francia 10
BE - Belgio 9
CA - Canada 9
JP - Giappone 7
CH - Svizzera 6
CZ - Repubblica Ceca 4
AT - Austria 3
NL - Olanda 3
RO - Romania 3
TR - Turchia 3
EU - Europa 2
GR - Grecia 2
KR - Corea 2
LB - Libano 2
MY - Malesia 2
SK - Slovacchia (Repubblica Slovacca) 2
UZ - Uzbekistan 2
BD - Bangladesh 1
CL - Cile 1
ES - Italia 1
IR - Iran 1
LT - Lituania 1
MX - Messico 1
NZ - Nuova Zelanda 1
Totale 2.159
Città #
Dong Ket 323
Chandler 188
Dublin 183
San Mateo 114
Hong Kong 88
Altamura 62
Jacksonville 61
Ann Arbor 60
Perugia 53
Medford 44
Princeton 43
Lawrence 41
Wilmington 39
Singapore 38
Andover 33
Helsinki 33
Des Moines 12
San Paolo di Civitate 12
Kraków 11
Los Angeles 11
New York 11
Saint Petersburg 10
Brussels 9
Guangzhou 8
Ottawa 7
Tokyo 7
Woodbridge 7
Beijing 6
Norwalk 6
Boardman 5
Bologna 5
Ashburn 4
Olomouc 4
Shanghai 4
Den Haag 3
Izmir 3
Nottingham 3
Bratislava 2
Cyberjaya 2
Duncan 2
Lappeenranta 2
Montreal 2
Moscow 2
Rome 2
San Diego 2
Seoul 2
Umbertide 2
Auburn Hills 1
Auckland 1
Billings 1
Buffalo 1
Changsha 1
Corciano 1
Deruta 1
Edinburgh 1
Fairfield 1
Halesowen 1
Hanoi 1
Hanover 1
Houston 1
Jinan 1
Kashan 1
Kiev 1
La Spezia 1
Ludwigshafen 1
Madrid 1
Martano 1
Milan 1
Narni 1
Redmond 1
Saint Paul 1
Stockholm 1
Tappahannock 1
Terni 1
Vancouver 1
Vilnius 1
Wuhan 1
Totale 1.601
Nome #
1-page and 2-page drawings with bounded number of crossings per edge 154
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge 146
10 Reasons to Get Interested in Graph Drawing 136
Un Ambiente Visuale di Apprendimento Personalizzato 103
Drawing Non-Planar Graphs with Crossing-Free Subgraphs 79
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs 73
Algorithms and characterizations for 2-layer fan-planarity: From caterpillar to stegosaurus 72
Drawing Trees in a Streaming Model 56
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs 56
Computing Labeled Orthogonal Drawings 54
Designing the Content Analyzer of a Travel Recommender System 53
Computing quasi-upward planar drawings of mixed graphs 52
Fan-planarity: Properties and complexity 51
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods. 47
Colored anchored visibility representations in 2D and 3D space 46
Experiments on Area Compaction Algorithms for Orthogonal Drawings 43
Fan-Planar Graphs: Combinatorial Properties and Complexity Results 43
Universal Point Subsets for Planar Graphs 42
2-layer fan-planarity: From caterpillar to stegosaurus 42
Fully Dynamic Semantic Word Clouds 42
Labeling Heuristics for Orthogonal Drawings 40
An experimental study of a 1-planarity testing and embedding algorithm 40
VisFLOWer: Visual analysis of touristic flows 39
Partial edge drawing: Homogeneity is more important than crossings and ink 39
A Software System for Computing Labeled Orthogonal Drawings of Graphs 38
Upward Planarity Testing of Embedded Mixed Graphs 38
TRART: A system to support territorial policies 38
Visibility representations of boxes in 2.5 dimensions 38
Visibility representations of boxes in 2.5 dimensions 38
Switch-Regular Upward Planar Embeddings of Trees 36
Drawing Trees in a Streaming Model 36
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs 35
Upward book embeddings of st-Graphs 35
Upward Straight-line Embeddings of Directed Graphs into Point Sets 34
On Directed Graphs with an Upward Straight-line Embedding into Every Point Set 34
Placing arrows in directed graph drawings 33
Homotetic Triangle Contact Representations of Planar Graphs 32
MIUR PRIN Project ARCADIA 2007Automatic Real-time Clock Anomaly Detection and Identification Algorithmshttp://arcadia.diei.unipg.it 31
Upward and quasi-upward planarity testing of embedded mixed graphs. 30
Switch-Regular Upward Planar Embeddings of Directed Trees 26
On Turn-Regular Orthogonal Representations 25
1-planarity testing and embedding: An experimental study 23
Quasi-upward Planar Drawings with Minimum Curve Complexity 23
Orthogonal Drawings of Graphs with Vertex and Edge Labels 20
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments 20
On Turn-Regular Orthogonal Representations 15
Nonplanar Graph Drawings with k Vertices per Face 10
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges 10
st-Orientations with Few Transitive Edges 9
st-Orientations with Few Transitive Edges 8
On the Complexity of the Storyplan Problem 7
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper) 7
On the complexity of the storyplan problem 6
K-Planar Placement and Packing of \Delta-Regular Caterpillars 6
Upward Book Embeddability of st-Graphs: Complexity and Algorithms 5
Evaluating Animation Parameters for Morphing Edge Drawings 5
Min-k-planar Drawings of Graphs 4
Totale 2.303
Categoria #
all - tutte 9.081
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 9.081


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020131 2 3 15 1 17 0 15 7 37 11 10 13
2020/2021557 6 18 5 18 96 9 21 2 27 8 20 327
2021/2022398 5 68 4 20 14 2 7 127 19 26 50 56
2022/2023681 50 162 13 43 39 71 0 27 242 0 21 13
2023/2024302 12 33 6 25 2 12 39 7 73 18 35 40
Totale 2.303