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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202139 0 0 0 0 0 0 0 0 0 33 2 4
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.082 268 186 211 233 130 97 454 160 174 169 0 0
Totale 5.126