Monaco, Gianpiero
 Distribuzione geografica
Continente #
NA - Nord America 720
EU - Europa 617
AS - Asia 284
AF - Africa 1
Totale 1.622
Nazione #
US - Stati Uniti d'America 718
UA - Ucraina 152
CN - Cina 137
TR - Turchia 114
IE - Irlanda 89
SE - Svezia 85
IT - Italia 82
GB - Regno Unito 60
FR - Francia 39
DE - Germania 37
BE - Belgio 33
FI - Finlandia 26
IN - India 21
JP - Giappone 5
AT - Austria 4
AL - Albania 2
BG - Bulgaria 2
CA - Canada 2
IL - Israele 2
PL - Polonia 2
RU - Federazione Russa 2
AE - Emirati Arabi Uniti 1
EG - Egitto 1
GR - Grecia 1
HK - Hong Kong 1
KH - Cambogia 1
MO - Macao, regione amministrativa speciale della Cina 1
NO - Norvegia 1
TH - Thailandia 1
Totale 1.622
Città #
Jacksonville 171
Chandler 161
Dublin 89
Princeton 78
Izmir 58
Southend 48
Nanjing 41
Altamura 32
Brussels 30
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
Shenyang 7
Changsha 6
Kunming 6
Norwalk 5
Auburn Hills 4
Andover 3
Chieti 3
Francavilla al Mare 3
Grevenbroich 3
Hefei 3
Helsinki 3
Houston 3
Jinan 3
Leuven 3
Ningbo 3
Redwood City 3
Guangzhou 2
Hangzhou 2
Hanover 2
Lanzhou 2
Mountain View 2
Orange 2
Rome 2
Sofia 2
Tianjin 2
Tirana 2
Tokyo 2
Vienna 2
Warsaw 2
Bangkok 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
Islington 1
Kocaeli 1
Macao 1
Montesilvano Marina 1
Montreal 1
New York 1
Oslo 1
Paris 1
Pescara 1
Phnom Penh 1
Poplar 1
San Mateo 1
San Salvo 1
Seattle 1
Shanghai 1
Shaoxing 1
Toronto 1
Trumbull 1
Turin 1
Walnut 1
Totale 1.030
Nome #
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 73
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 68
Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation 67
null 66
Approximating the Traffic Grooming Problem in Tree and Star Networks 63
Minimizing total busy time in parallel scheduling with application to optical networks 61
Stable outcomes in modified fractional hedonic games 61
Approximating the Traffic Grooming Problem in Tree and Star Networks 59
null 59
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 56
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 54
Computing approximate nash equilibria in network congestion games with polynomially decreasing cost functions 53
Optimizing regenerator cost in traffic grooming 52
Minimizing the number of ADMs with and without traffic grooming: complexity and approximability 51
Nash Stability in Fractional Hedonic Games 51
On the impact of buyers preselection in pricing problems 48
The price of envy-freeness in machine scheduling 45
null 45
null 43
Pricing problems with buyer preselection 43
On the Performances of Nash Equilibria in Isolation Games 40
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 39
The price of envy-freeness in machine scheduling 39
null 39
Hedonic games with social context 38
Network Movement Games 37
Optimality and nash stability in additively separable generalized group activity selection problems 37
Local core stability in simple symmetric fractional hedonic games 32
null 31
Mobile Network Creation Games 30
Online coalition structure generation in graph games 30
Additively Separable Hedonic Games with Social Context 29
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 27
Relaxed Core Stability in Fractional Hedonic Games 27
Stable outcomes in modified fractional hedonic games 25
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 25
Nash Social Welfare in Selfish and Online Load Balancing 21
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 14
Digraph k-Coloring Games: From Theory to Practice 13
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 10
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 10
Generalized budgeted submodular set function maximization 10
Budget Feasible Mechanisms on Matroids 10
Approximating the Revenue Maximization Problem with Sharp Demands 9
Coalition resilient outcomes in max k-cut games 9
Almost Envy-Free Allocations with Connected Bundles 9
Approximating the revenue maximization problem with sharp demands 9
Nash Social Welfare in Selfish and Online Load Balancing (Short Paper) 7
On Colorful Bin Packing Games 7
Generalized budgeted submodular set function maximization 7
Game-Theoretic Approaches to Optimization Problems in Communication Networks 7
Nash Social Welfare in Selfish and Online Load Balancing 6
Selfish colorful bin packing games 5
Generalized Graph k-Coloring Games 4
Some Anomalies of Farsighted Strategic Behavior 4
Pricing Problems with Buyer Preselection 4
A 6/5-approximation algorithm for the maximum 3-cover problem 4
The ring design game with fair cost allocation 4
The Multi-budget Maximum Weighted Coverage Problem 4
On the Online Coalition Structure Generation Problem 4
Improved lower bounds on the price of stability of undirected network design games 3
The ring design game with fair cost allocation 3
Simple greedy algorithms for fundamental multidimensional graph problems 3
Strategyproof mechanisms for additively separable and fractional hedonic games 3
Generalized Graph k-Coloring Games 3
Budget feasible mechanisms on matroids 3
Some Anomalies of Farsighted Strategic Behavior 3
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games 3
Improved lower bounds on the price of stability of undirected network design games 2
Hedonic Games with Fixed-Size Coalitions 2
Revenue Maximization Envy-Free Pricing for Homogeneous Resources 2
Traffic Grooming: Combinatorial Results and Practical Resolutions 1
Totale 1.865
Categoria #
all - tutte 6.305
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 6.305


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019149 0 0 0 0 54 3 28 0 1 1 0 62
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/2023669 52 55 14 47 70 134 85 59 97 8 41 7
2023/2024103 21 34 48 0 0 0 0 0 0 0 0 0
Totale 1.865