FLAMMINI, MICHELE
 Distribuzione geografica
Continente #
NA - Nord America 4.050
EU - Europa 2.180
AS - Asia 1.545
OC - Oceania 59
Continente sconosciuto - Info sul continente non disponibili 49
SA - Sud America 42
AF - Africa 19
Totale 7.944
Nazione #
US - Stati Uniti d'America 4.022
CN - Cina 817
SE - Svezia 519
DE - Germania 402
UA - Ucraina 385
IT - Italia 366
SG - Singapore 220
TR - Turchia 185
IE - Irlanda 171
VN - Vietnam 105
HK - Hong Kong 81
GB - Regno Unito 63
AU - Australia 52
FI - Finlandia 49
EU - Europa 47
FR - Francia 44
NL - Olanda 38
IL - Israele 36
BR - Brasile 35
JP - Giappone 32
CZ - Repubblica Ceca 21
BE - Belgio 19
CA - Canada 18
KR - Corea 16
PT - Portogallo 14
IN - India 10
PL - Polonia 10
RO - Romania 10
TW - Taiwan 10
BG - Bulgaria 8
IR - Iran 7
NZ - Nuova Zelanda 7
CH - Svizzera 6
ES - Italia 6
MX - Messico 6
PK - Pakistan 6
GR - Grecia 5
SA - Arabia Saudita 5
CL - Cile 4
EG - Egitto 4
HR - Croazia 4
HU - Ungheria 4
KE - Kenya 4
LV - Lettonia 4
MA - Marocco 4
RS - Serbia 4
AT - Austria 3
DK - Danimarca 3
EE - Estonia 3
GH - Ghana 3
ID - Indonesia 3
LT - Lituania 3
MC - Monaco 3
NO - Norvegia 3
RU - Federazione Russa 3
SK - Slovacchia (Repubblica Slovacca) 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BN - Brunei Darussalam 2
DZ - Algeria 2
KZ - Kazakistan 2
PA - Panama 2
ZA - Sudafrica 2
AD - Andorra 1
AZ - Azerbaigian 1
DO - Repubblica Dominicana 1
GL - Groenlandia 1
IS - Islanda 1
KG - Kirghizistan 1
KH - Cambogia 1
LU - Lussemburgo 1
MD - Moldavia 1
MO - Macao, regione amministrativa speciale della Cina 1
NP - Nepal 1
PE - Perù 1
PH - Filippine 1
PS - Palestinian Territory 1
PY - Paraguay 1
UZ - Uzbekistan 1
VE - Venezuela 1
Totale 7.944
Città #
Chandler 869
Boardman 841
Los Angeles 232
Shanghai 227
Milan 210
New York 191
Kitzingen 179
Istanbul 171
Dublin 170
Singapore 166
San Mateo 153
Ogden 124
Dong Ket 104
Ashburn 87
Seattle 70
Wilmington 67
Guangzhou 57
Central 55
Turin 51
Helsinki 47
Santa Clara 41
Beijing 38
Munich 36
West Jordan 36
Hanover 32
Shenzhen 31
Las Vegas 24
Tokyo 22
Frankfurt am Main 21
Berlin 20
Hefei 20
North Bergen 20
Strasbourg 20
Ann Arbor 17
Edinburgh 17
Amsterdam 16
Adelaide 15
Brno 15
Clifton 15
Jiaxing 15
Xi'an 15
Cologne 14
Wuxi 14
Brussels 12
London 12
Atlanta 10
Rockhampton 10
Shaoxing 10
Sydney 10
Hangzhou 9
Rome 9
Wuhan 9
Chengdu 8
McLean 8
Nanjing 8
Redwood City 8
Sofia 8
Taipei 8
Tel Aviv 8
Toronto 8
Vila Nova de Gaia 8
Foshan 7
Reno 7
Eskişehir 6
Haining 6
Miami 6
Mosciano Sant'Angelo 6
Quanzhou 6
Chicago 5
Ghent 5
Ithaca 5
Nes 'Ammim 5
Nîmes 5
Prague 5
Seongnam 5
São Paulo 5
Warsaw 5
Arielli 4
Athens 4
Belgrade 4
Bonn 4
Central District 4
Clearwater 4
Dalian 4
Denver 4
Florence 4
Fuzhou 4
Leipzig 4
Lisbon 4
Manchester 4
Nairobi 4
Paris 4
Riga 4
Rozendaal 4
San Francisco 4
San Jose 4
Stockholm 4
Turramurra 4
Xian 4
Zagreb 4
Totale 4.929
Nome #
Inequity Aversion Pricing in Multi-Unit Markets 330
The Quality of Content Publishing in the Digital Era 226
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 141
26th International Colloquium on Structural Information and Communication Complexity 123
On fair price discrimination in multi-unit markets 93
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 84
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 74
Mean completion time minimization as a graph ordering problem 71
On fair price discrimination in multi-unit markets 71
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 69
Distance Polymatrix Coordination Games 69
The Impact of Selfishness in Hypergraph Hedonic Games 68
Strategyproof mechanisms for Friends and Enemies Games 68
Strategyproof Mechanisms for Friends and Enemies Games 65
Almost envy-free allocations with connected bundles 63
Nash Stability in Social Distance Games 61
Parameterized Complexity of Manipulating Sequential Allocation 57
The ``Real" Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting 55
Approximating the Revenue Maximization Problem with Sharp Demands. 54
On Multidimensional Congestion Games 54
Network Movement Games 54
Distance Hedonic Games 54
The speed of Convergence in Congestion Games under Best Response Dynamics 53
Nash Stability in Fractional Hedonic Games 53
Un Algoritmo Dinamico Efficiente per il Mantenimento di Cammini Minimi 52
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games 52
Approximating the Traffic Grooming Problem in Tree and Star Networks 51
On Pareto optimality in social distance games 50
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation 50
Pareto Approximations for the Bicriteria Scheduling Problem 50
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract) 50
On Nash Equilibria in Non-Cooperative All-Optical Networks 50
On social envy-freeness in multi-unit markets 49
Approximating the Traffic Grooming Problem 49
ATM Layouts with Bounded Hop Count and Congestion 49
Asymptotically Optimal Solutions for Small World Graphs 48
Price of pareto optimality in hedonic games 48
Stackelberg Strategies for Network Design Games 48
Building international doctoral schools in computer science in italy, de nicola’s way 48
Approximating the revenue maximization problem with sharp demands 48
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation 48
An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting problem 47
Apprendimento delle Formule m-DNF tramite Alberi di Decisione 47
km-DNF Formulae are Learnable under Product Distribution 46
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions 46
Tightening the upper bound for the Minimum Energy Broadcasting 46
Asymptotically Optimal Solutions for Small World Graphs 46
Sharing the Cost of Multicast Transmissions in Wireless Networks 46
Distance Hedonic Games 46
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem 45
On Devising Boolean Routing Schemes 45
Almost Envy-Free Allocations with Connected Bundles 45
On Pareto Optimality in Social Distance Games 45
Deadlock-Free Interval Routing Schemes 45
Efficient ATM Layouts with Bounded Hop Count and Congestion 44
The Price of Stability for Undirected Broadcast Network Design with Fair Cost llocation is Constant 44
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 44
Simple greedy algorithms for fundamental multidimensional graph problems 44
Acyclic Orientations for Deadlock Prevention in Interconnection Networks 44
Allocation Problems in Scalable Distributed Data Structures 44
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles 43
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing 43
Improved Approximation Results for the Minimum Energy Broadcasting Problem 43
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks 43
km-DNF Formulae are Learnable under Product Distribution 43
Graph Visitability 43
Lower Bounds on Systolic Gossiping 43
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 43
Guest Editorial: Special Issue on Algorithmic Game Theory 43
Extending the notion of rationality of selfish agents: Second Order Nash equilibria 43
The price of stability for undirected broadcast network design with fair cost allocation is constant 43
On Social Envy-Freeness in Multi-Unit Markets 43
When ignorance helps: Graphical multicast cost sharing games 42
On the Hardness of Devising Interval Routing Schemes 42
Experimental Evaluations of Algorithms for IP Table Minimization 42
Optimizing Regenerator Cost in Traffic Grooming 42
Deep Learning for Automated Recognition of Covid-19 from Chest X-ray Images 41
On the bicriteria k-server problem 41
On Minimizing the Number of ADMs in a General Topology Optical Network 41
ATM Layouts with Bounded Hop Count and Congestion 41
Quality of Service in Wireless Networks 41
Unavailable Transit Feed Specification: Making It Available with Recurrent Neural Networks 41
On the performances of Nash equilibria in isolation games 40
Simple and Efficient Routing Schemes for All-Optical Networks 40
Interval Routing Schemes 40
Experimental Evaluations of Algorithms for IP Table Minimization 39
Optimizing regenerator cost in traffic grooming 39
The Complexity of Interval Routing on Random Graphs 39
When Ignorance Helps: Graphical Multicast Cost Sharing Games 39
Pricing Problems with Buyer Preselection 39
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing 39
On non-cooperativeness in social distance games 38
On the Complexity of Deciding the Derivation Length in Term Rewriting Systems 38
Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT) 38
Approximating the Traffic Grooming Problem in Tree and Star Networks 38
Efficient Online Algorithms for the Bicriteria k-Server Problem and Online Applications 37
Minimizing total busy time in parallel scheduling with application to optical networks 37
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 37
Social Context Congestion Games 37
Static and Dynamic Low-Congested Interval Routing Schemes 37
Totale 5.430
Categoria #
all - tutte 82.827
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 82.827


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/20252.154 68 569 712 341 215 249 0 0 0 0 0 0
Totale 8.080