FERREIRA DA SILVA, ANA SHIRLEY
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 2.608
NA - Nord America 2.289
EU - Europa 1.024
SA - Sud America 464
OC - Oceania 51
AF - Africa 46
Totale 6.482
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.260
CN - Cina 919
RU - Federazione Russa 813
SG - Singapore 734
BR - Brasile 371
KR - Corea 354
HK - Hong Kong 280
VN - Vietnam 149
IN - India 72
IT - Italia 59
AU - Australia 51
AR - Argentina 41
FI - Finlandia 30
ID - Indonesia 25
IE - Irlanda 24
GB - Regno Unito 21
EC - Ecuador 15
BD - Bangladesh 14
SE - Svezia 14
BJ - Benin 13
MX - Messico 13
DE - Germania 12
FR - Francia 11
PY - Paraguay 11
ZA - Sudafrica 11
CO - Colombia 10
CI - Costa d'Avorio 9
CA - Canada 7
ES - Italia 7
IQ - Iraq 7
JO - Giordania 7
NL - Olanda 7
VE - Venezuela 7
AT - Austria 5
CH - Svizzera 5
MA - Marocco 5
TH - Thailandia 5
TR - Turchia 5
JP - Giappone 4
PE - Perù 4
SA - Arabia Saudita 4
CL - Cile 3
CR - Costa Rica 3
KE - Kenya 3
KH - Cambogia 3
MY - Malesia 3
PL - Polonia 3
UA - Ucraina 3
UZ - Uzbekistan 3
AM - Armenia 2
BY - Bielorussia 2
DZ - Algeria 2
HN - Honduras 2
JM - Giamaica 2
KZ - Kazakistan 2
LB - Libano 2
MM - Myanmar 2
NP - Nepal 2
PH - Filippine 2
PK - Pakistan 2
PS - Palestinian Territory 2
AZ - Azerbaigian 1
BE - Belgio 1
BO - Bolivia 1
BW - Botswana 1
CZ - Repubblica Ceca 1
DO - Repubblica Dominicana 1
EG - Egitto 1
GT - Guatemala 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
OM - Oman 1
TN - Tunisia 1
UY - Uruguay 1
Totale 6.482
Salva come PNG Salva come JPEG
Città #
Santa Clara 1.710
Singapore 573
Hefei 527
Seoul 354
Hong Kong 228
Moscow 62
Ho Chi Minh City 56
Melbourne 50
Ashburn 48
Buffalo 44
Kent 44
Bengaluru 39
Los Angeles 34
Beijing 30
Dallas 30
Hanoi 30
Helsinki 25
São Paulo 25
Mumbai 24
Dublin 22
The Dalles 16
Rio de Janeiro 15
Cotonou 13
West Jordan 12
Florence 11
Abidjan 9
Fairfield 9
Jakarta 9
New York 9
Altamura 8
Lawrence 8
Biên Hòa 7
Brasília 7
Cape Town 7
Haiphong 7
Porto Alegre 7
Romola 7
Buenos Aires 6
Chandler 6
Curitiba 6
Guayaquil 6
Phoenix 6
Rome 6
Santo André 6
Yubileyny 6
Bangkok 5
Boston 5
Lappeenranta 5
Seattle 5
Sorocaba 5
Thái Bình 5
Amsterdam 4
Asunción 4
Belo Horizonte 4
Brooklyn 4
Bắc Ninh 4
Campinas 4
Chennai 4
Da Nang 4
Falkenstein 4
Glasgow 4
Hải Dương 4
Johannesburg 4
Nuremberg 4
Osasco 4
Ourinhos 4
Piracicaba 4
Princeton 4
Salvador 4
Tokyo 4
Wilmington 4
Woodbridge 4
Augusta 3
Bern 3
Betim 3
Blumenau 3
Bogotá 3
Can Tho 3
Cerquilho 3
Florianópolis 3
Fortaleza 3
Goiânia 3
Guangzhou 3
Houston 3
Huế 3
Joinville 3
Manchester 3
Marília 3
Natal 3
Niterói 3
Paris 3
Pescara 3
Phnom Penh 3
Poplar 3
Quito 3
Quảng Nam Province 3
San Juan 3
Santa Maria 3
São Carlos 3
São Gonçalo 3
Totale 4.362
Salva come PNG Salva come JPEG
Nome #
On Computing Optimal Temporal Branchings 155
On Computing Large Temporal (Unilateral) Connected Components 144
b-chromatic number of cacti 142
Proper orientation of cacti 139
A bound on the treewidth of planar even-hole-free graphs 133
b-chromatic index of graphs 132
Coloring temporal graphs 131
b-Coloring graphs with large girth 130
b-continuity and partial Grundy coloring of graphs with large girth 130
Backbone colouring: Tree backbones with small diameter in planar graphs 127
b-colouring outerplanar graphs with large girth 124
Backbone coloring of graphs with galaxy backbones 123
On Computing Optimal Temporal Branchings and Spanning Subgraphs 123
Dual parameterization of weighted coloring 123
2K2-partition of some classes of graphs 119
Connected Greedy Colourings 117
b-colouring the Cartesian product of trees and some other graphs 117
B-Coloring Graphs with Girth at Least 8 116
A unifying model for locally constrained spanning tree problems 111
Coloring Problems on Bipartite Graphs of Small Diameter 111
On computing large temporal (unilateral) connected components 110
Edge-Disjoint Branchings in Temporal Graphs 110
Complexity of determining the maximum infection time in the geodetic convexity 109
Eulerian Walks in Temporal Graphs 109
Revising Johnson's Table for the 21st century 109
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete 105
Backbone Coloring of Graphs with Galaxy Backbones 105
Circular backbone colorings: On matching and tree backbones of planar graphs 104
Graphs of girth at least 7 have high b-chromatic number 103
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional 103
The sociotechnical teams formation problem: a mathematical optimization approach 102
The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects 100
Weighted proper orientations of trees and graphs of bounded treewidth 99
On the proper orientation number of chordal graphs 98
The maximum infection time in the geodesic and monophonic convexities 98
Edge-disjoint branchings in temporal digraphs 98
On the hull number on cycle convexity of graphs 97
Fixed-parameter algorithms for the cocoloring problem 96
On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring 96
The b-Continuity of Graphs with Large Girth 95
Dual Parameterization of Weighted Coloring 95
Acyclic coloring of products of digraphs 95
Graphs with Girth at Least 8 are b-continuous 94
Graphs with large girth are b-continuous 94
Graphs with few P4's under the convexity of paths of order three 94
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs 94
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete 92
The lexicographic product of some chordal graphs and of cographs preserves b-continuity 91
Mengerian graphs: Characterization and recognition 91
Connected greedy coloring of H-free graphs 91
Mengerian Graphs Revisited 87
Even-hole-free planar graphs have bounded treewidth 86
On Finding the Best and Worst Orientations for the Metric Dimension 85
On the complexity of finding internally vertex-disjoint long directed paths 83
The b-chromatic index of graphs 83
On the b-Continuity of the Lexicographic Product of Graphs 83
Edge-b-Coloring Trees 81
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths 81
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects 81
On computing large temporal (unilateral) connected components 80
MaxC ut on permutation graphs is NP-complete 72
Graphs with small fall-spectrum 69
Two Fixed-Parameter Algorithms for the Cocoloring Problem 62
Totale 6.557
Salva come PNG Salva come JPEG
Categoria #
all - tutte 15.674
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 15.674
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20214 0 0 0 0 0 0 0 0 2 0 2 0
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/20262.742 362 708 807 630 206 29 0 0 0 0 0 0
Totale 6.557