IRIS
FLAMMINI, MICHELE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1592
EU - Europa 1521
AS - Asia 335
Continente sconosciuto - Info sul continente non disponibili 49
OC - Oceania 16
SA - Sud America 6
AF - Africa 5
Totale 3524
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1575
SE - Svezia 516
UA - Ucraina 384
IE - Irlanda 189
DE - Germania 125
IT - Italia 113
VN - Vietnam 105
CN - Cina 80
HK - Hong Kong 57
EU - Europa 47
FR - Francia 33
GB - Regno Unito 30
IL - Israele 26
FI - Finlandia 20
JP - Giappone 20
NL - Olanda 19
BE - Belgio 17
KR - Corea 14
AU - Australia 13
PT - Portogallo 13
CA - Canada 12
IN - India 8
RO - Romania 8
PL - Polonia 7
TW - Taiwan 7
BG - Bulgaria 5
ES - Italia 5
TR - Turchia 5
GR - Grecia 4
SG - Singapore 4
BR - Brasile 3
CH - Svizzera 3
CZ - Repubblica Ceca 3
DK - Danimarca 3
EE - Estonia 3
IR - Iran 3
MC - Monaco 3
NZ - Nuova Zelanda 3
RS - Serbia 3
SK - Slovacchia (Repubblica Slovacca) 3
A2 - ???statistics.table.value.countryCode.A2??? 2
HR - Croazia 2
ID - Indonesia 2
KE - Kenya 2
MA - Marocco 2
MX - Messico 2
NO - Norvegia 2
PA - Panama 2
RU - Federazione Russa 2
AD - Andorra 1
AT - Austria 1
CL - Cile 1
GH - Ghana 1
GL - Groenlandia 1
HU - Ungheria 1
KH - Cambogia 1
KZ - Kazakistan 1
LT - Lituania 1
LU - Lussemburgo 1
MD - Moldavia 1
PE - Perù 1
PK - Pakistan 1
PY - Paraguay 1
SA - Arabia Saudita 1
Totale 3524
Salva come PNG Salva come JPEG
Città #
Chandler 869
Dublin 189
San Mateo 153
Dong Ket 104
Wilmington 67
Central 41
Turin 38
Hanover 32
Hefei 20
Strasbourg 20
Helsinki 19
Ann Arbor 17
Frankfurt am Main 16
Berlin 15
Brussels 15
Tokyo 14
Beijing 13
Shaoxing 10
Milan 9
Rome 9
Redwood City 8
Vila Nova de Gaia 8
London 7
Shanghai 6
Toronto 6
Nes 'Ammim 5
Nîmes 5
Seongnam 5
Sofia 5
Sydney 5
Taipei 5
Amsterdam 4
Arielli 4
Central District 4
Clearwater 4
Leipzig 4
Rozendaal 4
Wuhan 4
Xian 4
Zhengzhou 4
Athens 3
Atlanta 3
Belgrade 3
Chatsworth 3
Chicago 3
Chongqing 3
Hamburg 3
Lisbon 3
Los Angeles 3
Mahwah 3
Manchester 3
Monaco 3
Morpeth 3
Nanjing 3
San Jose 3
Stockholm 3
Tallinn 3
Tel Aviv 3
Agadir 2
Bengaluru 2
Bonn 2
Busso 2
Bussolengo 2
Copenhagen 2
Delft 2
Gold Coast 2
Hamilton 2
Jakarta 2
Kocaeli 2
Kraków 2
Milford Haven 2
Mosciano Sant'Angelo 2
Nairobi 2
New Orleans 2
New York 2
Oslo 2
Panama City 2
Paris 2
Pars 2
Prague 2
Pudsey 2
Richardson 2
Sacramento 2
San Francisco 2
Seoul 2
South San Francisco 2
São Paulo 2
Trumbull 2
Tuen Mun 2
Tübingen 2
Vancouver 2
Warsaw 2
Zagreb 2
Accra 1
Almaty 1
Andorra la Vella 1
Anstruther 1
Antwerp 1
Apo 1
Arlington 1
Totale 1902
Salva come PNG Salva come JPEG
Nome #
Inequity Aversion Pricing in Multi-Unit Markets 186
The Quality of Content Publishing in the Digital Era 101
26th International Colloquium on Structural Information and Communication Complexity 71
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 55
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 52
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load 50
On fair price discrimination in multi-unit markets 49
Mean completion time minimization as a graph ordering problem 34
Strategyproof mechanisms for Friends and Enemies Games 33
Nash Stability in Social Distance Games 32
Strategyproof Mechanisms for Friends and Enemies Games 31
Distance Polymatrix Coordination Games 31
Almost envy-free allocations with connected bundles 31
On Pareto optimality in social distance games 30
The Impact of Selfishness in Hypergraph Hedonic Games 30
Price of pareto optimality in hedonic games 29
On Pareto Optimality in Social Distance Games 29
ATM Layouts with Bounded Hop Count and Congestion 29
Parameterized Complexity of Manipulating Sequential Allocation 29
On the Impact of Buyers Preselection in Pricing Problems (Extended Abstract) 29
On Nash Equilibria in Non-Cooperative All-Optical Networks 29
Approximating the Revenue Maximization Problem with Sharp Demands. 28
On fair price discrimination in multi-unit markets 28
Guest Editorial: Special Issue on Algorithmic Game Theory 27
Approximating the Traffic Grooming Problem in Tree and Star Networks 27
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation 26
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games 26
Asymptotically Optimal Solutions for Small World Graphs 25
Un Algoritmo Dinamico Efficiente per il Mantenimento di Cammini Minimi 25
Deadlock-Free Interval Routing Schemes 25
Apprendimento delle Formule m-DNF tramite Alberi di Decisione 25
Asymptotically Optimal Solutions for Small World Graphs 25
Unavailable Transit Feed Specification: Making It Available with Recurrent Neural Networks 25
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation 25
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles 24
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem 24
Almost Envy-Free Allocations with Connected Bundles 24
The Price of Stability for Undirected Broadcast Network Design with Fair Cost llocation is Constant 24
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 24
Building international doctoral schools in computer science in italy, de nicola’s way 24
The price of stability for undirected broadcast network design with fair cost allocation is constant 24
Optimizing Regenerator Cost in Traffic Grooming 24
Tightening the upper bound for the Minimum Energy Broadcasting 23
An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting problem 23
The speed of Convergence in Congestion Games under Best Response Dynamics 23
On Devising Boolean Routing Schemes 23
Allocation Problems in Scalable Distributed Data Structures 23
On Multidimensional Congestion Games 23
Approximating the Traffic Grooming Problem 22
The Complexity of Interval Routing on Random Graphs 22
Simple and Efficient Routing Schemes for All-Optical Networks 22
Graph Visitability 22
Simple greedy algorithms for fundamental multidimensional graph problems 22
ATM Layouts with Bounded Hop Count and Congestion 22
Network Movement Games 22
Nash Stability in Fractional Hedonic Games 22
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 22
Distance Hedonic Games 22
When ignorance helps: Graphical multicast cost sharing games 21
km-DNF Formulae are Learnable under Product Distribution 21
km-DNF Formulae are Learnable under Product Distribution 21
Pricing Problems with Buyer Preselection 21
Approximating the revenue maximization problem with sharp demands 21
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 20
On the performances of Nash equilibria in isolation games 20
Multi-dimensional Interval Routing Schemes 20
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions 20
On social envy-freeness in multi-unit markets 20
Improved Approximation Results for the Minimum Energy Broadcasting Problem 20
The ``Real" Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting 20
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 20
On the Complexity of Deciding the Derivation Length in Term Rewriting Systems 20
Interval Routing Schemes 20
Stackelberg Strategies for Network Design Games 20
Experimental Evaluations of Algorithms for IP Table Minimization 20
Game-Theoretic Approaches to Optimization Problems in Communication Networks. 20
Boolean Routing 20
When Ignorance Helps: Graphical Multicast Cost Sharing Games 20
Pareto Approximations for the Bicriteria Scheduling Problem 20
Approximating the Traffic Grooming Problem in Tree and Star Networks 20
On Social Envy-Freeness in Multi-Unit Markets 20
On Multiprocessor Scheduling under Multiple Objectives 19
Social Context Congestion Games 19
Lower Bounds on Systolic Gossiping 19
Extending the notion of rationality of selfish agents: Second Order Nash equilibria 19
Optimizing regenerator cost in traffic grooming 18
Efficient ATM Layouts with Bounded Hop Count and Congestion 18
Tight Bounds for Selfish and Greedy Load Balancing 18
Acyclic Orientations for Deadlock Prevention in Interconnection Networks 18
Quality of Service in Wireless Networks 18
Experimental Evaluations of Algorithms for IP Table Minimization 17
On non-cooperativeness in social distance games 17
Minimizing total busy time in parallel scheduling with application to optical networks 17
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks 17
Static and Dynamic Low-Congested Interval Routing Schemes 17
Game Theoretical Issues in Optical Networks 17
Interval Routing Schemes for Chordal Rings 17
Learning DNF Formulae under Classes of Probability Distribution 17
Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT) 17
Sharing the Cost of Multicast Transmissions in Wireless Networks 17
Totale 2678
Salva come PNG Salva come JPEG
Categoria #
all - tutte 28045
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 28045
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021468 0446 840 518 737720213
2021/20221174 171391681 8310 3711 384910143
2022/20231997 147263321 242347 215384 339000
Totale 3639