FLAMMINI, MICHELE
 Distribuzione geografica
Continente #
NA - Nord America 3.347
EU - Europa 1.884
AS - Asia 498
OC - Oceania 56
Continente sconosciuto - Info sul continente non disponibili 49
AF - Africa 15
SA - Sud America 13
Totale 5.862
Nazione #
US - Stati Uniti d'America 3.324
SE - Svezia 518
UA - Ucraina 385
DE - Germania 365
IE - Irlanda 170
IT - Italia 153
CN - Cina 112
VN - Vietnam 105
HK - Hong Kong 80
SG - Singapore 65
GB - Regno Unito 60
AU - Australia 51
EU - Europa 47
FR - Francia 42
FI - Finlandia 39
IL - Israele 36
JP - Giappone 29
NL - Olanda 22
CZ - Repubblica Ceca 21
BE - Belgio 18
CA - Canada 17
KR - Corea 15
TR - Turchia 15
PT - Portogallo 14
IN - India 10
RO - Romania 10
PL - Polonia 9
BG - Bulgaria 7
TW - Taiwan 7
BR - Brasile 6
ES - Italia 6
IR - Iran 6
GR - Grecia 5
NZ - Nuova Zelanda 5
PK - Pakistan 5
CL - Cile 4
EG - Egitto 4
HR - Croazia 4
RS - Serbia 4
CH - Svizzera 3
DK - Danimarca 3
EE - Estonia 3
GH - Ghana 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
AT - Austria 2
BN - Brunei Darussalam 2
DZ - Algeria 2
KE - Kenya 2
LT - Lituania 2
PA - Panama 2
RU - Federazione Russa 2
AD - Andorra 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
ZA - Sudafrica 1
Totale 5.862
Città #
Chandler 869
Boardman 443
New York 189
Kitzingen 179
Dublin 169
Los Angeles 154
San Mateo 153
Ogden 124
Dong Ket 104
Ashburn 86
Wilmington 67
Central 55
Turin 51
Singapore 44
Helsinki 38
West Jordan 36
Hanover 32
Las Vegas 24
Seattle 22
Tokyo 22
Frankfurt am Main 21
Hefei 20
Strasbourg 20
Berlin 19
Ann Arbor 17
Edinburgh 17
Brno 15
Adelaide 14
Clifton 14
Cologne 14
Beijing 13
Brussels 11
Guangzhou 11
London 10
Rockhampton 10
Shaoxing 10
Sydney 10
Atlanta 9
Milan 9
Munich 9
Rome 9
McLean 8
Redwood City 8
Tel Aviv 8
Toronto 8
Vila Nova de Gaia 8
Reno 7
Shanghai 7
Sofia 7
Eskişehir 6
Miami 6
Mosciano Sant'Angelo 6
Chengdu 5
Ghent 5
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
Florence 4
Leipzig 4
Lisbon 4
Manchester 4
Rozendaal 4
San Francisco 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
Giza 3
Hamburg 3
Houston 3
Jakarta 3
Lahore 3
Mahwah 3
Monaco 3
Morpeth 3
Nanjing 3
New Orleans 3
Oslo 3
Paris 3
Totale 3.405
Nome #
Inequity Aversion Pricing in Multi-Unit Markets 307
The Quality of Content Publishing in the Digital Era 213
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 114
26th International Colloquium on Structural Information and Communication Complexity 100
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 75
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 61
On fair price discrimination in multi-unit markets 60
Mean completion time minimization as a graph ordering problem 59
Distance Polymatrix Coordination Games 59
On fair price discrimination in multi-unit markets 55
The Impact of Selfishness in Hypergraph Hedonic Games 54
Strategyproof mechanisms for Friends and Enemies Games 52
Almost envy-free allocations with connected bundles 52
Nash Stability in Social Distance Games 51
Parameterized Complexity of Manipulating Sequential Allocation 45
Strategyproof Mechanisms for Friends and Enemies Games 45
On Pareto optimality in social distance games 42
Nash Stability in Fractional Hedonic Games 42
The speed of Convergence in Congestion Games under Best Response Dynamics 41
Price of pareto optimality in hedonic games 41
Approximating the Revenue Maximization Problem with Sharp Demands. 41
Pareto Approximations for the Bicriteria Scheduling Problem 41
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract) 41
Un Algoritmo Dinamico Efficiente per il Mantenimento di Cammini Minimi 40
ATM Layouts with Bounded Hop Count and Congestion 40
Approximating the Traffic Grooming Problem in Tree and Star Networks 40
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation 39
An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting problem 39
Asymptotically Optimal Solutions for Small World Graphs 39
Stackelberg Strategies for Network Design Games 39
Network Movement Games 39
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation 39
Almost Envy-Free Allocations with Connected Bundles 38
On Pareto Optimality in Social Distance Games 38
On Multidimensional Congestion Games 38
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games 38
Distance Hedonic Games 38
On Nash Equilibria in Non-Cooperative All-Optical Networks 38
On social envy-freeness in multi-unit markets 37
The ``Real" Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting 37
Guest Editorial: Special Issue on Algorithmic Game Theory 37
Asymptotically Optimal Solutions for Small World Graphs 37
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem 35
Approximating the Traffic Grooming Problem 35
Lower Bounds on Systolic Gossiping 35
Allocation Problems in Scalable Distributed Data Structures 35
Apprendimento delle Formule m-DNF tramite Alberi di Decisione 35
Approximating the revenue maximization problem with sharp demands 35
The price of stability for undirected broadcast network design with fair cost allocation is constant 35
Tightening the upper bound for the Minimum Energy Broadcasting 34
km-DNF Formulae are Learnable under Product Distribution 34
The Price of Stability for Undirected Broadcast Network Design with Fair Cost llocation is Constant 34
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 34
Deadlock-Free Interval Routing Schemes 34
Unavailable Transit Feed Specification: Making It Available with Recurrent Neural Networks 34
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles 33
On Devising Boolean Routing Schemes 33
Simple greedy algorithms for fundamental multidimensional graph problems 33
Building international doctoral schools in computer science in italy, de nicola’s way 33
Pricing Problems with Buyer Preselection 33
Extending the notion of rationality of selfish agents: Second Order Nash equilibria 33
Optimizing Regenerator Cost in Traffic Grooming 33
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 33
km-DNF Formulae are Learnable under Product Distribution 32
Simple and Efficient Routing Schemes for All-Optical Networks 32
Acyclic Orientations for Deadlock Prevention in Interconnection Networks 32
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 32
Graph Visitability 31
ATM Layouts with Bounded Hop Count and Congestion 31
When Ignorance Helps: Graphical Multicast Cost Sharing Games 31
Distance Hedonic Games 31
When ignorance helps: Graphical multicast cost sharing games 30
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions 30
Social Context Congestion Games 30
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks 30
On the Complexity of Deciding the Derivation Length in Term Rewriting Systems 30
Pareto Approximations for the Bicriteria Scheduling Problem 30
Experimental Evaluations of Algorithms for IP Table Minimization 30
On Social Envy-Freeness in Multi-Unit Markets 30
Deep Learning for Automated Recognition of Covid-19 from Chest X-ray Images 29
On the performances of Nash equilibria in isolation games 29
Multi-dimensional Interval Routing Schemes 29
Improved Approximation Results for the Minimum Energy Broadcasting Problem 29
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 29
The Complexity of Interval Routing on Random Graphs 29
Interval Routing Schemes 29
Game Theoretical Issues in Optical Networks 29
Quality of Service in Wireless Networks 29
Approximating the Traffic Grooming Problem in Tree and Star Networks 29
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 28
Experimental Evaluations of Algorithms for IP Table Minimization 28
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing 28
Efficient ATM Layouts with Bounded Hop Count and Congestion 28
Tight Bounds for Selfish and Greedy Load Balancing 28
Boolean Routing 28
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing 28
Sharing the Cost of Multicast Transmissions in Wireless Networks 28
Sharing the Cost of Multicast Transmissions in Wireless Networks 28
On the bicriteria k-server problem 27
Optimizing regenerator cost in traffic grooming 27
Totale 4.222
Categoria #
all - tutte 65.830
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 65.830


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.867 40 59 312 50 89 249 140 231 17 321 263 96
2024/202565 65 0 0 0 0 0 0 0 0 0 0 0
Totale 5.991