Monaco, Gianpiero
 Distribuzione geografica
Continente #
NA - Nord America 2.292
AS - Asia 1.714
EU - Europa 1.103
SA - Sud America 157
AF - Africa 27
OC - Oceania 1
Totale 5.294
Nazione #
US - Stati Uniti d'America 2.243
SG - Singapore 671
CN - Cina 502
IT - Italia 209
IE - Irlanda 197
UA - Ucraina 156
RU - Federazione Russa 148
BR - Brasile 124
TR - Turchia 124
VN - Vietnam 115
SE - Svezia 94
GB - Regno Unito 84
KR - Corea 64
BD - Bangladesh 54
DE - Germania 54
IN - India 54
FR - Francia 48
HK - Hong Kong 45
FI - Finlandia 33
JP - Giappone 25
CA - Canada 24
AR - Argentina 16
MX - Messico 16
ES - Italia 15
PL - Polonia 15
AT - Austria 14
IQ - Iraq 12
ZA - Sudafrica 12
BE - Belgio 10
EC - Ecuador 8
IL - Israele 8
NL - Olanda 7
PH - Filippine 5
PK - Pakistan 5
TN - Tunisia 5
CO - Colombia 4
TH - Thailandia 4
UZ - Uzbekistan 4
CH - Svizzera 3
RO - Romania 3
SA - Arabia Saudita 3
TW - Taiwan 3
AL - Albania 2
AO - Angola 2
AZ - Azerbaigian 2
BA - Bosnia-Erzegovina 2
BG - Bulgaria 2
CR - Costa Rica 2
ID - Indonesia 2
JM - Giamaica 2
KE - Kenya 2
LT - Lituania 2
MA - Marocco 2
VE - Venezuela 2
AE - Emirati Arabi Uniti 1
AU - Australia 1
BH - Bahrain 1
BW - Botswana 1
DK - Danimarca 1
DO - Repubblica Dominicana 1
EE - Estonia 1
EG - Egitto 1
ET - Etiopia 1
GR - Grecia 1
GY - Guiana 1
HN - Honduras 1
JO - Giordania 1
KG - Kirghizistan 1
KH - Cambogia 1
KZ - Kazakistan 1
LB - Libano 1
LK - Sri Lanka 1
MO - Macao, regione amministrativa speciale della Cina 1
NI - Nicaragua 1
NO - Norvegia 1
NP - Nepal 1
PA - Panama 1
PE - Perù 1
PR - Porto Rico 1
PS - Palestinian Territory 1
PY - Paraguay 1
SI - Slovenia 1
SN - Senegal 1
SY - Repubblica araba siriana 1
Totale 5.294
Città #
San Jose 504
Singapore 433
Ashburn 235
Dublin 197
Jacksonville 171
Chandler 161
Beijing 122
Dallas 108
Hefei 85
Princeton 78
Los Angeles 69
Seoul 64
Izmir 58
Santa Clara 51
Southend 48
Council Bluffs 47
Ho Chi Minh City 46
Nanjing 41
Tongling 39
The Dalles 35
Hong Kong 33
Altamura 32
New York 31
Pescara 27
Hanoi 24
Cambridge 23
Wilmington 23
Buffalo 22
Redondo Beach 21
Boardman 19
Dearborn 19
Washington 19
Chennai 18
Tokyo 18
Rome 17
Ann Arbor 16
Orem 16
Warsaw 15
Nanchang 13
Chicago 11
Hebei 11
Woodbridge 11
Moscow 10
Seattle 10
Atlanta 9
San Francisco 9
Stockholm 9
São Paulo 9
Brooklyn 8
Chieti 8
Da Nang 8
Francavilla Al Mare 8
Jiaxing 8
Montreal 8
Phoenix 8
St Louis 8
Brussels 7
Helsinki 7
Mexico City 7
Nuremberg 7
Shenyang 7
Vienna 7
Baghdad 6
Changsha 6
Des Moines 6
Florence 6
Johannesburg 6
Kunming 6
New Delhi 6
Perugia 6
Pune 6
Clifton 5
Houston 5
L’Aquila 5
Manchester 5
Norwalk 5
Amsterdam 4
Ankara 4
Auburn Hills 4
Boston 4
Concord 4
Denver 4
London 4
Noida 4
Rio de Janeiro 4
Tashkent 4
Treviso 4
Andover 3
Biên Hòa 3
Brescia 3
Erbil 3
Francavilla al Mare 3
Getafe 3
Grevenbroich 3
Hangzhou 3
Jinan 3
Leganés 3
Leuven 3
Lexington 3
Milan 3
Totale 3.355
Nome #
Approximating the Traffic Grooming Problem in Tree and Star Networks 160
AI for Sustainability: Research at Ud’A Node 158
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 143
Approximating the Traffic Grooming Problem in Tree and Star Networks 137
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 126
Stable outcomes in modified fractional hedonic games 116
Computing approximate nash equilibria in network congestion games with polynomially decreasing cost functions 112
Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation 109
Minimizing total busy time in parallel scheduling with application to optical networks 101
Additively Separable Hedonic Games with Social Context 99
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 96
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 96
Local core stability in simple symmetric fractional hedonic games 95
Optimizing regenerator cost in traffic grooming 92
The price of envy-freeness in machine scheduling 90
Minimizing the number of ADMs with and without traffic grooming: complexity and approximability 89
Pricing problems with buyer preselection 86
Stable outcomes in modified fractional hedonic games 86
On the complexity of the regenerator placement problem in optical networks 85
On the Performances of Nash Equilibria in Isolation Games 84
The price of envy-freeness in machine scheduling 83
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 81
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 80
Coalition resilient outcomes in max k-cut games 77
Optimality and nash stability in additively separable generalized group activity selection problems 77
Hedonic games with social context 77
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 76
On the complexity of the regenerator placement problem in optical networks 76
On Colorful Bin Packing Games 74
On the impact of buyers preselection in pricing problems 74
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 74
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 73
Mobile Network Creation Games 73
Network Movement Games 73
Nash Stability in Fractional Hedonic Games 72
Online coalition structure generation in graph games 72
Improved lower bounds on the price of stability of undirected network design games 69
The Multi-budget Maximum Weighted Coverage Problem 68
null 66
Pricing Problems with Buyer Preselection 65
Nash Social Welfare in Selfish and Online Load Balancing 63
Approximating the revenue maximization problem with sharp demands 62
Budget Feasible Mechanisms on Matroids 62
On the Online Coalition Structure Generation Problem 62
Nash Social Welfare in Selfish and Online Load Balancing 61
Almost Envy-Free Allocations with Connected Bundles 60
A 6/5-approximation algorithm for the maximum 3-cover problem 60
null 60
Existence, Computation and Efficiency of Nash Stable Outcomes in Hedonic Skill Games 60
Nash Social Welfare in Selfish and Online Load Balancing (Short Paper) 59
Approximating the Revenue Maximization Problem with Sharp Demands 59
null 59
Digraph k-Coloring Games: New Algorithms and Experiments 57
Budget feasible mechanisms on matroids 56
Almost envy-free allocations with connected bundles 55
Generalized Graph k-Coloring Games 52
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing 51
Selfish colorful bin packing games 51
Some Anomalies of Farsighted Strategic Behavior 51
Digraph k-Coloring Games: From Theory to Practice 50
Generalized budgeted submodular set function maximization 48
Hedonic Games with Fixed-Size Coalitions 48
Strategyproof mechanisms for additively separable and fractional hedonic games 45
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 44
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions 43
The ring design game with fair cost allocation 43
null 43
Generalized budgeted submodular set function maximization 39
Game-Theoretic Approaches to Optimization Problems in Communication Networks 38
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games 38
Generalized Graph k-Coloring Games 33
Some Anomalies of Farsighted Strategic Behavior 33
Nash Stability in Hedonic Skill Games 32
Relaxed Core Stability in Fractional Hedonic Games 32
Relaxed core stability in hedonic games 31
null 31
The ring design game with fair cost allocation 30
Simple greedy algorithms for fundamental multidimensional graph problems 29
Improved lower bounds on the price of stability of undirected network design games 26
Traffic Grooming: Combinatorial Results and Practical Resolutions 24
null 21
Revenue Maximization Envy-Free Pricing for Homogeneous Resources 19
null 18
Compensate to Not Deviate: On Subsidised Equilibria 8
Totale 5.586
Categoria #
all - tutte 26.967
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 26.967


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022175 2 2 30 13 13 3 1 10 14 2 38 47
2022/2023644 52 55 14 47 70 134 80 45 96 6 38 7
2023/2024457 19 32 48 11 44 120 81 15 6 34 11 36
2024/2025850 63 127 73 26 36 31 54 54 89 49 125 123
2025/20262.519 268 186 211 233 130 97 454 160 174 241 214 151
2026/202723 23 0 0 0 0 0 0 0 0 0 0 0
Totale 5.586