IRIS
MONACO, GIANPIERO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.370
EU - Europa 1.645
AS - Asia 1.134
SA - Sud America 120
AF - Africa 10
OC - Oceania 6
Continente sconosciuto - Info sul continente non disponibili 3
Totale 5.288
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.365
IE - Irlanda 521
CN - Cina 433
SG - Singapore 386
SE - Svezia 287
IT - Italia 204
TR - Turchia 193
RU - Federazione Russa 169
DE - Germania 135
BR - Brasile 114
UA - Ucraina 111
GB - Regno Unito 102
HK - Hong Kong 73
FI - Finlandia 45
FR - Francia 29
GR - Grecia 14
BE - Belgio 13
VN - Vietnam 12
IL - Israele 6
IQ - Iraq 6
UZ - Uzbekistan 5
AU - Australia 4
IN - India 4
NL - Olanda 4
CA - Canada 3
EU - Europa 3
IR - Iran 3
JP - Giappone 3
MA - Marocco 3
AT - Austria 2
BD - Bangladesh 2
EC - Ecuador 2
EE - Estonia 2
EG - Egitto 2
ES - Italia 2
KE - Kenya 2
MX - Messico 2
NZ - Nuova Zelanda 2
AE - Emirati Arabi Uniti 1
AR - Argentina 1
BN - Brunei Darussalam 1
CH - Svizzera 1
DZ - Algeria 1
GE - Georgia 1
HU - Ungheria 1
KG - Kirghizistan 1
LU - Lussemburgo 1
NP - Nepal 1
OM - Oman 1
PE - Perù 1
PK - Pakistan 1
PS - Palestinian Territory 1
PY - Paraguay 1
RO - Romania 1
SI - Slovenia 1
TN - Tunisia 1
UY - Uruguay 1
ZA - Sudafrica 1
Totale 5.288
Salva come PNG Salva come JPEG
Città #
Dublin 517
Chandler 500
Jacksonville 447
Singapore 244
Santa Clara 156
Boardman 138
Izmir 107
Nanjing 95
Hong Kong 72
Lawrence 68
Princeton 68
San Mateo 66
Wilmington 64
Ann Arbor 59
Beijing 48
New York 48
Woodbridge 48
Moscow 46
Nanchang 43
Milan 39
L'aquila 38
Ashburn 33
Hangzhou 30
Seattle 26
Des Moines 24
Shanghai 23
Kunming 22
Los Angeles 22
Shenyang 22
Houston 21
Jinan 21
The Dalles 18
Tianjin 16
Verona 16
Hebei 14
Brussels 13
Dong Ket 12
Mountain View 12
Aquila 11
Guangzhou 11
Jiaxing 11
Munich 11
Patras 11
Venezia 11
Zhengzhou 11
Council Bluffs 8
Norwalk 8
Rome 8
Andover 7
Changsha 7
Changchun 6
Dallas 6
Helsinki 6
São Paulo 6
Dearborn 5
Fremont 5
L’Aquila 5
Ningbo 5
Tashkent 5
Atlanta 4
Belo Horizonte 4
Berlin 4
Edinburgh 4
Lanzhou 4
North Bergen 4
Pescara 4
Auburn Hills 3
Basra 3
Contagem 3
Curitiba 3
Fairfield 3
Falls Church 3
Grafing 3
Lequile 3
Phoenix 3
Rio de Janeiro 3
San Jose 3
Taizhou 3
Bauru 2
Cairo 2
Canoas 2
Chicago 2
Chieti 2
Duque de Caxias 2
Düsseldorf 2
Edmonton 2
Fortaleza 2
Frankfurt am Main 2
Jerusalem 2
Kocaeli 2
Madrid 2
Melbourne 2
Nairobi 2
Patrocínio 2
Pinheiro 2
Porto Alegre 2
Silvi 2
Sobral 2
Sydney 2
São José 2
Totale 3.528
Salva come PNG Salva come JPEG
Nome #
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract) 147
Network Movement Games 140
Simple greedy algorithms for fundamental multidimensional graph problems 133
Online Coalition Structure Generation in Graph Games 118
The Price of Envy-Freeness in Machine Scheduling 116
Stable Outcomes in Modified Fractional Hedonic Games 104
Approximating the Traffic Grooming Problem in Tree and Star Networks 104
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 99
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 96
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem 93
Revenue Maximization Envy-Free Pricing for Homogeneous Resources 93
The ring design game with fair cost allocation 91
Optimizing Regenerator Cost in Traffic Grooming 91
Coalition resilient outcomes in max k-cut games 90
On the Price of Stability of Fractional Hedonic Games 90
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games 90
Minimizing total busy time in parallel scheduling with application to optical networks 87
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 87
On the Performances of Nash Equilibria in Isolation Games 87
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 86
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 86
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 86
Optimizing regenerator cost in traffic grooming 85
Almost Envy-Free Allocations with Connected Bundles 84
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 82
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 82
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 81
Approximating the revenue maximization problem with sharp demands 81
Improved lower bounds on the price of stability of undirected network design games 80
Approximating the Revenue Maximization Problem with Sharp Demands. 80
Budget Feasible Mechanisms on Matroids 80
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 79
Improved lower bounds on the price of stability of undirected network design games. 79
Nash Stability in Fractional Hedonic Games 79
Generalized budgeted submodular set function maximization 78
Approximating the Traffic Grooming Problem in Tree and Star Networks 77
On the Complexity of the Regenerator Placement Problem in Optical Networks 76
A 6/5-approximation algorithm for the maximum 3-cover problem. 75
Pricing Problems with Buyer Preselection 75
The Price of Envy-Freeness in Machine Scheduling 73
Some Anomalies of Farsighted Strategic Behavior 73
The ring design game with fair cost allocation. 72
Selfish colorful bin packing games 70
The Multi-budget Maximum Weighted Coverage Problem 70
Some Anomalies of Farsighted Strategic Behavior 69
Traffic Grooming: Combinatorial Results and Practical Resolutions. 68
Mobile Network Creation Games 68
On the performances of Nash equilibria in isolation games 68
On Colorful Bin Packing Games 68
On the Complexity of the Regenerator Placement Problem in Optical Networks 66
Hedonic games with social context 66
Generalized Graph k-Coloring Games 64
Minimizing the number of ADMs with and without Traffic Grooming: Complexity and Approximability 63
Strategyproof mechanisms for additively separable and fractional hedonic games 63
Generalized Graph k-Coloring Games 60
Budget Feasible Mechanisms on Matroids 59
Digraph k-Coloring Games: From Theory to Practice 58
Additively separable hedonic games with social context 57
On the Online Coalition Structure Generation Problem 57
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation 56
Generalized budgeted submodular set function maximization 56
Nash Social Welfare in Selfish and Online Load Balancing 55
Almost envy-free allocations with connected bundles 55
Local core stability in simple symmetric fractional hedonic games 54
Relaxed Core Stability in Fractional Hedonic Games 52
Optimality and nash stability in additively separable generalized group activity selection problems 50
Stable outcomes in modified fractional hedonic games 48
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 47
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 42
Pricing Problems with Buyer Preselection 35
Digraph k-Coloring Games: New Algorithms and Experiments 21
Totale 5.450
Salva come PNG Salva come JPEG
Categoria #
all - tutte 24.054
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 24.054
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/202092 0 0 0 0 0 0 0 0 0 20 13 59
2020/2021561 24 57 0 58 60 27 67 6 75 34 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.161 84 46 125 73 154 166 135 108 241 29 0 0
Totale 5.450