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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020317 118 23 0 9 21 10 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/202560 60 0 0 0 0 0 0 0 0 0 0 0
Totale 2.254