IRIS
FLAMMINI, MICHELE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.157
EU - Europa 1.645
AS - Asia 435
OC - Oceania 54
Continente sconosciuto - Info sul continente non disponibili 49
SA - Sud America 13
AF - Africa 12
Totale 5.365
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.134
SE - Svezia 518
UA - Ucraina 385
IE - Irlanda 170
DE - Germania 158
IT - Italia 148
VN - Vietnam 105
CN - Cina 100
HK - Hong Kong 77
GB - Regno Unito 58
AU - Australia 49
EU - Europa 47
FR - Francia 40
FI - Finlandia 35
IL - Israele 35
JP - Giappone 29
SG - Singapore 22
NL - Olanda 21
CA - Canada 17
BE - Belgio 16
TR - Turchia 15
KR - Corea 14
PT - Portogallo 14
IN - India 10
RO - Romania 10
PL - Polonia 9
BG - Bulgaria 7
TW - Taiwan 7
BR - Brasile 6
CZ - Repubblica Ceca 6
ES - Italia 6
IR - Iran 6
GR - Grecia 5
NZ - Nuova Zelanda 5
CL - Cile 4
EG - Egitto 4
HR - Croazia 4
RS - Serbia 4
CH - Svizzera 3
DK - Danimarca 3
EE - Estonia 3
HU - Ungheria 3
ID - Indonesia 3
MA - Marocco 3
MC - Monaco 3
MX - Messico 3
NO - Norvegia 3
SA - Arabia Saudita 3
SK - Slovacchia (Repubblica Slovacca) 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BN - Brunei Darussalam 2
DZ - Algeria 2
KE - Kenya 2
LT - Lituania 2
PA - Panama 2
PK - Pakistan 2
RU - Federazione Russa 2
AD - Andorra 1
AT - Austria 1
GH - Ghana 1
GL - Groenlandia 1
IS - Islanda 1
KH - Cambogia 1
KZ - Kazakistan 1
LU - Lussemburgo 1
LV - Lettonia 1
MD - Moldavia 1
MO - Macao, regione amministrativa speciale della Cina 1
NP - Nepal 1
PE - Perù 1
PH - Filippine 1
PY - Paraguay 1
VE - Venezuela 1
Totale 5.365
Salva come PNG Salva come JPEG
Città #
Chandler 869
Boardman 399
New York 189
Dublin 169
San Mateo 153
Ogden 124
Dong Ket 104
Ashburn 86
Los Angeles 76
Wilmington 67
Central 55
Turin 51
West Jordan 36
Helsinki 34
Hanover 32
Las Vegas 24
Tokyo 22
Frankfurt am Main 21
Seattle 21
Hefei 20
Strasbourg 20
Berlin 19
Ann Arbor 17
Edinburgh 17
Adelaide 14
Singapore 14
Beijing 13
Brussels 11
Guangzhou 11
London 10
Rockhampton 10
Shaoxing 10
Milan 9
Rome 9
McLean 8
Redwood City 8
Sydney 8
Toronto 8
Vila Nova de Gaia 8
Atlanta 7
Reno 7
Shanghai 7
Sofia 7
Tel Aviv 7
Eskişehir 6
Miami 6
Mosciano Sant'Angelo 6
Ithaca 5
Nes 'Ammim 5
Nîmes 5
Prague 5
Seongnam 5
Taipei 5
Amsterdam 4
Arielli 4
Athens 4
Belgrade 4
Bonn 4
Central District 4
Chicago 4
Clearwater 4
Denver 4
Leipzig 4
Lisbon 4
Manchester 4
Rozendaal 4
San Jose 4
Stockholm 4
Turramurra 4
Warsaw 4
Wuhan 4
Xian 4
Zagreb 4
Zhengzhou 4
Brisbane 3
Budapest 3
Chatsworth 3
Chongqing 3
Cormeilles-en-Parisis 3
Florence 3
Ghent 3
Giza 3
Hamburg 3
Houston 3
Jakarta 3
Mahwah 3
Monaco 3
Morpeth 3
Nanjing 3
New Orleans 3
Oslo 3
Paris 3
Santiago 3
São Paulo 3
Tallinn 3
Teramo 3
Agadir 2
Alexandria 2
Auckland 2
Bandar Seri Begawan 2
Totale 3.017
Salva come PNG Salva come JPEG
Nome #
Inequity Aversion Pricing in Multi-Unit Markets 283
The Quality of Content Publishing in the Digital Era 200
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 103
26th International Colloquium on Structural Information and Communication Complexity 96
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 72
On fair price discrimination in multi-unit markets 59
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 57
Distance Polymatrix Coordination Games 53
Mean completion time minimization as a graph ordering problem 50
The Impact of Selfishness in Hypergraph Hedonic Games 49
Almost envy-free allocations with connected bundles 48
Nash Stability in Social Distance Games 47
Strategyproof mechanisms for Friends and Enemies Games 46
Parameterized Complexity of Manipulating Sequential Allocation 42
On fair price discrimination in multi-unit markets 40
Strategyproof Mechanisms for Friends and Enemies Games 40
Price of pareto optimality in hedonic games 39
Un Algoritmo Dinamico Efficiente per il Mantenimento di Cammini Minimi 39
ATM Layouts with Bounded Hop Count and Congestion 39
Nash Stability in Fractional Hedonic Games 39
On Pareto optimality in social distance games 38
The speed of Convergence in Congestion Games under Best Response Dynamics 38
Approximating the Revenue Maximization Problem with Sharp Demands. 38
Pareto Approximations for the Bicriteria Scheduling Problem 38
Network Movement Games 38
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract) 38
Almost Envy-Free Allocations with Connected Bundles 37
Approximating the Traffic Grooming Problem in Tree and Star Networks 37
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation 36
On Pareto Optimality in Social Distance Games 36
Guest Editorial: Special Issue on Algorithmic Game Theory 36
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games 36
An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting problem 35
The ``Real" Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting 35
Asymptotically Optimal Solutions for Small World Graphs 35
Distance Hedonic Games 35
On Nash Equilibria in Non-Cooperative All-Optical Networks 35
Lower Bounds on Systolic Gossiping 34
The price of stability for undirected broadcast network design with fair cost allocation is constant 34
On Multidimensional Congestion Games 34
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation 34
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem 33
On social envy-freeness in multi-unit markets 33
The Price of Stability for Undirected Broadcast Network Design with Fair Cost llocation is Constant 33
Allocation Problems in Scalable Distributed Data Structures 33
Apprendimento delle Formule m-DNF tramite Alberi di Decisione 33
Asymptotically Optimal Solutions for Small World Graphs 33
Approximating the Traffic Grooming Problem 32
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 32
Deadlock-Free Interval Routing Schemes 32
Pricing Problems with Buyer Preselection 32
Extending the notion of rationality of selfish agents: Second Order Nash equilibria 32
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles 31
Tightening the upper bound for the Minimum Energy Broadcasting 31
On Devising Boolean Routing Schemes 31
Simple greedy algorithms for fundamental multidimensional graph problems 31
Building international doctoral schools in computer science in italy, de nicola’s way 31
Approximating the revenue maximization problem with sharp demands 31
Optimizing Regenerator Cost in Traffic Grooming 31
Unavailable Transit Feed Specification: Making It Available with Recurrent Neural Networks 31
km-DNF Formulae are Learnable under Product Distribution 30
km-DNF Formulae are Learnable under Product Distribution 30
Simple and Efficient Routing Schemes for All-Optical Networks 30
Stackelberg Strategies for Network Design Games 30
Graph Visitability 30
ATM Layouts with Bounded Hop Count and Congestion 30
When Ignorance Helps: Graphical Multicast Cost Sharing Games 30
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 30
When ignorance helps: Graphical multicast cost sharing games 29
Social Context Congestion Games 29
Acyclic Orientations for Deadlock Prevention in Interconnection Networks 29
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 29
Multi-dimensional Interval Routing Schemes 28
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions 28
Improved Approximation Results for the Minimum Energy Broadcasting Problem 28
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 28
On the Complexity of Deciding the Derivation Length in Term Rewriting Systems 28
Interval Routing Schemes 28
Pareto Approximations for the Bicriteria Scheduling Problem 28
Distance Hedonic Games 28
Experimental Evaluations of Algorithms for IP Table Minimization 27
Efficient ATM Layouts with Bounded Hop Count and Congestion 27
The Complexity of Interval Routing on Random Graphs 27
Tight Bounds for Selfish and Greedy Load Balancing 27
Experimental Evaluations of Algorithms for IP Table Minimization 27
On Social Envy-Freeness in Multi-Unit Markets 27
On the bicriteria k-server problem 26
On the performances of Nash equilibria in isolation games 26
Characterization Results of All Shortest Paths Interval Routing Schemes 26
Game Theoretical Issues in Optical Networks 26
Interval Routing Schemes for Chordal Rings 26
Learning DNF Formulae under Classes of Probability Distribution 26
Boolean Routing 26
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing 26
Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT) 26
Quality of Service in Wireless Networks 26
Sharing the Cost of Multicast Transmissions in Wireless Networks 26
Approximating the Traffic Grooming Problem in Tree and Star Networks 26
Low Congested Interval Routing Schemes for Hypercube-Like Networks 25
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 25
Totale 3.908
Salva come PNG Salva come JPEG
Categoria #
all - tutte 56.537
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 56.537
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021468 0 4 4 6 8 40 5 18 73 77 20 213
2021/20221.174 17 13 91 681 83 10 37 11 38 49 101 43
2022/20232.417 14 72 63 321 242 347 187 382 341 114 295 39
2023/20241.426 40 59 312 50 89 249 140 231 17 239 0 0
Totale 5.485