IRIS
MONACO, GIANPIERO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.664
EU - Europa 2.043
AS - Asia 1.981
SA - Sud America 228
AF - Africa 26
OC - Oceania 6
Continente sconosciuto - Info sul continente non disponibili 3
Totale 7.951
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.608
SG - Singapore 861
IE - Irlanda 524
CN - Cina 514
RU - Federazione Russa 377
SE - Svezia 305
IT - Italia 214
TR - Turchia 202
BR - Brasile 200
DE - Germania 168
VN - Vietnam 165
GB - Regno Unito 138
UA - Ucraina 114
HK - Hong Kong 98
FR - Francia 69
FI - Finlandia 59
CA - Canada 26
JP - Giappone 23
MX - Messico 21
IN - India 20
BD - Bangladesh 18
IQ - Iraq 18
GR - Grecia 14
NL - Olanda 14
BE - Belgio 13
IL - Israele 11
ES - Italia 10
UZ - Uzbekistan 9
PL - Polonia 8
EC - Ecuador 7
AR - Argentina 6
NP - Nepal 6
ZA - Sudafrica 6
AT - Austria 4
AU - Australia 4
MA - Marocco 4
PH - Filippine 4
PK - Pakistan 4
SA - Arabia Saudita 4
CL - Cile 3
EG - Egitto 3
EU - Europa 3
ID - Indonesia 3
IR - Iran 3
KE - Kenya 3
KR - Corea 3
TN - Tunisia 3
UY - Uruguay 3
BO - Bolivia 2
CH - Svizzera 2
CI - Costa d'Avorio 2
CR - Costa Rica 2
DO - Repubblica Dominicana 2
EE - Estonia 2
HU - Ungheria 2
JM - Giamaica 2
LT - Lituania 2
MY - Malesia 2
NZ - Nuova Zelanda 2
PE - Perù 2
PS - Palestinian Territory 2
PY - Paraguay 2
VE - Venezuela 2
AE - Emirati Arabi Uniti 1
AZ - Azerbaigian 1
BH - Bahrain 1
BJ - Benin 1
BN - Brunei Darussalam 1
CO - Colombia 1
CU - Cuba 1
DZ - Algeria 1
ET - Etiopia 1
GE - Georgia 1
GP - Guadalupe 1
HR - Croazia 1
JO - Giordania 1
KG - Kirghizistan 1
KH - Cambogia 1
LU - Lussemburgo 1
LY - Libia 1
MN - Mongolia 1
NI - Nicaragua 1
OM - Oman 1
RO - Romania 1
SI - Slovenia 1
SN - Senegal 1
YE - Yemen 1
Totale 7.951
Salva come PNG Salva come JPEG
Città #
Dublin 520
Singapore 517
Chandler 500
Jacksonville 447
San Jose 358
Dallas 261
Ashburn 206
Santa Clara 170
Boardman 138
Izmir 107
The Dalles 97
Hong Kong 96
Nanjing 95
Moscow 86
New York 79
Beijing 73
Lawrence 68
Princeton 68
San Mateo 66
Wilmington 64
Ann Arbor 59
Council Bluffs 59
Los Angeles 52
Woodbridge 48
Ho Chi Minh City 46
Nanchang 43
Hanoi 40
Milan 40
L'aquila 38
Lauterbourg 32
Hangzhou 30
Columbus 29
Seattle 29
Munich 27
Houston 26
Des Moines 25
Shanghai 25
Kunming 22
Shenyang 22
Jinan 21
Tokyo 20
Stockholm 19
Tianjin 16
Verona 16
Hebei 14
Montreal 14
Orem 14
Atlanta 13
Brussels 13
Frankfurt am Main 13
Rome 13
São Paulo 13
Dong Ket 12
Mountain View 12
Aquila 11
Brooklyn 11
Guangzhou 11
Jiaxing 11
Patras 11
Venezia 11
Zhengzhou 11
Poplar 10
Amsterdam 9
Tashkent 9
Chennai 8
Hefei 8
Helsinki 8
Norwalk 8
Phoenix 8
Andover 7
Changsha 7
Denver 7
Fortaleza 7
Rio de Janeiro 7
San Francisco 7
Turku 7
Warsaw 7
Belo Horizonte 6
Biên Hòa 6
Changchun 6
Curitiba 6
Manchester 6
Boston 5
Dearborn 5
Fremont 5
Johannesburg 5
Lappeenranta 5
London 5
L’Aquila 5
Ningbo 5
Ankara 4
Berlin 4
Chicago 4
Da Nang 4
Edinburgh 4
Erbil 4
Haiphong 4
Lanzhou 4
Mexico City 4
Miami 4
Totale 5.242
Salva come PNG Salva come JPEG
Nome #
Network Movement Games 197
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract) 188
Simple greedy algorithms for fundamental multidimensional graph problems 184
Online Coalition Structure Generation in Graph Games 171
The Price of Envy-Freeness in Machine Scheduling 145
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 143
Additively separable hedonic games with social context 143
Approximating the revenue maximization problem with sharp demands 138
Almost Envy-Free Allocations with Connected Bundles 138
Selfish colorful bin packing games 135
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games 135
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 133
The Multi-budget Maximum Weighted Coverage Problem 131
Digraph k-Coloring Games: From Theory to Practice 129
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 127
Coalition resilient outcomes in max k-cut games 127
Approximating the Traffic Grooming Problem in Tree and Star Networks 127
Minimizing total busy time in parallel scheduling with application to optical networks 126
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 125
Optimizing Regenerator Cost in Traffic Grooming 123
Stable Outcomes in Modified Fractional Hedonic Games 122
On the Price of Stability of Fractional Hedonic Games 121
Approximating the Revenue Maximization Problem with Sharp Demands. 120
Pricing Problems with Buyer Preselection 119
Mobile Network Creation Games 116
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 114
The ring design game with fair cost allocation 113
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 113
On the Performances of Nash Equilibria in Isolation Games 113
Generalized Graph k-Coloring Games 113
On Colorful Bin Packing Games 112
Nash Social Welfare in Selfish and Online Load Balancing 112
On the Online Coalition Structure Generation Problem 112
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 111
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 111
Nash Stability in Fractional Hedonic Games 111
Almost envy-free allocations with connected bundles 111
Improved lower bounds on the price of stability of undirected network design games 110
Revenue Maximization Envy-Free Pricing for Homogeneous Resources 110
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 109
Optimizing regenerator cost in traffic grooming 109
Local core stability in simple symmetric fractional hedonic games 107
Generalized budgeted submodular set function maximization 107
Budget Feasible Mechanisms on Matroids 106
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 105
Budget Feasible Mechanisms on Matroids 105
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 104
Improved lower bounds on the price of stability of undirected network design games. 104
Strategyproof mechanisms for additively separable and fractional hedonic games 104
The Price of Envy-Freeness in Machine Scheduling 103
A 6/5-approximation algorithm for the maximum 3-cover problem. 102
On the Complexity of the Regenerator Placement Problem in Optical Networks 101
Some Anomalies of Farsighted Strategic Behavior 100
Approximating the Traffic Grooming Problem in Tree and Star Networks 99
Hedonic games with social context 99
Some Anomalies of Farsighted Strategic Behavior 98
Generalized budgeted submodular set function maximization 98
Stable outcomes in modified fractional hedonic games 95
On the performances of Nash equilibria in isolation games 94
The ring design game with fair cost allocation. 93
Traffic Grooming: Combinatorial Results and Practical Resolutions. 92
Optimality and nash stability in additively separable generalized group activity selection problems 91
Minimizing the number of ADMs with and without Traffic Grooming: Complexity and Approximability 91
On the Complexity of the Regenerator Placement Problem in Optical Networks 89
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 88
Relaxed Core Stability in Fractional Hedonic Games 84
Digraph k-Coloring Games: New Algorithms and Experiments 84
Pricing Problems with Buyer Preselection 82
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 81
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation 80
Generalized Graph k-Coloring Games 80
Totale 8.113
Salva come PNG Salva come JPEG
Categoria #
all - tutte 32.579
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 32.579
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021153 0 0 0 0 0 0 0 0 0 0 112 41
2021/2022514 30 36 99 66 28 3 11 28 24 12 34 143
2022/20231.396 105 77 41 138 95 149 3 95 629 6 37 21
2023/2024266 44 24 13 32 15 79 5 15 0 24 1 14
2024/20251.381 84 46 125 73 154 166 135 108 241 57 103 89
2025/20262.443 89 248 156 353 274 192 392 67 206 357 109 0
Totale 8.113