IRIS
GALBIATI, GIULIA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.478
EU - Europa 1.308
AS - Asia 1.156
SA - Sud America 62
AF - Africa 14
Totale 4.018
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.466
CN - Cina 758
IE - Irlanda 332
UA - Ucraina 244
SG - Singapore 227
FI - Finlandia 165
DE - Germania 163
HK - Hong Kong 122
RU - Federazione Russa 104
SE - Svezia 87
GB - Regno Unito 85
BR - Brasile 52
IT - Italia 48
FR - Francia 45
BE - Belgio 14
IN - India 12
VN - Vietnam 11
PL - Polonia 9
MX - Messico 6
ZA - Sudafrica 6
CA - Canada 4
NL - Olanda 4
TR - Turchia 4
BD - Bangladesh 3
EC - Ecuador 3
JO - Giordania 3
JP - Giappone 3
MA - Marocco 3
TN - Tunisia 3
AE - Emirati Arabi Uniti 2
AT - Austria 2
ES - Italia 2
PA - Panama 2
PK - Pakistan 2
SA - Arabia Saudita 2
AM - Armenia 1
AR - Argentina 1
BH - Bahrain 1
BO - Bolivia 1
CL - Cile 1
HR - Croazia 1
HU - Ungheria 1
IQ - Iraq 1
KE - Kenya 1
LB - Libano 1
MU - Mauritius 1
NO - Norvegia 1
NP - Nepal 1
PE - Perù 1
PT - Portogallo 1
PY - Paraguay 1
TH - Thailandia 1
UY - Uruguay 1
UZ - Uzbekistan 1
VE - Venezuela 1
Totale 4.018
Salva come PNG Salva come JPEG
Città #
Dublin 332
Jacksonville 290
Chandler 244
Nanjing 190
Hong Kong 121
Singapore 119
Ashburn 103
Beijing 92
Nanchang 84
Boardman 79
Dallas 79
Ann Arbor 72
Hebei 63
Princeton 61
Helsinki 58
Lawrence 53
Changsha 47
Medford 45
Jiaxing 43
Wilmington 43
Tianjin 40
Shenyang 38
Los Angeles 31
Moscow 28
Milan 27
Hangzhou 26
Buffalo 23
Woodbridge 20
Verona 19
Shanghai 17
Falkenstein 16
Brussels 14
Redondo Beach 10
New York 9
Norwalk 8
Seattle 8
Warsaw 8
Ho Chi Minh City 6
Munich 6
São Paulo 6
Auburn Hills 5
Des Moines 5
Johannesburg 5
Poplar 5
Brooklyn 4
Chennai 4
Frankfurt am Main 4
Guangzhou 4
Houston 4
Ningbo 4
Santa Clara 4
Taizhou 4
Amman 3
Bexley 3
Bonn 3
Changchun 3
Chicago 3
Fuzhou 3
Kunming 3
Lanzhou 3
London 3
Quito 3
Zhengzhou 3
Ahmedabad 2
Brasília 2
Campinas 2
Charlotte 2
Hanoi 2
Indio 2
Itajaí 2
Landau 2
Manchester 2
New Delhi 2
Orem 2
Panama City 2
Phoenix 2
Roubaix 2
Salt Lake City 2
San Francisco 2
St Petersburg 2
Stockholm 2
Tappahannock 2
Tijucas 2
Tokyo 2
Abu Dhabi 1
Afragola 1
Agadir 1
Alvorada 1
Amsterdam 1
Antakya 1
Arrecifes 1
Aryanah 1
Asunción 1
Atlanta 1
Augusta 1
Bad Kreuznach 1
Basingstoke 1
Bauru 1
Beirut 1
Ben Arous 1
Totale 2.721
Salva come PNG Salva come JPEG
Nome #
Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance 124
On Minimum Changeover Cost Arborescences 106
Approximability of Hard Combinatorial Optimization Problems: an Introduction 101
Exact matroid parity and polynomial identities 100
Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance 94
On Minimum Reload Cost Cycle Cover 94
On Minimum Reload Cost Cycle Cover 94
Constructing an exact parity base is in RNC$^{2}$ 91
Approximating Maximum Cut with Limited Unbalance 91
A short note on the approximability of the Maximum Leaves Spanning Tree Problem 88
Coloring of paths into forests 88
Approximation Algorithms for Maximum Cut with Limited Unbalance 87
Collezione di Modelli e Strumenti Matematici 86
On the approximability of some Maximum Spanning Tree Problems 85
Combinatorial Structures and Algorithms 85
Combinatorial optimization through algorithms for exact problems and scaling 82
Hierarchical Data Structures and Geometrical Modeling: an Unified Approach 80
On permutation-embedding sequences 79
Approximating Minimum Cut with Bounded Size 79
Efficiency issues in the RLF heuristic for graph coloring 79
On the complexity of finding multi-constrained spanning trees 76
Approximating Max Cut with Limited Unbalance 76
Complexity of spanning tree problems: Part I 76
On Optimum Cycle Bases 75
On the Asymptotic Probabilistic Analysis of Scheduling Problems in the Presence of Precedence Constraints 74
A Phrase-Based Matching Function 74
An exact upper bound to the maximum number of perfect matchings in cubic pseudographs 73
On the Worst-Case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem 72
On the Approximability of the Minimum Fundamental Cycle Basis Problem 72
On the complexity of Steiner-like problems 72
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem 71
Random pseudo-polynomial algorithms for some combinatorial programming problems 71
On Minimum Reload Cost Paths, Tours and Flows 70
Modular Arithmetic and Randomization for Exact Matroid Problems 70
The image of weighted combinatorial problems 70
On the complexity of finding constrained trees: a survey 70
The Complexity of a Minimum Reload Cost Diameter Problem 69
Linking Centers and Reliable Trees of a Network 69
Algorithms for finding optimum trees: description, use and evaluation 69
On the computation of pfaffians 68
ON THE COMPLEXITY OF 2-OUPUT BOOLEAN NETWORKS 67
Linking-Centers and Reliable-Trees of a Network 67
On the Approximation of the Minimum Disturbance p-Facility Location Problem 66
The bounded path tree problem 65
On Min-Max Cycle Bases 65
On the Logical Definability of Some Maximum Leaves Problems 64
On Minimum Reload Cost Paths, Tours and Flows 64
The Complexity of Weighted Multiconstrained Spanning Tree Problems 63
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems 61
On the Hardness of Approximating Minimum Reload Cost Paths, Trees, Tours and Flows 52
On the Approximation of two Location Problems having Disturbance or Facility Constraints 50
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle 49
On the Approximability of the Minimum Strictly Fundamental Cycle Bases Problem 48
Totale 4.031
Salva come PNG Salva come JPEG
Categoria #
all - tutte 15.439
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.439
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021271 0 0 0 0 0 59 3 53 13 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/2026572 101 76 127 86 139 43 0 0 0 0 0 0
Totale 4.031