IRIS
FLAMMINI, MICHELE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.182
EU - Europa 3.090
AS - Asia 2.135
Continente sconosciuto - Info sul continente non disponibili 16
OC - Oceania 7
SA - Sud America 1
Totale 10.431
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.176
CN - Cina 998
IE - Irlanda 968
TR - Turchia 588
SG - Singapore 482
SE - Svezia 402
DE - Germania 379
IT - Italia 349
UA - Ucraina 329
GB - Regno Unito 300
FI - Finlandia 170
FR - Francia 108
BE - Belgio 23
IN - India 22
RU - Federazione Russa 18
EU - Europa 14
GR - Grecia 13
IL - Israele 10
JP - Giappone 8
RO - Romania 8
VN - Vietnam 8
AU - Australia 6
CH - Svizzera 6
AT - Austria 4
CA - Canada 4
IQ - Iraq 4
TW - Taiwan 4
ES - Italia 3
IR - Iran 3
A2 - ???statistics.table.value.countryCode.A2??? 2
HK - Hong Kong 2
HU - Ungheria 2
MX - Messico 2
NL - Olanda 2
BD - Bangladesh 1
BN - Brunei Darussalam 1
CZ - Repubblica Ceca 1
EC - Ecuador 1
KR - Corea 1
MD - Moldavia 1
MY - Malesia 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
OM - Oman 1
PL - Polonia 1
RS - Serbia 1
SA - Arabia Saudita 1
SI - Slovenia 1
Totale 10.431
Salva come PNG Salva come JPEG
Città #
Jacksonville 1.299
Chandler 1.108
Dublin 968
Singapore 402
Boardman 399
Izmir 298
Nanjing 269
San Mateo 237
Wilmington 174
Lawrence 164
Princeton 164
Ann Arbor 113
Beijing 103
Nanchang 99
New York 95
Hangzhou 92
Shenyang 74
Woodbridge 71
L’Aquila 69
Milan 69
Ashburn 54
Verona 50
Tianjin 47
Des Moines 42
Mountain View 39
L'aquila 38
Hebei 37
Jiaxing 36
Los Angeles 36
Seattle 35
Kunming 34
Jinan 32
Shanghai 28
Aquila 24
Changsha 24
Brussels 19
Helsinki 19
Venezia 19
Dearborn 17
Zhengzhou 17
Changchun 16
Houston 16
Ningbo 16
Lanzhou 14
Berlin 12
Falls Church 12
Guangzhou 12
Munich 12
Fremont 11
Norwalk 11
Santa Clara 11
Auburn Hills 10
Patras 10
Andover 9
Dong Ket 8
Düsseldorf 8
Taizhou 8
Dallas 7
Pune 7
North Bergen 6
Rome 6
Edinburgh 5
Haikou 5
London 5
Tappahannock 5
Chieti 4
Lequile 4
Moscow 4
Taipei 4
Vienna 4
Atlanta 3
Baghdad 3
Bremen 3
Fairfield 3
Fuzhou 3
Grafing 3
Phoenix 3
Redmond 3
Rochester 3
Brooklyn 2
Budapest 2
Cambridge 2
Dalian 2
Durham 2
Edmonton 2
Florence 2
Giulianova 2
Hanover 2
Hefei 2
Lausanne 2
Leuven 2
Madrid 2
Melbourne 2
Oxford 2
Redwood City 2
Teramo 2
Vári 2
Aarau 1
Adliswil 1
Alleghe 1
Totale 7.242
Salva come PNG Salva come JPEG
Nome #
The Speed of Convergence in Congestion Games under Best-Response Dynamics 152
On Social Envy-Freeness in Multi-Unit Markets 138
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract) 137
Simple greedy algorithms for fundamental multidimensional graph problems 125
26th International Colloquium on Structural Information and Communication Complexity 123
Online Coalition Structure Generation in Graph Games 106
Nash Stability in Social Distance Games 106
Network Movement Games 105
Synthesis of decentralized adaptors for concurrent and distributed component-based systems 100
Approximating the Traffic Grooming Problem in Tree and Star Networks 98
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 94
The Price of Envy-Freeness in Machine Scheduling 93
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions 91
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 91
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 90
Improved Approximation Results for the Minimum Energy Broadcasting Problem 86
The price of stability for undirected broadcast network design with fair cost allocation is constant 84
On the Price of Stability of Fractional Hedonic Games 84
Optimizing Regenerator Cost in Traffic Grooming 82
On the performances of Nash equilibria in isolation games 82
Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT) 82
On the Performances of Nash Equilibria in Isolation Games 81
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 80
Minimizing total busy time in parallel scheduling with application to optical networks 79
On Pareto Optimality in Social Distance Games 79
Optimizing regenerator cost in traffic grooming 79
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 78
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 77
Static and Dynamic Low-Congested Interval Routing Schemes 77
Compact-port routing models and applications to distance-hereditary graphs 77
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games 77
On the sequential price of anarchy of isolation games. 75
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 75
Approximating the Revenue Maximization Problem with Sharp Demands. 74
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 74
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 73
On Minimizing the Number of ADMs in a General Topology Optical Network 73
Approximating the revenue maximization problem with sharp demands 73
Graphical Congestion Games 72
Asymptotically Optimal Solutions for Small World Graphs 72
On the upper chromatic number of (v3,b2)-configurations 72
Extending the notion of rationality of selfish agents: Second Order Nash equilibria 72
The ``Real" Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting 72
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves 72
Nash Stability in Fractional Hedonic Games 72
On the Convergence of Multicast Games in Directed Networks 72
Approximating the Traffic Grooming Problem in Tree and Star Networks 71
Improved Stable Retrieval in Noisy Collections 71
ATM Layouts with Bounded Hop Count and Congestion 71
Graph Visitability 69
On the Complexity of the Regenerator Placement Problem in Optical Networks 68
The Price of Envy-Freeness in Machine Scheduling 67
km-DNF Formulae are Learnable under Product Distribution 67
Some Anomalies of Farsighted Strategic Behavior 67
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem 67
Experimental Evaluations of Algorithms for IP Table Minimization 66
Pricing Problems with Buyer Preselection 66
The speed of Convergence in Congestion Games under Best Response Dynamics 66
Game Theoretical Issues in Optical Networks 65
Apprendimento delle Formule m-DNF tramite Alberi di Decisione 65
Quality of Service in Wireless Networks 65
An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting problem 65
Acyclic Orientations for Deadlock Prevention in Interconnection Networks 64
On Bidimensional Congestion Games 64
Sharing the Cost of Multicast Transmissions in Wireless Networks 63
Wireless ATM Layouts for Chain Networks 63
Minimum Flow Time Graph Ordering 63
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 63
The Complexity of Interval Routing on Random Graphs 62
Deadlock-Free Interval Routing Schemes 62
On the bicriteria k-server problem 62
Traffic Grooming: Combinatorial Results and Practical Resolutions. 62
Sharing the Cost of Multicast Transmissions in Wireless Networks 62
On the Convergence of Multicast Games in Directed Networks 61
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols 61
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles 61
Lower Bounds on Systolic Gossiping 61
Synthesis of concurrent and distributed adaptors for component-based systems 61
Competitive Algorithms for the Bicriteria k-Server Problem 61
On the Complexity of the Regenerator Placement Problem in Optical Networks 61
ATM Layouts with Bounded Hop Count and Congestion 60
Systolic Acyclic Orientations for Deadlock Prevention 60
On the performances of Nash equilibria in isolation games 60
Simple, Efficient Routing Schemes for All-Optical Networks 60
Layouts for Mobility Management in Wireless ATM Networks 59
Tightening the upper bound for the Minimum Energy Broadcasting 59
Multi-dimensional Interval Routing Schemes 59
Stackelberg Strategies for Network Design Games 58
On the IP Routing Tables Minimization with Addresses Reassignments 58
On the Complexity of Deciding the Derivation Length in Term Rewriting Systems 58
Social Context Congestion Games 58
Performance of One-Round Walks in Linear Congestion Games 58
Approximating the Traffic Grooming Problem 57
Quality of Service in Wireless Networks 57
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs 57
Mean completion time minimization as a graph ordering problem 57
Experimental Evaluations of Algorithms for IP Table Minimization 57
Static and Dynamic Low-Congested Interval Routing Schemes 57
On Minimizing the Number of ADMs in a General Topology Optical Network 57
Tight Bounds for Selfish and Greedy Load Balancing 56
Totale 7.381
Salva come PNG Salva come JPEG
Categoria #
all - tutte 42.174
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 42.174
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020897 0 0 0 0 11 178 261 19 201 26 22 179
2020/20211.338 32 167 10 168 169 43 171 9 169 46 303 51
2021/2022992 46 106 157 68 38 10 16 59 57 18 66 351
2022/20233.001 227 151 74 303 280 340 5 203 1.272 20 74 52
2023/2024632 163 48 31 116 34 129 4 26 0 33 7 41
2024/2025731 138 59 288 148 98 0 0 0 0 0 0 0
Totale 10.605