IRIS
GALBIATI, GIULIA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.207
EU - Europa 1.078
AS - Asia 676
AF - Africa 1
Totale 2.962
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.205
CN - Cina 620
IE - Irlanda 332
UA - Ucraina 243
DE - Germania 130
FI - Finlandia 122
SE - Svezia 85
GB - Regno Unito 70
SG - Singapore 52
IT - Italia 45
FR - Francia 33
BE - Belgio 14
AT - Austria 2
CA - Canada 2
IN - India 1
JP - Giappone 1
MU - Mauritius 1
NO - Norvegia 1
RU - Federazione Russa 1
TH - Thailandia 1
TR - Turchia 1
Totale 2.962
Salva come PNG Salva come JPEG
Città #
Dublin 332
Jacksonville 290
Chandler 243
Nanjing 190
Nanchang 84
Boardman 79
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
Singapore 38
Milan 27
Hangzhou 25
Woodbridge 20
Verona 17
Helsinki 16
Shanghai 15
Brussels 14
Norwalk 8
Seattle 7
Los Angeles 6
Auburn Hills 5
Des Moines 5
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
Terre Haute 1
Toronto 1
Vienna 1
Washington 1
Zhengzhou 1
Totale 2.084
Salva come PNG Salva come JPEG
Nome #
Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance 95
On Minimum Changeover Cost Arborescences 90
On Minimum Reload Cost Cycle Cover 78
On Minimum Reload Cost Cycle Cover 78
Approximability of Hard Combinatorial Optimization Problems: an Introduction 74
Exact matroid parity and polynomial identities 73
Approximating Maximum Cut with Limited Unbalance 69
Constructing an exact parity base is in RNC$^{2}$ 68
On the approximability of some Maximum Spanning Tree Problems 66
On the complexity of finding multi-constrained spanning trees 64
Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance 63
Collezione di Modelli e Strumenti Matematici 62
Coloring of paths into forests 62
On Optimum Cycle Bases 60
On permutation-embedding sequences 60
Approximation Algorithms for Maximum Cut with Limited Unbalance 60
The Complexity of a Minimum Reload Cost Diameter Problem 58
On the complexity of finding constrained trees: a survey 58
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem 57
On the Approximability of the Minimum Fundamental Cycle Basis Problem 57
On the Approximation of the Minimum Disturbance p-Facility Location Problem 56
A short note on the approximability of the Maximum Leaves Spanning Tree Problem 56
The bounded path tree problem 55
Hierarchical Data Structures and Geometrical Modeling: an Unified Approach 55
Linking Centers and Reliable Trees of a Network 55
On the complexity of Steiner-like problems 55
On the Asymptotic Probabilistic Analysis of Scheduling Problems in the Presence of Precedence Constraints 55
The image of weighted combinatorial problems 54
Random pseudo-polynomial algorithms for some combinatorial programming problems 54
On the Worst-Case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem 53
Modular Arithmetic and Randomization for Exact Matroid Problems 53
On Min-Max Cycle Bases 53
Combinatorial optimization through algorithms for exact problems and scaling 53
On the computation of pfaffians 52
Approximating Minimum Cut with Bounded Size 52
On Minimum Reload Cost Paths, Tours and Flows 51
Complexity of spanning tree problems: Part I 51
Combinatorial Structures and Algorithms 51
ON THE COMPLEXITY OF 2-OUPUT BOOLEAN NETWORKS 50
On the Logical Definability of Some Maximum Leaves Problems 49
A Phrase-Based Matching Function 49
Linking-Centers and Reliable-Trees of a Network 49
Approximating Max Cut with Limited Unbalance 48
Efficiency issues in the RLF heuristic for graph coloring 48
On Minimum Reload Cost Paths, Tours and Flows 46
The Complexity of Weighted Multiconstrained Spanning Tree Problems 45
Algorithms for finding optimum trees: description, use and evaluation 44
An exact upper bound to the maximum number of perfect matchings in cubic pseudographs 44
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems 43
On the Hardness of Approximating Minimum Reload Cost Paths, Trees, Tours and Flows 41
On the Approximability of the Minimum Strictly Fundamental Cycle Bases Problem 36
On the Approximation of two Location Problems having Disturbance or Facility Constraints 34
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle 33
Totale 2.975
Salva come PNG Salva come JPEG
Categoria #
all - tutte 10.271
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 10.271
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020214 0 0 0 0 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/2024200 20 48 5 15 14 51 2 24 2 6 7 6
2024/2025114 4 60 17 27 6 0 0 0 0 0 0 0
Totale 2.975