BRAZ PASCOAL, MARTA MARGARIDA
 Distribuzione geografica
Continente #
NA - Nord America 1.423
AS - Asia 1.235
EU - Europa 1.084
SA - Sud America 217
Continente sconosciuto - Info sul continente non disponibili 62
AF - Africa 27
OC - Oceania 2
Totale 4.050
Nazione #
US - Stati Uniti d'America 1.375
RU - Federazione Russa 520
SG - Singapore 417
IT - Italia 375
CN - Cina 368
BR - Brasile 181
VN - Vietnam 140
KR - Corea 104
JP - Giappone 99
FR - Francia 57
DE - Germania 33
HK - Hong Kong 22
GB - Regno Unito 21
BD - Bangladesh 19
CA - Canada 17
MX - Messico 15
IN - India 14
AR - Argentina 13
ES - Italia 13
ID - Indonesia 13
PT - Portogallo 10
NL - Olanda 9
AT - Austria 7
IQ - Iraq 7
PL - Polonia 7
SE - Svezia 7
FI - Finlandia 6
PK - Pakistan 6
ZA - Sudafrica 6
CL - Cile 5
CH - Svizzera 4
CO - Colombia 4
EC - Ecuador 4
IE - Irlanda 4
KE - Kenya 4
PH - Filippine 4
SA - Arabia Saudita 4
VE - Venezuela 4
CI - Costa d'Avorio 3
IS - Islanda 3
JM - Giamaica 3
TN - Tunisia 3
TT - Trinidad e Tobago 3
UZ - Uzbekistan 3
BH - Bahrain 2
BJ - Benin 2
BO - Bolivia 2
BY - Bielorussia 2
CR - Costa Rica 2
EG - Egitto 2
NZ - Nuova Zelanda 2
PE - Perù 2
SN - Senegal 2
TH - Thailandia 2
TR - Turchia 2
TW - Taiwan 2
UY - Uruguay 2
AE - Emirati Arabi Uniti 1
AF - Afghanistan, Repubblica islamica di 1
AL - Albania 1
AO - Angola 1
BB - Barbados 1
BS - Bahamas 1
CG - Congo 1
CW - ???statistics.table.value.countryCode.CW??? 1
DK - Danimarca 1
DO - Repubblica Dominicana 1
DZ - Algeria 1
EE - Estonia 1
GA - Gabon 1
HN - Honduras 1
HR - Croazia 1
KH - Cambogia 1
LC - Santa Lucia 1
MA - Marocco 1
MY - Malesia 1
NI - Nicaragua 1
NO - Norvegia 1
NP - Nepal 1
OM - Oman 1
PA - Panama 1
QA - Qatar 1
SK - Slovacchia (Repubblica Slovacca) 1
SV - El Salvador 1
Totale 3.989
Città #
San Jose 254
Milan 243
Ashburn 220
Singapore 172
Seoul 103
Santa Clara 91
Tokyo 89
The Dalles 81
Beijing 74
Dallas 73
Hefei 62
Council Bluffs 58
Moscow 57
Ho Chi Minh City 50
Lauterbourg 42
Hanoi 33
Los Angeles 33
New York 30
Rome 23
Hong Kong 22
Phoenix 21
Orem 17
Buffalo 16
Boardman 15
São Paulo 15
North Charleston 14
Nuremberg 12
Florence 11
Mexico City 11
Málaga 10
Brooklyn 9
Shanghai 9
Atlanta 8
Chicago 8
Guangzhou 8
Las Vegas 8
Osaka 8
Tianjin 8
Chandler 7
Houston 7
Lawrence 7
Salt Lake City 7
Da Nang 6
Detroit 6
Frankfurt am Main 6
Warsaw 6
Amsterdam 5
Denver 5
Des Moines 5
Düsseldorf 5
Fairfield 5
Hanover 5
Jakarta 5
Lamezia Terme 5
Pittsburgh 5
Princeton 5
Toronto 5
Xi'an 5
Dublin 4
Fortaleza 4
Johannesburg 4
London 4
Miami 4
Nanjing 4
Putian 4
Queens 4
Reggio Calabria 4
San Francisco 4
Shenzhen 4
Stockholm 4
Wuhan 4
Zurich 4
Abidjan 3
Amarante 3
Avellaneda 3
Baghdad 3
Beja 3
Bexley 3
Bologna 3
Boston 3
Brasília 3
Cagliari 3
Campina Grande 3
Carapicuíba 3
Changsha 3
Chengdu 3
Chennai 3
Cincinnati 3
Citta 3
City of London 3
Dhaka 3
Elk Grove Village 3
Figino 3
Frisco 3
Fuzhou 3
Genoa 3
Haiphong 3
Hangzhou 3
Helsinki 3
Keflavik 3
Totale 2.270
Nome #
Computational experiments with a lazy version of a K quickest simple path ranking algorithm 228
The electric vehicle shortest path problem with time windows and prize collection 163
Optimizing the integration of express bus services with micro-mobility: a case study 162
Finding K dissimilar paths: Single-commodity and discretized flow formulations 147
The Rough Interval Shortest Path Problem 142
Finding K shortest and dissimilar paths 138
An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks 134
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks 129
Bimaterial 3D printing using galvanometer scanners 124
New Models for Finding K Short and Dissimilar Paths 121
On a relaxed maximally disjoint path pair problem: a bicriteria approach 116
Bimaterial Three-Dimensional Printing Using Digital Light Processing Projectors 115
Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends 108
Implementation of Geographic Diversity in Resilient Telecommunication Networks 108
Modeling Bimaterial 3D Printing Using Galvanometer Mirror Scanners 100
A new implementation of Yen's ranking loopless paths algorithm 93
The {MinSum}-{MinHop} and the {MaxMin}-{MinHop} Bicriteria Path Problems 91
Enumerating K best paths in length order in DAGs 89
Bicriteria path problem minimizing the cost and minimizing the number of labels 87
A note on a new variant of Murty's ranking assignments algorithm 81
Algorithms for determining a node-disjoint path pair visiting specified nodes 80
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks 78
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs 78
An algorithm for ranking quickest simple paths 77
A comprehensive survey on the quickest path problem 77
An automated reference point-like approach for multicriteria shortest path problems 75
A mixed integer linear formulation for the minimum label spanning tree problem 74
Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios 74
DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS 73
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization 72
A Bicriterion Approach for Routing Problems in Multimedia Networks 72
Combining multicriteria analysis and tabu search for dial-a-ride problems 72
Minimum cost path problems with relays 70
The pipeline and valve location problem 66
Multicriteria path and tree problems: Discussion on exact algorithms and applications 62
The minmax regret robust shortest path problem in a finite multi-scenario model 59
Path based algorithms for metro network design 56
Finding non-dominated bicriteria shortest pairs of disjoint simple paths 56
On the bicriterion - minimal cost/minimal label - spanning tree problem 55
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions 54
Protected shortest path visiting specified nodes 50
Experiential learning in Science: getting the laboratory inside the classroom using the Web 50
Internet packet routing: Application of a K-quickest path algorithm 49
Reducing the Minmax Regret Robust Shortest Path Problem with Finite Multi-scenarios 45
Totale 4.050
Categoria #
all - tutte 11.484
article - articoli 8.121
book - libri 0
conference - conferenze 2.924
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 439
Totale 22.968


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/202253 0 0 0 0 0 0 0 0 20 22 3 8
2022/202383 7 0 0 18 10 7 0 8 7 14 11 1
2023/202482 7 6 3 13 2 1 1 10 22 6 4 7
2024/2025498 3 4 35 1 64 46 29 18 47 68 44 139
2025/20262.966 447 439 174 290 206 155 283 169 260 245 110 188
2026/2027368 108 98 162 0 0 0 0 0 0 0 0 0
Totale 4.050