IRIS
GALBIATI, GIULIA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.143
EU - Europa 1.076
AS - Asia 617
AF - Africa 1
Totale 2.837
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.142
CN - Cina 613
IE - Irlanda 332
UA - Ucraina 243
DE - Germania 130
FI - Finlandia 122
SE - Svezia 85
GB - Regno Unito 70
IT - Italia 45
FR - Francia 33
BE - Belgio 14
AT - Austria 1
CA - Canada 1
IN - India 1
JP - Giappone 1
MU - Mauritius 1
RU - Federazione Russa 1
SG - Singapore 1
TR - Turchia 1
Totale 2.837
Salva come PNG Salva come JPEG
Città #
Dublin 332
Jacksonville 290
Chandler 243
Nanjing 190
Nanchang 84
Ann Arbor 72
Ashburn 70
Hebei 63
Princeton 61
Lawrence 53
Changsha 45
Medford 45
Beijing 43
Jiaxing 43
Wilmington 43
Tianjin 39
Shenyang 38
Milan 27
Hangzhou 25
Boardman 22
Woodbridge 20
Verona 17
Helsinki 16
Brussels 14
Norwalk 8
Shanghai 8
Seattle 7
Auburn Hills 5
Des Moines 5
Los Angeles 4
Ningbo 4
Bonn 3
Changchun 3
Houston 3
Lanzhou 3
New York 3
Taizhou 3
Fuzhou 2
Kunming 2
Landau 2
London 2
Tappahannock 2
Chicago 1
Englewood 1
Falls Church 1
Framingham 1
Guangzhou 1
Jinan 1
Orange 1
Pavia 1
Pune 1
Redwood City 1
Santa Clara 1
Toronto 1
Washington 1
Zhengzhou 1
Totale 1.978
Salva come PNG Salva come JPEG
Nome #
Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance 92
On Minimum Changeover Cost Arborescences 86
On Minimum Reload Cost Cycle Cover 74
On Minimum Reload Cost Cycle Cover 74
Approximability of Hard Combinatorial Optimization Problems: an Introduction 71
Exact matroid parity and polynomial identities 71
Constructing an exact parity base is in RNC$^{2}$ 66
Approximating Maximum Cut with Limited Unbalance 66
On the approximability of some Maximum Spanning Tree Problems 64
On the complexity of finding multi-constrained spanning trees 62
Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance 61
Collezione di Modelli e Strumenti Matematici 60
Coloring of paths into forests 59
Approximation Algorithms for Maximum Cut with Limited Unbalance 59
On Optimum Cycle Bases 58
On permutation-embedding sequences 58
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem 56
On the complexity of finding constrained trees: a survey 56
The Complexity of a Minimum Reload Cost Diameter Problem 55
On the Approximability of the Minimum Fundamental Cycle Basis Problem 54
On the Approximation of the Minimum Disturbance p-Facility Location Problem 53
The bounded path tree problem 53
Linking Centers and Reliable Trees of a Network 53
A short note on the approximability of the Maximum Leaves Spanning Tree Problem 53
On the complexity of Steiner-like problems 53
On the Asymptotic Probabilistic Analysis of Scheduling Problems in the Presence of Precedence Constraints 53
The image of weighted combinatorial problems 52
Hierarchical Data Structures and Geometrical Modeling: an Unified Approach 52
Random pseudo-polynomial algorithms for some combinatorial programming problems 52
On the Worst-Case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem 51
Modular Arithmetic and Randomization for Exact Matroid Problems 51
On Min-Max Cycle Bases 51
Combinatorial optimization through algorithms for exact problems and scaling 51
On the computation of pfaffians 50
Approximating Minimum Cut with Bounded Size 50
On Minimum Reload Cost Paths, Tours and Flows 49
Combinatorial Structures and Algorithms 48
ON THE COMPLEXITY OF 2-OUPUT BOOLEAN NETWORKS 47
Complexity of spanning tree problems: Part I 47
A Phrase-Based Matching Function 47
Linking-Centers and Reliable-Trees of a Network 47
On the Logical Definability of Some Maximum Leaves Problems 46
Approximating Max Cut with Limited Unbalance 46
On Minimum Reload Cost Paths, Tours and Flows 44
Efficiency issues in the RLF heuristic for graph coloring 44
The Complexity of Weighted Multiconstrained Spanning Tree Problems 43
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems 41
Algorithms for finding optimum trees: description, use and evaluation 41
An exact upper bound to the maximum number of perfect matchings in cubic pseudographs 41
On the Hardness of Approximating Minimum Reload Cost Paths, Trees, Tours and Flows 40
On the Approximability of the Minimum Strictly Fundamental Cycle Bases Problem 35
On the Approximation of two Location Problems having Disturbance or Facility Constraints 32
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle 32
Totale 2.850
Salva come PNG Salva come JPEG
Categoria #
all - tutte 8.122
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 8.122
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20192 0 0 0 0 0 0 0 0 0 0 2 0
2019/2020799 216 324 0 45 6 51 2 54 0 52 49 0
2020/2021429 52 44 14 46 2 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/2024189 20 48 5 15 14 51 2 24 2 6 2 0
Totale 2.850