BINUCCI, Carla
 Distribuzione geografica
Continente #
NA - Nord America 1.392
AS - Asia 1.310
EU - Europa 1.019
SA - Sud America 263
AF - Africa 17
OC - Oceania 4
Continente sconosciuto - Info sul continente non disponibili 2
Totale 4.007
Nazione #
US - Stati Uniti d'America 1.342
SG - Singapore 464
VN - Vietnam 382
BR - Brasile 217
IE - Irlanda 185
IT - Italia 175
CN - Cina 159
HK - Hong Kong 148
RU - Federazione Russa 131
UA - Ucraina 119
FI - Finlandia 96
DE - Germania 91
SE - Svezia 79
KR - Corea 72
GB - Regno Unito 34
CA - Canada 33
FR - Francia 26
AR - Argentina 20
IN - India 18
PL - Polonia 18
BE - Belgio 12
MX - Messico 12
JP - Giappone 10
TR - Turchia 9
ZA - Sudafrica 9
ES - Italia 8
AT - Austria 7
CH - Svizzera 7
ID - Indonesia 7
NL - Olanda 7
BD - Bangladesh 6
PE - Perù 6
CO - Colombia 5
EC - Ecuador 5
IQ - Iraq 5
LT - Lituania 5
PK - Pakistan 5
CZ - Repubblica Ceca 4
IL - Israele 4
VE - Venezuela 4
CL - Cile 3
GR - Grecia 3
LB - Libano 3
MY - Malesia 3
PY - Paraguay 3
RO - Romania 3
AU - Australia 2
EU - Europa 2
GE - Georgia 2
IR - Iran 2
LV - Lettonia 2
MA - Marocco 2
OM - Oman 2
SA - Arabia Saudita 2
SK - Slovacchia (Repubblica Slovacca) 2
TN - Tunisia 2
TT - Trinidad e Tobago 2
UZ - Uzbekistan 2
AE - Emirati Arabi Uniti 1
AL - Albania 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
DZ - Algeria 1
GA - Gabon 1
GM - Gambi 1
JM - Giamaica 1
JO - Giordania 1
KE - Kenya 1
LC - Santa Lucia 1
MK - Macedonia 1
NZ - Nuova Zelanda 1
PA - Panama 1
PS - Palestinian Territory 1
PT - Portogallo 1
TJ - Tagikistan 1
TO - Tonga 1
Totale 4.007
Città #
Dong Ket 323
Singapore 311
Chandler 188
Dublin 183
Hong Kong 148
San Mateo 114
Boardman 81
Ashburn 73
Seoul 72
Santa Clara 67
Altamura 62
Jacksonville 62
Ann Arbor 60
Perugia 53
Moscow 48
Helsinki 46
Medford 44
Princeton 43
Lawrence 41
Wilmington 39
Munich 34
Andover 33
The Dalles 32
Beijing 31
Los Angeles 27
Piscataway 24
Ho Chi Minh City 22
New York 22
São Paulo 16
Turku 14
Frankfurt am Main 13
Brussels 12
Des Moines 12
Falkenstein 12
Hanoi 12
San Paolo di Civitate 12
Kraków 11
Dallas 10
Hefei 10
Ottawa 10
Saint Petersburg 10
Toronto 10
Guangzhou 9
Tokyo 9
Montreal 8
Rio de Janeiro 8
Shanghai 8
Woodbridge 7
Lima 6
Milan 6
Norwalk 6
Warsaw 6
Belo Horizonte 5
Bologna 5
Brooklyn 5
Chennai 5
Denver 5
Houston 5
Johannesburg 5
London 5
Nuremberg 5
Atlanta 4
Da Nang 4
Maceió 4
Olomouc 4
Poplar 4
Stockholm 4
Tel Aviv 4
Amsterdam 3
Asunción 3
Cachoeiro de Itapemirim 3
Den Haag 3
Fortaleza 3
Haiphong 3
Izmir 3
Lahore 3
Lomas de Zamora 3
Miami 3
Ninh Bình 3
Nottingham 3
Paulista 3
Phoenix 3
Porto Alegre 3
Salvador 3
San Francisco 3
Thái Bình 3
Vancouver 3
Vienna 3
Ankara 2
Apucarana 2
Arapiraca 2
Baghdad 2
Belém 2
Betim 2
Biên Hòa 2
Bogotá 2
Boston 2
Brasília 2
Bratislava 2
Buffalo 2
Totale 2.677
Nome #
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge 210
1-page and 2-page drawings with bounded number of crossings per edge 192
10 Reasons to Get Interested in Graph Drawing 167
Algorithms and characterizations for 2-layer fan-planarity: From caterpillar to stegosaurus 125
Un Ambiente Visuale di Apprendimento Personalizzato 120
Drawing Non-Planar Graphs with Crossing-Free Subgraphs 114
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs 104
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs 99
Designing the Content Analyzer of a Travel Recommender System 93
Computing quasi-upward planar drawings of mixed graphs 86
Computing Labeled Orthogonal Drawings 85
Fan-planarity: Properties and complexity 84
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods. 84
An experimental study of a 1-planarity testing and embedding algorithm 83
Drawing Trees in a Streaming Model 81
2-layer fan-planarity: From caterpillar to stegosaurus 80
Colored anchored visibility representations in 2D and 3D space 80
Drawing Trees in a Streaming Model 79
Experiments on Area Compaction Algorithms for Orthogonal Drawings 76
1-planarity testing and embedding: An experimental study 74
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs 72
Fan-Planar Graphs: Combinatorial Properties and Complexity Results 70
Partial edge drawing: Homogeneity is more important than crossings and ink 70
Upward book embeddings of st-Graphs 70
Visibility representations of boxes in 2.5 dimensions 68
A Software System for Computing Labeled Orthogonal Drawings of Graphs 67
Switch-Regular Upward Planar Embeddings of Trees 66
Upward and quasi-upward planarity testing of embedded mixed graphs. 66
Labeling Heuristics for Orthogonal Drawings 64
On Directed Graphs with an Upward Straight-line Embedding into Every Point Set 61
Universal Point Subsets for Planar Graphs 61
Fully Dynamic Semantic Word Clouds 60
VisFLOWer: Visual analysis of touristic flows 59
Visibility representations of boxes in 2.5 dimensions 59
Nonplanar Graph Drawings with k Vertices per Face 56
Upward Planarity Testing of Embedded Mixed Graphs 56
On Turn-Regular Orthogonal Representations 55
Min-k-planar Drawings of Graphs 55
Evaluating Animation Parameters for Morphing Edge Drawings 54
Placing arrows in directed graph drawings 54
TRART: A system to support territorial policies 53
Quasi-upward Planar Drawings with Minimum Curve Complexity 52
Homotetic Triangle Contact Representations of Planar Graphs 52
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments 52
Upward Straight-line Embeddings of Directed Graphs into Point Sets 51
MIUR PRIN Project ARCADIA 2007Automatic Real-time Clock Anomaly Detection and Identification Algorithmshttp://arcadia.diei.unipg.it 49
K-Planar Placement and Packing of \Delta-Regular Caterpillars 48
Switch-Regular Upward Planar Embeddings of Directed Trees 44
Orthogonal Drawings of Graphs with Vertex and Edge Labels 43
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper) 42
Min-k-planar Drawings of Graphs 41
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges 39
Graphs Drawn With Some Vertices per Face: Density and Relationships 38
On Turn-Regular Orthogonal Representations 36
st-Orientations with Few Transitive Edges 34
On the complexity of the storyplan problem 34
st-Orientations with Few Transitive Edges 33
On the Complexity of the Storyplan Problem 32
Upward Book Embeddability of st-Graphs: Complexity and Algorithms 31
Totale 4.163
Categoria #
all - tutte 18.802
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 18.802


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021414 0 0 0 0 0 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
2024/2025904 15 89 23 47 140 55 61 74 177 47 107 69
2025/2026956 129 141 109 281 249 47 0 0 0 0 0 0
Totale 4.163