Benvenuti nell'Anagrafe della Ricerca d'Ateneo

NICOSIA, GAIA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.756
EU - Europa 5.761
AS - Asia 2.347
AF - Africa 110
OC - Oceania 13
SA - Sud America 6
Continente sconosciuto - Info sul continente non disponibili 5
Totale 14.998
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.747
DK - Danimarca 1.963
CN - Cina 1.830
GB - Regno Unito 1.434
SE - Svezia 623
DE - Germania 489
IT - Italia 346
UA - Ucraina 305
VN - Vietnam 234
SG - Singapore 158
FI - Finlandia 146
RU - Federazione Russa 119
IE - Irlanda 108
CI - Costa d'Avorio 106
AL - Albania 83
TR - Turchia 41
BE - Belgio 33
HK - Hong Kong 27
FR - Francia 24
NL - Olanda 22
KR - Corea 20
CZ - Repubblica Ceca 16
IN - India 16
AU - Australia 13
AT - Austria 11
RO - Romania 10
CA - Canada 9
JP - Giappone 6
PT - Portogallo 5
SI - Slovenia 5
A2 - ???statistics.table.value.countryCode.A2??? 4
MD - Moldavia 4
CH - Svizzera 3
PE - Perù 3
BD - Bangladesh 2
BR - Brasile 2
IQ - Iraq 2
LT - Lituania 2
LV - Lettonia 2
NO - Norvegia 2
SN - Senegal 2
UZ - Uzbekistan 2
AE - Emirati Arabi Uniti 1
AZ - Azerbaigian 1
BG - Bulgaria 1
EE - Estonia 1
EU - Europa 1
GR - Grecia 1
HU - Ungheria 1
ID - Indonesia 1
IR - Iran 1
LK - Sri Lanka 1
LU - Lussemburgo 1
MA - Marocco 1
MY - Malesia 1
NP - Nepal 1
PH - Filippine 1
PL - Polonia 1
SA - Arabia Saudita 1
UY - Uruguay 1
ZA - Sudafrica 1
Totale 14.998
Salva come PNG Salva come JPEG
Città #
Southend 1.296
Woodbridge 948
Fairfield 847
Wilmington 534
Houston 487
Ann Arbor 469
Ashburn 456
Chandler 435
Seattle 409
Nanjing 363
Cambridge 332
Boardman 254
Dearborn 239
Jacksonville 238
Dong Ket 234
Princeton 169
Beijing 157
Rome 149
Shenyang 144
Nanchang 143
Jinan 120
Hebei 119
Singapore 109
Dublin 106
Bremen 104
Changsha 104
Plano 99
Tianjin 71
Jiaxing 67
Helsinki 66
Orange 63
Redwood City 56
Guangzhou 52
Shanghai 42
Izmir 39
Kunming 38
Zhengzhou 38
San Diego 37
Hefei 34
Hangzhou 31
Haikou 30
Brussels 29
Taizhou 29
Hong Kong 27
Ningbo 26
Altamura 21
Lanzhou 21
London 21
San Paolo di Civitate 20
Seoul 20
Eitensheim 19
Taiyuan 17
Brno 16
Fuzhou 16
Milan 14
Venezia 14
Walnut 14
Dallas 13
Pune 11
Flushing 9
Munich 9
Verona 9
Fort Worth 8
Los Angeles 8
Alameda 7
Andover 7
Chiswick 7
Washington 7
Westminster 7
Aversa 6
Bari 6
Changchun 6
Hounslow 6
Mountain View 6
New York 6
Frankfurt Am Main 5
Kilburn 5
Lawrence 5
Santa Clara 5
Stevenage 5
Toronto 5
Trieste 5
Chicago 4
Edinburgh 4
Graz 4
Nanning 4
Norwalk 4
Acton 3
Alatri 3
Chengdu 3
Chongqing 3
Hanover 3
Hongtong 3
Islington 3
Monterotondo 3
North York 3
Prineville 3
Quzhou 3
Tokyo 3
Wuhan 3
Totale 10.284
Salva come PNG Salva come JPEG
Nome #
10th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011) 262
10th cologne-twente workshop on graphs and combinatorial optimization (CTW 2011) 259
Two Agents Competing for a Shared Machine 258
Price of Fairness for allocating a bounded resource 225
A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models 217
An exact algorithm for a multicommodity min-cost flow over time problem 211
Exact algorithms for a discrete metric labeling problem 211
Competitive multi-agent scheduling with an iterative selection rule 210
Optimally balancing assembly lines with different workstations 207
Maximin Fairness-profit Tradeoff in Project Budget Allocation 207
Strategies in Competing Subset Selection 206
A job-shop problem with one additional resource type 206
Brief announcement: the fair subset sum problem 206
Cheapest paths in dynamic networks 204
Optimal power control in OFDMA cellular networks 201
Optimally Balancing Assembly Lines with Different Workstations 201
On-line load balancing made simple: Greedy strikes back 200
Subset Weight Maximization with Two Competing Agents 200
Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines 198
Local Restoration for Trees and Arborescences 197
Assessing the quality of heuristic solutions to parallel machines min-max scheduling problems 195
On-line load balancing made simple: Greedy strikes back 194
Decentralized route guidance algorithms in urban transportation networks 192
Decentralized algorithms for multiple path routing in urban transportation networks 188
An approximate A* algorithm and its application to the SCS problem, 187
Robust paths in urban transportation networks 186
Scheduling three chains on two parallel machines 185
A Heuristic Approach to Batching and Scheduling a Single Machine to Minimize Setup Costs 184
Cyclic Schedules for Pipeline Assembly Processes 184
Scheduling tasks with comb precedence constraints on dedicated machines 183
Optimal channel allocation in OFDMA multi-cell systems 178
Sequencing a batching flexible cell to minimise set-up costs 177
Exact algorithms for a discrete metric labeling problem 173
Efficient offline algorithms for the bicriteria k-server problem and online applications 170
On the bicriteria k-server problem 170
Competitive subset selection with two agents 168
The Subset Sum game 165
On multicriteria online problems 164
Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds 163
Robust single machine scheduling with external-party jobs 163
Exact algorithms for a discrete metric labeling problem 163
Parallel dedicated machines scheduling with chain precedence constraints 162
Competitive algorithms for the bicriteria k-server problem 161
Single machine scheduling problems with generalized preemption 161
Minimum Cost Paths Over Dynamic Networks 161
Minimum Cost Multi-Product Flow Lines 160
Local Restoration for Trees and Arborescences 160
Two Agent Scheduling with a Central Selection Mechanism 159
Maximin Fairness in Project Budget Allocation 159
Scheduling Two Agent Task Chains with a Central Selection Mechanism 158
Minimum cost paths over dynamic networks 158
Profit-fairness trade-off in project selection 157
Single machine scheduling problems with generalized preemption 156
Robust single machine scheduling with a flexible maintenance activity 155
A branch and bound algorithm for a generalized Job Shop Scheduling problem 152
Cellular Radio Resource Allocation Problem 151
A column generation approach to a class of single-machine preemptive scheduling problems 151
Stable Routing under the Spanning Tree Protocol 151
An exact algorithm for a multicommodity min-cost flow over time problem 149
Price of fairness in two-agent single-machine scheduling problems 145
Build or merge: Locational decisions in mobile access networks 142
Competitive algorithms for the bicriteria k-server problem 141
Maximin fairness in project budget allocation 141
A multi-resource Job Shop Scheduling Problem 140
A branch and bound algorithm for a generalized Job Shop Scheduling problem 139
Price of Fairness for Multiagent Subset Sum Problems 139
Subset Weight Maximization with Two Competing Agents 135
On-line scheduling with setup costs 134
Coordinamento di una supply network nel settore del fashion 132
Strategies for single-machine multi-agent scheduling problems 130
Two Agents Single Machine Scheduling under a Coordination Mechanism 125
Scheduling Two Chains on m Machines 125
Scheduling two chains on parallel dedicated machines 121
Radio Resource Allocation in OFDMA Cellular Systems 121
Minimum cost subset selection with two competing agents 121
Single machine scheduling problems with generalized preemption 121
Optimal channel allocation in OFDMA multi-cell systems 120
Parallel Dedicated Machines Scheduling with Task-Precedence Constraints 120
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. 120
Local Restoration for Trees and Arborescences under the Spanning Tree Protocol 120
Optimal allocation plan for distribution centers of a frozen food company 118
Swapping failing arcs in shortest path arborescences 118
On a Stackelberg Subset Sum Game 118
Part batching and scheduling in a flexible cell to minimize setup costs 115
On a resource-constrained Job Shop Scheduling Problem 114
On the Stackelberg knapsack game 105
Coordinating stakeholders in a fashion supply network 103
A Stackelberg knapsack game with weight control 100
Two Stackelberg Knapsack games 85
A COMPARISON OF EXACT AND HEURISTIC METHODS FOR A FACILITY LOCATION PROBLEM 84
The price of fairness in two-agent scheduling 75
The Price of Fairness in a Two-Agent Single-Machine Scheduling Problem . 74
Single machine scheduling with bounded job rearrangements 71
Optimally rescheduling jobs under LIFO constraints 61
Lower bounds for a meal pickup-and-delivery scheduling problem 59
Constrained Job Rearrangements on a Single Machine 53
Fairness-utility trade-off in multi-agent scheduling 50
On multi-agent knapsack problems 49
Scheduling for last-mile meal-delivery processes 48
Rescheduling jobs with a LIFO buffer 48
Totale 15.219
Salva come PNG Salva come JPEG
Categoria #
all - tutte 42.457
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.457
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.241 0 0 0 0 296 336 474 379 498 94 113 51
2020/20211.842 96 90 109 90 156 112 268 182 244 128 68 299
2021/20221.175 51 153 32 16 239 33 144 50 93 45 82 237
2022/20231.666 235 319 112 214 109 287 7 145 150 8 56 24
2023/2024804 34 48 68 27 44 90 47 226 15 33 43 129
2024/2025471 22 56 306 67 20 0 0 0 0 0 0 0
Totale 15.626