GALBIATI, GIULIA
 Distribuzione geografica
Continente #
NA - Nord America 1.623
AS - Asia 1.385
EU - Europa 1.376
SA - Sud America 107
AF - Africa 77
Totale 4.568
Nazione #
US - Stati Uniti d'America 1.609
CN - Cina 769
IE - Irlanda 334
SG - Singapore 322
UA - Ucraina 244
DE - Germania 168
FI - Finlandia 165
HK - Hong Kong 130
RU - Federazione Russa 104
FR - Francia 94
GB - Regno Unito 88
SE - Svezia 87
VN - Vietnam 77
BR - Brasile 73
ZA - Sudafrica 61
IT - Italia 49
IN - India 25
BE - Belgio 14
IQ - Iraq 9
PL - Polonia 9
MX - Messico 8
EC - Ecuador 7
TR - Turchia 7
BD - Bangladesh 6
ES - Italia 6
JP - Giappone 6
VE - Venezuela 6
AR - Argentina 5
CL - Cile 5
NL - Olanda 5
PK - Pakistan 5
CA - Canada 4
CO - Colombia 4
MA - Marocco 4
TN - Tunisia 4
AE - Emirati Arabi Uniti 3
JO - Giordania 3
PE - Perù 3
PH - Filippine 3
AT - Austria 2
DZ - Algeria 2
KZ - Kazakistan 2
LB - Libano 2
PA - Panama 2
SA - Arabia Saudita 2
UY - Uruguay 2
UZ - Uzbekistan 2
AM - Armenia 1
AZ - Azerbaigian 1
BH - Bahrain 1
BO - Bolivia 1
CG - Congo 1
CI - Costa d'Avorio 1
ET - Etiopia 1
GE - Georgia 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
IL - Israele 1
IR - Iran 1
KE - Kenya 1
KW - Kuwait 1
LK - Sri Lanka 1
MD - Moldavia 1
MU - Mauritius 1
MY - Malesia 1
NO - Norvegia 1
NP - Nepal 1
OM - Oman 1
PT - Portogallo 1
PY - Paraguay 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
TH - Thailandia 1
Totale 4.568
Città #
Dublin 334
Jacksonville 290
Chandler 244
Nanjing 190
Singapore 171
Ashburn 133
Hong Kong 128
Beijing 92
San Jose 89
Nanchang 84
Dallas 80
Boardman 79
Ann Arbor 72
Hebei 63
Princeton 61
Helsinki 58
Johannesburg 58
Lawrence 53
Lauterbourg 48
Changsha 47
Medford 45
Jiaxing 43
Wilmington 43
Tianjin 40
Shenyang 38
Ho Chi Minh City 37
Los Angeles 33
Moscow 28
Milan 27
Hangzhou 26
Buffalo 23
Woodbridge 20
Verona 19
Shanghai 17
Falkenstein 16
Brussels 14
New York 11
Redondo Beach 10
Hanoi 9
Norwalk 8
Seattle 8
Warsaw 8
Da Nang 7
Orem 7
Frankfurt am Main 6
Munich 6
Quito 6
Santa Clara 6
São Paulo 6
Auburn Hills 5
Brooklyn 5
Chennai 5
Des Moines 5
Poplar 5
Tokyo 5
Guangzhou 4
Houston 4
Ningbo 4
Taizhou 4
Amman 3
Bexley 3
Biên Hòa 3
Bonn 3
Changchun 3
Chicago 3
Colombo 3
Fortaleza 3
Fuzhou 3
Kunming 3
Lahore 3
Lanzhou 3
London 3
Mumbai 3
New Delhi 3
Recife 3
Santiago 3
Zhengzhou 3
Ahmedabad 2
Amsterdam 2
Baghdad 2
Ben Arous 2
Brasília 2
Campinas 2
Caracas 2
Charlotte 2
Erbil 2
Hyderabad 2
Hải Dương 2
Indio 2
Itajaí 2
Landau 2
Lima 2
Manchester 2
Mexico City 2
Montevideo 2
Mosul 2
Panama City 2
Phoenix 2
Quận Bình Thạnh 2
Rio de Janeiro 2
Totale 3.087
Nome #
Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance 139
On Minimum Changeover Cost Arborescences 118
Approximability of Hard Combinatorial Optimization Problems: an Introduction 112
Exact matroid parity and polynomial identities 112
Combinatorial optimization through algorithms for exact problems and scaling 111
On Minimum Reload Cost Cycle Cover 109
Approximating Maximum Cut with Limited Unbalance 107
Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance 104
On Minimum Reload Cost Cycle Cover 104
Constructing an exact parity base is in RNC$^{2}$ 101
Coloring of paths into forests 101
Approximation Algorithms for Maximum Cut with Limited Unbalance 100
On the approximability of some Maximum Spanning Tree Problems 98
A short note on the approximability of the Maximum Leaves Spanning Tree Problem 98
Efficiency issues in the RLF heuristic for graph coloring 98
Collezione di Modelli e Strumenti Matematici 95
Combinatorial Structures and Algorithms 92
Hierarchical Data Structures and Geometrical Modeling: an Unified Approach 89
On permutation-embedding sequences 89
An exact upper bound to the maximum number of perfect matchings in cubic pseudographs 88
Approximating Minimum Cut with Bounded Size 87
On the complexity of finding multi-constrained spanning trees 86
Approximating Max Cut with Limited Unbalance 85
On Optimum Cycle Bases 84
Complexity of spanning tree problems: Part I 84
On the complexity of Steiner-like problems 83
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem 82
On the Worst-Case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem 82
On the Approximability of the Minimum Fundamental Cycle Basis Problem 82
The Complexity of a Minimum Reload Cost Diameter Problem 81
Modular Arithmetic and Randomization for Exact Matroid Problems 81
On Minimum Reload Cost Paths, Tours and Flows 80
Linking Centers and Reliable Trees of a Network 80
Random pseudo-polynomial algorithms for some combinatorial programming problems 80
On the Asymptotic Probabilistic Analysis of Scheduling Problems in the Presence of Precedence Constraints 80
A Phrase-Based Matching Function 80
On the complexity of finding constrained trees: a survey 77
On the Approximation of the Minimum Disturbance p-Facility Location Problem 76
The image of weighted combinatorial problems 76
Algorithms for finding optimum trees: description, use and evaluation 76
The Complexity of Weighted Multiconstrained Spanning Tree Problems 75
ON THE COMPLEXITY OF 2-OUPUT BOOLEAN NETWORKS 75
Linking-Centers and Reliable-Trees of a Network 75
On the computation of pfaffians 74
The bounded path tree problem 73
On the Logical Definability of Some Maximum Leaves Problems 73
On Minimum Reload Cost Paths, Tours and Flows 73
On Min-Max Cycle Bases 72
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems 69
On the Hardness of Approximating Minimum Reload Cost Paths, Trees, Tours and Flows 64
On the Approximation of two Location Problems having Disturbance or Facility Constraints 60
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle 57
On the Approximability of the Minimum Strictly Fundamental Cycle Bases Problem 54
Totale 4.581
Categoria #
all - tutte 16.452
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 16.452


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021143 0 0 0 0 0 0 0 0 0 66 64 13
2021/2022207 5 3 1 3 3 6 5 15 6 4 38 118
2022/2023784 79 75 7 39 88 75 0 23 373 6 14 5
2023/2024200 20 48 5 15 14 51 2 24 2 6 7 6
2024/2025598 4 60 17 27 27 55 10 35 135 7 53 168
2025/20261.122 101 76 127 86 139 82 228 73 93 117 0 0
Totale 4.581