FERREIRA DA SILVA, ANA SHIRLEY
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 2.920
NA - Nord America 2.906
EU - Europa 1.358
SA - Sud America 486
Continente sconosciuto - Info sul continente non disponibili 75
AF - Africa 63
OC - Oceania 51
Totale 7.859
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.828
CN - Cina 1.016
SG - Singapore 815
RU - Federazione Russa 813
BR - Brasile 383
KR - Corea 355
IT - Italia 316
HK - Hong Kong 284
VN - Vietnam 213
IN - India 77
FR - Francia 69
AU - Australia 51
AR - Argentina 44
CA - Canada 42
BD - Bangladesh 32
FI - Finlandia 32
ID - Indonesia 27
JP - Giappone 26
IE - Irlanda 25
GB - Regno Unito 24
DE - Germania 17
MX - Messico 16
EC - Ecuador 15
NG - Nigeria 14
SE - Svezia 14
BJ - Benin 13
IQ - Iraq 12
ZA - Sudafrica 12
CO - Colombia 11
PY - Paraguay 11
CI - Costa d'Avorio 10
NL - Olanda 10
ES - Italia 9
VE - Venezuela 9
JO - Giordania 8
TR - Turchia 7
CH - Svizzera 6
CL - Cile 6
TH - Thailandia 6
AT - Austria 5
MA - Marocco 5
PE - Perù 5
GT - Guatemala 4
JM - Giamaica 4
MY - Malesia 4
PH - Filippine 4
PL - Polonia 4
SA - Arabia Saudita 4
UA - Ucraina 4
CR - Costa Rica 3
KE - Kenya 3
KH - Cambogia 3
KZ - Kazakistan 3
LB - Libano 3
OM - Oman 3
PK - Pakistan 3
UZ - Uzbekistan 3
AM - Armenia 2
AZ - Azerbaigian 2
BS - Bahamas 2
BY - Bielorussia 2
DO - Repubblica Dominicana 2
DZ - Algeria 2
EG - Egitto 2
HN - Honduras 2
MM - Myanmar 2
NP - Nepal 2
PS - Palestinian Territory 2
BE - Belgio 1
BO - Bolivia 1
BW - Botswana 1
CZ - Repubblica Ceca 1
DM - Dominica 1
HR - Croazia 1
HU - Ungheria 1
IL - Israele 1
IM - Isola di Man 1
LK - Sri Lanka 1
LT - Lituania 1
LU - Lussemburgo 1
LV - Lettonia 1
PR - Porto Rico 1
SV - El Salvador 1
TN - Tunisia 1
UY - Uruguay 1
Totale 7.784
Salva come PNG Salva come JPEG
Città #
Santa Clara 1.716
Singapore 645
Hefei 528
Seoul 354
San Jose 260
Hong Kong 229
Ashburn 165
Milan 92
Ho Chi Minh City 80
Moscow 62
The Dalles 55
Lauterbourg 54
Melbourne 50
Hanoi 46
Buffalo 45
Kent 44
Rome 42
Los Angeles 40
Bengaluru 39
Dallas 36
Beijing 34
São Paulo 29
Helsinki 27
Tokyo 26
Mumbai 25
Dublin 23
New York 18
Florence 15
Rio de Janeiro 15
Abuja 14
Haiphong 14
Cotonou 13
West Jordan 12
Council Bluffs 11
Jakarta 11
Abidjan 10
Guangzhou 10
Miano 10
Boardman 9
Fairfield 9
Naples 9
Altamura 8
Biên Hòa 8
Lawrence 8
Phoenix 8
Brasília 7
Cape Town 7
Porto Alegre 7
Romola 7
Baghdad 6
Bangkok 6
Buenos Aires 6
Chandler 6
Chennai 6
Curitiba 6
Da Nang 6
Guayaquil 6
Montreal 6
Nuremberg 6
Santo André 6
Seattle 6
Yubileyny 6
Amsterdam 5
Boston 5
Brooklyn 5
Bắc Ninh 5
Huế 5
Johannesburg 5
Lappeenranta 5
Manchester 5
Piracicaba 5
Sorocaba 5
Thái Bình 5
Toronto 5
Asunción 4
Belo Horizonte 4
Bologna 4
Campinas 4
Can Tho 4
Chicago 4
Falkenstein 4
Glasgow 4
Houston 4
Hải Dương 4
Monza 4
Natal 4
Orem 4
Osasco 4
Ourinhos 4
Princeton 4
Salvador 4
San Juan 4
Santiago 4
Turin 4
Verona 4
Warsaw 4
Wilmington 4
Woodbridge 4
Amman 3
Arequipa 3
Totale 5.226
Salva come PNG Salva come JPEG
Nome #
On Computing Optimal Temporal Branchings 179
On Computing Optimal Temporal Branchings and Spanning Subgraphs 171
On Computing Large Temporal (Unilateral) Connected Components 166
b-Coloring graphs with large girth 163
Coloring temporal graphs 160
b-chromatic number of cacti 156
2K2-partition of some classes of graphs 156
b-chromatic index of graphs 156
Proper orientation of cacti 155
Backbone colouring: Tree backbones with small diameter in planar graphs 154
Backbone coloring of graphs with galaxy backbones 152
A bound on the treewidth of planar even-hole-free graphs 152
b-continuity and partial Grundy coloring of graphs with large girth 149
On computing large temporal (unilateral) connected components 148
b-colouring outerplanar graphs with large girth 147
Acyclic coloring of products of digraphs 142
On the hull number on cycle convexity of graphs 139
Edge-Disjoint Branchings in Temporal Graphs 138
B-Coloring Graphs with Girth at Least 8 138
Connected Greedy Colourings 136
Dual parameterization of weighted coloring 136
b-colouring the Cartesian product of trees and some other graphs 132
Eulerian Walks in Temporal Graphs 131
A unifying model for locally constrained spanning tree problems 130
Complexity of determining the maximum infection time in the geodetic convexity 129
Coloring Problems on Bipartite Graphs of Small Diameter 128
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional 127
Backbone Coloring of Graphs with Galaxy Backbones 127
Revising Johnson's Table for the 21st century 126
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete 126
Circular backbone colorings: On matching and tree backbones of planar graphs 121
Fixed-parameter algorithms for the cocoloring problem 120
Graphs of girth at least 7 have high b-chromatic number 117
On the proper orientation number of chordal graphs 117
Graphs with large girth are b-continuous 117
Weighted proper orientations of trees and graphs of bounded treewidth 116
The sociotechnical teams formation problem: a mathematical optimization approach 116
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete 116
Graphs with few P4's under the convexity of paths of order three 116
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs 116
Edge-disjoint branchings in temporal digraphs 116
The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects 115
On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring 114
Dual Parameterization of Weighted Coloring 112
Mengerian graphs: Characterization and recognition 111
The maximum infection time in the geodesic and monophonic convexities 110
Connected greedy coloring of H-free graphs 110
Graphs with Girth at Least 8 are b-continuous 109
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects 108
The b-Continuity of Graphs with Large Girth 106
The lexicographic product of some chordal graphs and of cographs preserves b-continuity 104
On Finding the Best and Worst Orientations for the Metric Dimension 104
Mengerian Graphs Revisited 100
Even-hole-free planar graphs have bounded treewidth 99
On computing large temporal (unilateral) connected components 97
On the complexity of finding internally vertex-disjoint long directed paths 95
The b-chromatic index of graphs 94
Edge-b-Coloring Trees 94
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths 94
MaxC ut on permutation graphs is NP-complete 93
On the b-Continuity of the Lexicographic Product of Graphs 90
Graphs with small fall-spectrum 84
Two Fixed-Parameter Algorithms for the Cocoloring Problem 79
Totale 7.859
Salva come PNG Salva come JPEG
Categoria #
all - tutte 19.713
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 19.713
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/202232 0 0 0 14 2 0 0 3 2 0 3 8
2022/202371 6 19 3 2 2 12 12 3 9 0 0 3
2023/2024213 0 1 4 9 48 7 2 12 51 58 12 9
2024/20253.486 74 274 141 322 1.040 971 33 114 60 54 154 249
2025/20263.935 362 708 807 630 206 62 324 98 258 115 75 290
2026/2027109 107 2 0 0 0 0 0 0 0 0 0 0
Totale 7.859