MONACO, GIANPIERO
 Distribuzione geografica
Continente #
NA - Nord America 3.055
EU - Europa 1.753
AS - Asia 1.708
SA - Sud America 210
AF - Africa 19
OC - Oceania 6
Continente sconosciuto - Info sul continente non disponibili 3
Totale 6.754
Nazione #
US - Stati Uniti d'America 3.009
SG - Singapore 779
IE - Irlanda 522
CN - Cina 498
SE - Svezia 305
IT - Italia 209
TR - Turchia 201
BR - Brasile 191
RU - Federazione Russa 170
DE - Germania 153
GB - Regno Unito 131
UA - Ucraina 111
HK - Hong Kong 87
FI - Finlandia 55
VN - Vietnam 51
FR - Francia 32
CA - Canada 24
MX - Messico 16
IN - India 15
JP - Giappone 15
GR - Grecia 14
BE - Belgio 13
IQ - Iraq 13
BD - Bangladesh 10
IL - Israele 10
NL - Olanda 9
PL - Polonia 8
UZ - Uzbekistan 7
ES - Italia 6
ZA - Sudafrica 6
AR - Argentina 4
AT - Austria 4
AU - Australia 4
EC - Ecuador 4
PK - Pakistan 4
EU - Europa 3
IR - Iran 3
MA - Marocco 3
CH - Svizzera 2
CI - Costa d'Avorio 2
CL - Cile 2
CR - Costa Rica 2
EE - Estonia 2
EG - Egitto 2
HU - Ungheria 2
KE - Kenya 2
LT - Lituania 2
NP - Nepal 2
NZ - Nuova Zelanda 2
PE - Perù 2
PS - Palestinian Territory 2
PY - Paraguay 2
TN - Tunisia 2
UY - Uruguay 2
VE - Venezuela 2
AE - Emirati Arabi Uniti 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BO - Bolivia 1
CU - Cuba 1
DO - Repubblica Dominicana 1
DZ - Algeria 1
ET - Etiopia 1
GE - Georgia 1
GP - Guadalupe 1
ID - Indonesia 1
JO - Giordania 1
KG - Kirghizistan 1
LU - Lussemburgo 1
MN - Mongolia 1
NI - Nicaragua 1
OM - Oman 1
RO - Romania 1
SA - Arabia Saudita 1
SI - Slovenia 1
YE - Yemen 1
Totale 6.754
Città #
Dublin 518
Chandler 500
Singapore 470
Jacksonville 447
Dallas 256
Santa Clara 160
Boardman 138
Ashburn 112
Izmir 107
Nanjing 95
Hong Kong 86
New York 73
Beijing 70
Lawrence 68
Princeton 68
San Mateo 66
Wilmington 64
The Dalles 60
Ann Arbor 59
Los Angeles 48
Woodbridge 48
Moscow 46
Nanchang 43
Milan 40
L'aquila 38
Hangzhou 30
Columbus 29
Seattle 29
Munich 27
Houston 25
Des Moines 24
Shanghai 23
Kunming 22
Shenyang 22
Jinan 21
Ho Chi Minh City 20
Stockholm 19
Tianjin 16
Verona 16
Hebei 14
Brussels 13
Montreal 13
Atlanta 12
Dong Ket 12
Mountain View 12
São Paulo 12
Tokyo 12
Aquila 11
Guangzhou 11
Jiaxing 11
Patras 11
Venezia 11
Zhengzhou 11
Brooklyn 10
Poplar 10
Rome 10
San Jose 9
Council Bluffs 8
Hefei 8
Helsinki 8
Norwalk 8
Phoenix 8
Andover 7
Changsha 7
Chennai 7
Hanoi 7
Orem 7
Rio de Janeiro 7
Tashkent 7
Turku 7
Warsaw 7
Belo Horizonte 6
Changchun 6
Curitiba 6
Denver 6
Fortaleza 6
Amsterdam 5
Boston 5
Dearborn 5
Fremont 5
Johannesburg 5
London 5
L’Aquila 5
Ningbo 5
Ankara 4
Berlin 4
Edinburgh 4
Lanzhou 4
Mexico City 4
North Bergen 4
Pescara 4
Auburn Hills 3
Basra 3
Can Tho 3
Chicago 3
Contagem 3
Erbil 3
Fairfield 3
Falls Church 3
Frankfurt am Main 3
Totale 4.436
Nome #
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract) 175
Network Movement Games 169
Simple greedy algorithms for fundamental multidimensional graph problems 162
Online Coalition Structure Generation in Graph Games 151
The Price of Envy-Freeness in Machine Scheduling 129
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 120
Approximating the Traffic Grooming Problem in Tree and Star Networks 117
Approximating the revenue maximization problem with sharp demands 116
Selfish colorful bin packing games 116
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games 115
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 114
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 113
Almost Envy-Free Allocations with Connected Bundles 113
Coalition resilient outcomes in max k-cut games 111
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 110
Stable Outcomes in Modified Fractional Hedonic Games 110
Additively separable hedonic games with social context 107
The Multi-budget Maximum Weighted Coverage Problem 106
On the Price of Stability of Fractional Hedonic Games 105
Minimizing total busy time in parallel scheduling with application to optical networks 104
Optimizing Regenerator Cost in Traffic Grooming 104
The ring design game with fair cost allocation 103
Revenue Maximization Envy-Free Pricing for Homogeneous Resources 103
Approximating the Revenue Maximization Problem with Sharp Demands. 102
Pricing Problems with Buyer Preselection 100
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 98
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 98
Optimizing regenerator cost in traffic grooming 98
Digraph k-Coloring Games: From Theory to Practice 97
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 97
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 97
On the Online Coalition Structure Generation Problem 97
Nash Stability in Fractional Hedonic Games 96
Generalized Graph k-Coloring Games 96
On the Performances of Nash Equilibria in Isolation Games 95
Generalized budgeted submodular set function maximization 95
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 94
Budget Feasible Mechanisms on Matroids 94
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 93
Improved lower bounds on the price of stability of undirected network design games. 93
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 92
On Colorful Bin Packing Games 92
Nash Social Welfare in Selfish and Online Load Balancing 92
Almost envy-free allocations with connected bundles 92
Mobile Network Creation Games 90
A 6/5-approximation algorithm for the maximum 3-cover problem. 90
On the Complexity of the Regenerator Placement Problem in Optical Networks 90
Improved lower bounds on the price of stability of undirected network design games 89
Generalized budgeted submodular set function maximization 89
Approximating the Traffic Grooming Problem in Tree and Star Networks 89
Some Anomalies of Farsighted Strategic Behavior 87
The Price of Envy-Freeness in Machine Scheduling 84
Budget Feasible Mechanisms on Matroids 84
Strategyproof mechanisms for additively separable and fractional hedonic games 84
Some Anomalies of Farsighted Strategic Behavior 83
The ring design game with fair cost allocation. 83
Hedonic games with social context 82
Traffic Grooming: Combinatorial Results and Practical Resolutions. 81
Local core stability in simple symmetric fractional hedonic games 81
Stable outcomes in modified fractional hedonic games 80
Minimizing the number of ADMs with and without Traffic Grooming: Complexity and Approximability 78
On the Complexity of the Regenerator Placement Problem in Optical Networks 77
On the performances of Nash equilibria in isolation games 76
Optimality and nash stability in additively separable generalized group activity selection problems 74
Relaxed Core Stability in Fractional Hedonic Games 72
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 69
Generalized Graph k-Coloring Games 68
Digraph k-Coloring Games: New Algorithms and Experiments 66
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation 64
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 64
Pricing Problems with Buyer Preselection 61
Totale 6.916
Categoria #
all - tutte 29.988
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 29.988


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021362 0 0 0 0 0 27 67 6 75 34 112 41
2021/2022514 30 36 99 66 28 3 11 28 24 12 34 143
2022/20231.396 105 77 41 138 95 149 3 95 629 6 37 21
2023/2024266 44 24 13 32 15 79 5 15 0 24 1 14
2024/20251.381 84 46 125 73 154 166 135 108 241 57 103 89
2025/20261.246 89 248 156 353 274 126 0 0 0 0 0 0
Totale 6.916