FERREIRA DA SILVA, ANA SHIRLEY
 Distribuzione geografica
Continente #
NA - Nord America 3.223
AS - Asia 2.926
EU - Europa 1.377
SA - Sud America 498
Continente sconosciuto - Info sul continente non disponibili 75
AF - Africa 63
OC - Oceania 51
Totale 8.213
Nazione #
US - Stati Uniti d'America 3.133
CN - Cina 1.017
SG - Singapore 815
RU - Federazione Russa 813
BR - Brasile 392
KR - Corea 355
IT - Italia 330
HK - Hong Kong 285
VN - Vietnam 214
IN - India 77
FR - Francia 69
AU - Australia 51
CA - Canada 48
AR - Argentina 44
BD - Bangladesh 32
FI - Finlandia 32
ID - Indonesia 28
GB - Regno Unito 27
JP - Giappone 26
IE - Irlanda 25
DE - Germania 17
MX - Messico 17
EC - Ecuador 16
NG - Nigeria 14
SE - Svezia 14
BJ - Benin 13
CO - Colombia 12
IQ - Iraq 12
ZA - Sudafrica 12
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
JM - Giamaica 6
TH - Thailandia 6
AT - Austria 5
MA - Marocco 5
PE - Perù 5
SA - Arabia Saudita 5
CR - Costa Rica 4
GT - Guatemala 4
MY - Malesia 4
PH - Filippine 4
PK - Pakistan 4
PL - Polonia 4
UA - Ucraina 4
KE - Kenya 3
KH - Cambogia 3
KZ - Kazakistan 3
LB - Libano 3
OM - Oman 3
UZ - Uzbekistan 3
AM - Armenia 2
AZ - Azerbaigian 2
BO - Bolivia 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
AL - Albania 1
BB - Barbados 1
BE - Belgio 1
BW - Botswana 1
BZ - Belize 1
CZ - Repubblica Ceca 1
DM - Dominica 1
EE - Estonia 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 8.138
Città #
Santa Clara 1.718
Singapore 645
Hefei 528
Seoul 354
San Jose 311
Hong Kong 230
Ashburn 198
Milan 96
Ho Chi Minh City 81
Council Bluffs 63
Moscow 62
The Dalles 57
Lauterbourg 54
Melbourne 50
Hanoi 46
Buffalo 45
Kent 44
Los Angeles 43
Rome 42
Bengaluru 39
Dallas 36
Beijing 35
Phoenix 34
São Paulo 34
Helsinki 27
Tokyo 26
Mumbai 25
Dublin 23
New York 20
Rio de Janeiro 16
Florence 15
Abuja 14
Haiphong 14
Cotonou 13
West Jordan 12
Jakarta 11
Abidjan 10
Columbus 10
Guangzhou 10
Miano 10
Staranzano 10
Boardman 9
Fairfield 9
Naples 9
Altamura 8
Biên Hòa 8
Brooklyn 8
Elk Grove Village 8
Lawrence 8
Brasília 7
Cape Town 7
Chicago 7
Curitiba 7
Porto Alegre 7
Romola 7
St Louis 7
Toronto 7
Baghdad 6
Bangkok 6
Buenos Aires 6
Chandler 6
Chennai 6
Da Nang 6
Guayaquil 6
Montreal 6
Nuremberg 6
Santo André 6
Seattle 6
Yubileyny 6
Amsterdam 5
Boston 5
Bắc Ninh 5
Houston 5
Huế 5
Johannesburg 5
Lappeenranta 5
Manchester 5
Piracicaba 5
Salvador 5
Sorocaba 5
The Bronx 5
Thái Bình 5
Asunción 4
Belo Horizonte 4
Bologna 4
Campinas 4
Can Tho 4
Cincinnati 4
Falkenstein 4
Glasgow 4
Hải Dương 4
Monza 4
Natal 4
Orem 4
Osasco 4
Ourinhos 4
Princeton 4
Queens 4
San Juan 4
Santiago 4
Totale 5.443
Nome #
On Computing Optimal Temporal Branchings 188
On Computing Optimal Temporal Branchings and Spanning Subgraphs 178
Proper orientation of cacti 175
Coloring temporal graphs 172
On Computing Large Temporal (Unilateral) Connected Components 172
b-Coloring graphs with large girth 169
b-chromatic number of cacti 163
Backbone coloring of graphs with galaxy backbones 163
b-chromatic index of graphs 163
2K2-partition of some classes of graphs 160
Backbone colouring: Tree backbones with small diameter in planar graphs 157
On computing large temporal (unilateral) connected components 157
A bound on the treewidth of planar even-hole-free graphs 156
Acyclic coloring of products of digraphs 153
b-continuity and partial Grundy coloring of graphs with large girth 152
b-colouring outerplanar graphs with large girth 152
On the hull number on cycle convexity of graphs 151
Edge-Disjoint Branchings in Temporal Graphs 144
B-Coloring Graphs with Girth at Least 8 143
Eulerian Walks in Temporal Graphs 142
Connected Greedy Colourings 139
A unifying model for locally constrained spanning tree problems 138
Dual parameterization of weighted coloring 138
b-colouring the Cartesian product of trees and some other graphs 138
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional 136
Complexity of determining the maximum infection time in the geodetic convexity 136
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete 135
Coloring Problems on Bipartite Graphs of Small Diameter 133
Revising Johnson's Table for the 21st century 133
Backbone Coloring of Graphs with Galaxy Backbones 129
Fixed-parameter algorithms for the cocoloring problem 126
On the proper orientation number of chordal graphs 124
Circular backbone colorings: On matching and tree backbones of planar graphs 124
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs 123
Graphs with large girth are b-continuous 122
The sociotechnical teams formation problem: a mathematical optimization approach 121
Edge-disjoint branchings in temporal digraphs 121
Graphs of girth at least 7 have high b-chromatic number 120
Graphs with few P4's under the convexity of paths of order three 120
Weighted proper orientations of trees and graphs of bounded treewidth 119
The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects 119
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete 118
On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring 118
Dual Parameterization of Weighted Coloring 116
Mengerian graphs: Characterization and recognition 115
The maximum infection time in the geodesic and monophonic convexities 114
Connected greedy coloring of H-free graphs 114
Graphs with Girth at Least 8 are b-continuous 112
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects 112
On Finding the Best and Worst Orientations for the Metric Dimension 111
The b-Continuity of Graphs with Large Girth 110
The lexicographic product of some chordal graphs and of cographs preserves b-continuity 108
Mengerian Graphs Revisited 104
Even-hole-free planar graphs have bounded treewidth 103
On computing large temporal (unilateral) connected components 102
On the complexity of finding internally vertex-disjoint long directed paths 99
The b-chromatic index of graphs 99
Edge-b-Coloring Trees 99
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths 97
MaxC ut on permutation graphs is NP-complete 96
On the b-Continuity of the Lexicographic Product of Graphs 93
Graphs with small fall-spectrum 86
Two Fixed-Parameter Algorithms for the Cocoloring Problem 83
Totale 8.213
Categoria #
all - tutte 21.089
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 21.089


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/2027463 107 76 202 78 0 0 0 0 0 0 0 0
Totale 8.213