Monaco, Gianpiero
 Distribuzione geografica
Continente #
NA - Nord America 1.027
EU - Europa 775
AS - Asia 498
AF - Africa 1
Totale 2.301
Nazione #
US - Stati Uniti d'America 1.023
IE - Irlanda 196
CN - Cina 169
SG - Singapore 166
UA - Ucraina 152
TR - Turchia 114
IT - Italia 100
SE - Svezia 85
GB - Regno Unito 63
DE - Germania 44
FR - Francia 39
RU - Federazione Russa 34
FI - Finlandia 30
IN - India 27
BE - Belgio 9
JP - Giappone 9
AT - Austria 6
CA - Canada 4
HK - Hong Kong 4
CH - Svizzera 3
ES - Italia 3
IL - Israele 3
AL - Albania 2
BG - Bulgaria 2
PL - Polonia 2
RO - Romania 2
TH - Thailandia 2
AE - Emirati Arabi Uniti 1
EG - Egitto 1
GR - Grecia 1
KG - Kirghizistan 1
KH - Cambogia 1
LT - Lituania 1
MO - Macao, regione amministrativa speciale della Cina 1
NO - Norvegia 1
Totale 2.301
Città #
Dublin 196
Jacksonville 171
Chandler 161
Singapore 123
Ashburn 110
Princeton 78
Izmir 58
Southend 48
Nanjing 41
Santa Clara 35
Altamura 32
Los Angeles 29
Cambridge 23
Wilmington 23
Beijing 21
Boardman 19
Dearborn 19
Washington 19
Ann Arbor 16
Nanchang 13
Hebei 11
Woodbridge 11
Chennai 10
Francavilla Al Mare 8
Jiaxing 8
Seattle 8
Helsinki 7
Shenyang 7
Brussels 6
Changsha 6
Kunming 6
Pune 6
Clifton 5
Norwalk 5
Pescara 5
Rome 5
Auburn Hills 4
Vienna 4
Andover 3
Chieti 3
Francavilla al Mare 3
Getafe 3
Grevenbroich 3
Hefei 3
Houston 3
Jinan 3
Leuven 3
Lexington 3
L’Aquila 3
New York 3
Ningbo 3
North Bergen 3
Nuremberg 3
Redwood City 3
Shanghai 3
Tianjin 3
Bangkok 2
Changchun 2
Fuzhou 2
Guangzhou 2
Hangzhou 2
Hanover 2
Lanzhou 2
Lausanne 2
Minatomirai 2
Mountain View 2
Orange 2
Osaka 2
Potsdam 2
Romola 2
Sofia 2
Stanford 2
Tirana 2
Tokyo 2
Toronto 2
Warsaw 2
Bishkek 1
Brockton 1
Cairo 1
Canary Wharf 1
Cantù 1
Central 1
Dallas 1
Dongguan 1
Dubai 1
Edinburgh 1
Fairfield 1
Florence 1
Frankfurt am Main 1
Fukuoka 1
Guiyang 1
Holon 1
Islington 1
Kocaeli 1
London 1
Macao 1
Milan 1
Montesilvano Marina 1
Montreal 1
Naples 1
Totale 1.475
Nome #
Approximating the Traffic Grooming Problem in Tree and Star Networks 93
Approximating the Traffic Grooming Problem in Tree and Star Networks 89
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 86
Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation 80
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 80
Stable outcomes in modified fractional hedonic games 77
Minimizing total busy time in parallel scheduling with application to optical networks 72
null 66
Computing approximate nash equilibria in network congestion games with polynomially decreasing cost functions 64
Minimizing the number of ADMs with and without traffic grooming: complexity and approximability 62
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 61
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 61
null 59
Optimizing regenerator cost in traffic grooming 58
null 58
On the impact of buyers preselection in pricing problems 55
The price of envy-freeness in machine scheduling 54
On the complexity of the regenerator placement problem in optical networks 54
Nash Stability in Fractional Hedonic Games 53
Pricing problems with buyer preselection 53
Hedonic games with social context 50
On the Performances of Nash Equilibria in Isolation Games 48
The price of envy-freeness in machine scheduling 47
On the complexity of the regenerator placement problem in optical networks 47
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 46
Network Movement Games 46
Local core stability in simple symmetric fractional hedonic games 46
Optimality and nash stability in additively separable generalized group activity selection problems 46
null 43
Stable outcomes in modified fractional hedonic games 43
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 42
Additively Separable Hedonic Games with Social Context 42
Mobile Network Creation Games 40
Online coalition structure generation in graph games 38
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 38
null 31
Nash Social Welfare in Selfish and Online Load Balancing 29
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 29
Budget Feasible Mechanisms on Matroids 24
Approximating the revenue maximization problem with sharp demands 21
On Colorful Bin Packing Games 19
Generalized budgeted submodular set function maximization 19
Almost Envy-Free Allocations with Connected Bundles 18
Generalized budgeted submodular set function maximization 18
Improved lower bounds on the price of stability of undirected network design games 17
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 17
Selfish colorful bin packing games 17
Digraph k-Coloring Games: From Theory to Practice 17
Pricing Problems with Buyer Preselection 16
Approximating the Revenue Maximization Problem with Sharp Demands 15
Coalition resilient outcomes in max k-cut games 15
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 15
A 6/5-approximation algorithm for the maximum 3-cover problem 15
Some Anomalies of Farsighted Strategic Behavior 15
Game-Theoretic Approaches to Optimization Problems in Communication Networks 15
Nash Social Welfare in Selfish and Online Load Balancing (Short Paper) 14
Almost envy-free allocations with connected bundles 14
Nash Social Welfare in Selfish and Online Load Balancing 14
Generalized Graph k-Coloring Games 13
The Multi-budget Maximum Weighted Coverage Problem 13
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions 12
Budget feasible mechanisms on matroids 12
The ring design game with fair cost allocation 11
Some Anomalies of Farsighted Strategic Behavior 9
Simple greedy algorithms for fundamental multidimensional graph problems 7
Generalized Graph k-Coloring Games 7
On the Online Coalition Structure Generation Problem 7
Strategyproof mechanisms for additively separable and fractional hedonic games 6
The ring design game with fair cost allocation 6
Improved lower bounds on the price of stability of undirected network design games 5
AI for Sustainability: Research at Ud’A Node 5
Hedonic Games with Fixed-Size Coalitions 5
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games 5
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing 4
Digraph k-Coloring Games: New Algorithms and Experiments 4
Traffic Grooming: Combinatorial Results and Practical Resolutions 4
Revenue Maximization Envy-Free Pricing for Homogeneous Resources 3
Nash Stability in Hedonic Skill Games 1
Totale 2.560
Categoria #
all - tutte 14.849
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 14.849


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020136 0 0 0 0 0 0 55 29 4 10 35 3
2020/2021195 27 2 32 3 28 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/2025366 63 127 73 26 36 31 10 0 0 0 0 0
Totale 2.560