Monaco, Gianpiero
 Distribuzione geografica
Continente #
NA - Nord America 1.468
AS - Asia 1.299
EU - Europa 902
SA - Sud America 123
AF - Africa 16
Totale 3.808
Nazione #
US - Stati Uniti d'America 1.441
SG - Singapore 493
CN - Cina 461
IE - Irlanda 196
IT - Italia 155
UA - Ucraina 153
TR - Turchia 122
BR - Brasile 102
SE - Svezia 93
GB - Regno Unito 76
KR - Corea 63
DE - Germania 51
FR - Francia 42
IN - India 40
RU - Federazione Russa 39
VN - Vietnam 37
FI - Finlandia 32
HK - Hong Kong 31
CA - Canada 15
JP - Giappone 15
AT - Austria 14
PL - Polonia 13
AR - Argentina 11
ES - Italia 11
MX - Messico 11
ZA - Sudafrica 10
BE - Belgio 9
BD - Bangladesh 8
EC - Ecuador 6
IQ - Iraq 6
IL - Israele 5
CH - Svizzera 3
NL - Olanda 3
AL - Albania 2
AZ - Azerbaigian 2
BG - Bulgaria 2
LT - Lituania 2
PK - Pakistan 2
RO - Romania 2
TH - Thailandia 2
UZ - Uzbekistan 2
AE - Emirati Arabi Uniti 1
AO - Angola 1
BH - Bahrain 1
BW - Botswana 1
CO - Colombia 1
DK - Danimarca 1
DO - Repubblica Dominicana 1
EE - Estonia 1
EG - Egitto 1
GR - Grecia 1
GY - Guiana 1
KE - Kenya 1
KG - Kirghizistan 1
KH - Cambogia 1
KZ - Kazakistan 1
LB - Libano 1
MA - Marocco 1
MO - Macao, regione amministrativa speciale della Cina 1
NO - Norvegia 1
PS - Palestinian Territory 1
PY - Paraguay 1
SA - Arabia Saudita 1
SY - Repubblica araba siriana 1
TN - Tunisia 1
VE - Venezuela 1
Totale 3.808
Città #
Singapore 343
Dublin 196
Jacksonville 171
Chandler 161
Ashburn 160
Beijing 120
Dallas 104
Hefei 85
Princeton 78
Seoul 63
Los Angeles 62
Izmir 58
Southend 48
Santa Clara 44
Nanjing 41
Tongling 39
The Dalles 35
Altamura 32
Hong Kong 25
Cambridge 23
Wilmington 23
Redondo Beach 21
Buffalo 20
Ho Chi Minh City 20
Boardman 19
Dearborn 19
Pescara 19
Washington 19
New York 17
Ann Arbor 16
Chennai 13
Nanchang 13
Warsaw 13
Hebei 11
Woodbridge 11
Seattle 9
Atlanta 8
Francavilla Al Mare 8
Jiaxing 8
Stockholm 8
São Paulo 8
Tokyo 8
Brooklyn 7
Hanoi 7
Helsinki 7
Nuremberg 7
Rome 7
San Francisco 7
Shenyang 7
Vienna 7
Brussels 6
Changsha 6
Chicago 6
Chieti 6
Johannesburg 6
Kunming 6
Mexico City 6
Perugia 6
Pune 6
Clifton 5
Florence 5
L’Aquila 5
Montreal 5
Norwalk 5
Ankara 4
Auburn Hills 4
Boston 4
New Delhi 4
Rio de Janeiro 4
Treviso 4
Andover 3
Council Bluffs 3
Francavilla al Mare 3
Getafe 3
Grevenbroich 3
Houston 3
Jinan 3
Leuven 3
Lexington 3
London 3
Ningbo 3
North Bergen 3
Phoenix 3
Poplar 3
Potsdam 3
Recife 3
Redwood City 3
Secaucus 3
Shanghai 3
Tianjin 3
Araxá 2
Baghdad 2
Baku 2
Bangkok 2
Belo Horizonte 2
Biên Hòa 2
Brasília 2
Changchun 2
Chapecó 2
Contagem 2
Totale 2.438
Nome #
Approximating the Traffic Grooming Problem in Tree and Star Networks 131
Approximating the Traffic Grooming Problem in Tree and Star Networks 118
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 111
AI for Sustainability: Research at Ud’A Node 104
Stable outcomes in modified fractional hedonic games 98
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 97
Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation 94
Computing approximate nash equilibria in network congestion games with polynomially decreasing cost functions 91
Minimizing total busy time in parallel scheduling with application to optical networks 90
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 84
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 81
Optimizing regenerator cost in traffic grooming 79
Minimizing the number of ADMs with and without traffic grooming: complexity and approximability 78
On the Performances of Nash Equilibria in Isolation Games 73
The price of envy-freeness in machine scheduling 73
On the complexity of the regenerator placement problem in optical networks 71
Pricing problems with buyer preselection 70
Additively Separable Hedonic Games with Social Context 70
Stable outcomes in modified fractional hedonic games 69
The price of envy-freeness in machine scheduling 68
Local core stability in simple symmetric fractional hedonic games 68
null 66
On the impact of buyers preselection in pricing problems 65
Nash Stability in Fractional Hedonic Games 63
Hedonic games with social context 63
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 63
Network Movement Games 62
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 60
On the complexity of the regenerator placement problem in optical networks 60
null 60
null 59
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 58
Optimality and nash stability in additively separable generalized group activity selection problems 58
Online coalition structure generation in graph games 54
Mobile Network Creation Games 52
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 50
Budget Feasible Mechanisms on Matroids 50
Nash Social Welfare in Selfish and Online Load Balancing 47
Approximating the revenue maximization problem with sharp demands 43
null 43
The Multi-budget Maximum Weighted Coverage Problem 43
Nash Social Welfare in Selfish and Online Load Balancing 40
Almost Envy-Free Allocations with Connected Bundles 40
Improved lower bounds on the price of stability of undirected network design games 39
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing 38
Pricing Problems with Buyer Preselection 38
A 6/5-approximation algorithm for the maximum 3-cover problem 38
On the Online Coalition Structure Generation Problem 38
On Colorful Bin Packing Games 37
Digraph k-Coloring Games: From Theory to Practice 37
Coalition resilient outcomes in max k-cut games 36
Nash Social Welfare in Selfish and Online Load Balancing (Short Paper) 34
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 34
Generalized budgeted submodular set function maximization 34
Selfish colorful bin packing games 34
Some Anomalies of Farsighted Strategic Behavior 33
Approximating the Revenue Maximization Problem with Sharp Demands 32
Almost envy-free allocations with connected bundles 32
The ring design game with fair cost allocation 31
Digraph k-Coloring Games: New Algorithms and Experiments 31
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 31
null 31
Hedonic Games with Fixed-Size Coalitions 31
Generalized Graph k-Coloring Games 30
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions 28
Generalized budgeted submodular set function maximization 28
Game-Theoretic Approaches to Optimization Problems in Communication Networks 28
Budget feasible mechanisms on matroids 27
Strategyproof mechanisms for additively separable and fractional hedonic games 24
Relaxed Core Stability in Fractional Hedonic Games 23
null 21
Existence, Computation and Efficiency of Nash Stable Outcomes in Hedonic Skill Games 21
Simple greedy algorithms for fundamental multidimensional graph problems 20
Some Anomalies of Farsighted Strategic Behavior 19
null 18
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games 16
Improved lower bounds on the price of stability of undirected network design games 15
The ring design game with fair cost allocation 15
Traffic Grooming: Combinatorial Results and Practical Resolutions 15
Generalized Graph k-Coloring Games 13
Nash Stability in Hedonic Skill Games 13
Revenue Maximization Envy-Free Pricing for Homogeneous Resources 13
Relaxed core stability in hedonic games 4
Totale 4.097
Categoria #
all - tutte 22.037
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 22.037


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021103 0 0 0 0 0 38 3 9 14 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/20261.053 268 186 211 233 130 25 0 0 0 0 0 0
Totale 4.097