Benvenuti nell'Anagrafe della Ricerca d'Ateneo

NICOSIA, GAIA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 7.346
NA - Nord America 6.842
AS - Asia 2.761
AF - Africa 115
SA - Sud America 71
OC - Oceania 14
Continente sconosciuto - Info sul continente non disponibili 5
Totale 17.154
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.825
DK - Danimarca 1.963
CN - Cina 1.849
RU - Federazione Russa 1.586
GB - Regno Unito 1.450
SE - Svezia 623
DE - Germania 502
SG - Singapore 477
IT - Italia 407
UA - Ucraina 306
VN - Vietnam 234
FI - Finlandia 148
IE - Irlanda 108
CI - Costa d'Avorio 107
AL - Albania 83
HK - Hong Kong 77
BR - Brasile 54
TR - Turchia 43
BE - Belgio 38
FR - Francia 25
NL - Olanda 25
KR - Corea 20
CA - Canada 16
CZ - Repubblica Ceca 16
IN - India 16
AU - Australia 14
KW - Kuwait 13
LT - Lituania 13
AT - Austria 12
RO - Romania 10
JP - Giappone 6
PT - Portogallo 5
SI - Slovenia 5
A2 - ???statistics.table.value.countryCode.A2??? 4
IQ - Iraq 4
MD - Moldavia 4
PE - Perù 4
AR - Argentina 3
CH - Svizzera 3
UZ - Uzbekistan 3
AE - Emirati Arabi Uniti 2
BD - Bangladesh 2
EC - Ecuador 2
IR - Iran 2
KE - Kenya 2
LV - Lettonia 2
MA - Marocco 2
NO - Norvegia 2
PK - Pakistan 2
PY - Paraguay 2
SN - Senegal 2
UY - Uruguay 2
VE - Venezuela 2
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
CL - Cile 1
CO - Colombia 1
EE - Estonia 1
EG - Egitto 1
EU - Europa 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
ID - Indonesia 1
IL - Israele 1
IM - Isola di Man 1
JO - Giordania 1
KZ - Kazakistan 1
LK - Sri Lanka 1
LU - Lussemburgo 1
MK - Macedonia 1
MX - Messico 1
MY - Malesia 1
NP - Nepal 1
OM - Oman 1
PH - Filippine 1
PL - Polonia 1
SA - Arabia Saudita 1
ZA - Sudafrica 1
Totale 17.154
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
Rome 165
Beijing 157
Shenyang 144
Moscow 143
Nanchang 143
Singapore 124
Jinan 120
Hebei 119
Dublin 106
Changsha 105
Bremen 104
Plano 99
Hong Kong 77
Tianjin 71
Helsinki 68
Jiaxing 67
Orange 63
Redwood City 56
Guangzhou 53
Shanghai 42
Izmir 39
Kunming 38
Zhengzhou 38
San Diego 37
The Dalles 35
Brussels 34
Hefei 34
Hangzhou 31
Milan 31
Haikou 30
Taizhou 29
London 28
Ningbo 26
Altamura 21
Lanzhou 21
San Paolo di Civitate 20
Seoul 20
Eitensheim 19
Taiyuan 17
Brno 16
Fuzhou 16
Los Angeles 16
Venezia 14
Walnut 14
Dallas 13
Ancona 12
Hawalli 12
Pune 11
Flushing 9
Munich 9
Toronto 9
Verona 9
Yubileyny 9
Fort Worth 8
Alameda 7
Andover 7
Chiswick 7
Washington 7
Westminster 7
Aversa 6
Bari 6
Changchun 6
Council Bluffs 6
Hounslow 6
Mountain View 6
New York 6
São Paulo 6
Falkenstein 5
Frankfurt Am Main 5
Frankfurt am Main 5
Kilburn 5
Lawrence 5
Nuremberg 5
Santa Clara 5
Stevenage 5
Trieste 5
Baghdad 4
Chengdu 4
Chicago 4
Edinburgh 4
Graz 4
Nanning 4
Norwalk 4
Acton 3
Totale 10.620
Salva come PNG Salva come JPEG
Nome #
10th cologne-twente workshop on graphs and combinatorial optimization (CTW 2011) 296
10th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011) 290
Two Agents Competing for a Shared Machine 280
Price of Fairness for allocating a bounded resource 252
A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models 248
An exact algorithm for a multicommodity min-cost flow over time problem 243
Maximin Fairness-profit Tradeoff in Project Budget Allocation 237
Brief announcement: the fair subset sum problem 235
Competitive multi-agent scheduling with an iterative selection rule 232
Cheapest paths in dynamic networks 232
A job-shop problem with one additional resource type 231
Scheduling three chains on two parallel machines 226
Exact algorithms for a discrete metric labeling problem 223
Optimally balancing assembly lines with different workstations 221
Strategies in Competing Subset Selection 218
Optimally Balancing Assembly Lines with Different Workstations 217
Assessing the quality of heuristic solutions to parallel machines min-max scheduling problems 215
Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines 215
Optimal power control in OFDMA cellular networks 213
A Heuristic Approach to Batching and Scheduling a Single Machine to Minimize Setup Costs 210
Subset Weight Maximization with Two Competing Agents 210
On-line load balancing made simple: Greedy strikes back 209
An approximate A* algorithm and its application to the SCS problem, 209
Decentralized route guidance algorithms in urban transportation networks 208
Local Restoration for Trees and Arborescences 206
Cyclic Schedules for Pipeline Assembly Processes 204
Decentralized algorithms for multiple path routing in urban transportation networks 203
On-line load balancing made simple: Greedy strikes back 202
Robust paths in urban transportation networks 201
Scheduling tasks with comb precedence constraints on dedicated machines 200
Profit-fairness trade-off in project selection 200
Optimal channel allocation in OFDMA multi-cell systems 192
Sequencing a batching flexible cell to minimise set-up costs 189
Exact algorithms for a discrete metric labeling problem 189
The Subset Sum game 183
Efficient offline algorithms for the bicriteria k-server problem and online applications 182
On the bicriteria k-server problem 182
Parallel dedicated machines scheduling with chain precedence constraints 180
Robust single machine scheduling with external-party jobs 180
On multicriteria online problems 178
Competitive subset selection with two agents 177
Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds 176
Minimum Cost Paths Over Dynamic Networks 175
Robust single machine scheduling with a flexible maintenance activity 174
Minimum Cost Multi-Product Flow Lines 173
Cellular Radio Resource Allocation Problem 173
Single machine scheduling problems with generalized preemption 173
Price of fairness in two-agent single-machine scheduling problems 173
Exact algorithms for a discrete metric labeling problem 173
Two Agent Scheduling with a Central Selection Mechanism 172
Local Restoration for Trees and Arborescences 171
A branch and bound algorithm for a generalized Job Shop Scheduling problem 171
An exact algorithm for a multicommodity min-cost flow over time problem 171
Maximin Fairness in Project Budget Allocation 171
Competitive algorithms for the bicriteria k-server problem 170
A column generation approach to a class of single-machine preemptive scheduling problems 170
Scheduling Two Agent Task Chains with a Central Selection Mechanism 169
Minimum cost paths over dynamic networks 169
Build or merge: Locational decisions in mobile access networks 169
Single machine scheduling problems with generalized preemption 166
A multi-resource Job Shop Scheduling Problem 163
Stable Routing under the Spanning Tree Protocol 160
A branch and bound algorithm for a generalized Job Shop Scheduling problem 159
On a Stackelberg Subset Sum Game 152
Competitive algorithms for the bicriteria k-server problem 151
Maximin fairness in project budget allocation 151
Subset Weight Maximization with Two Competing Agents 150
Price of Fairness for Multiagent Subset Sum Problems 149
On-line scheduling with setup costs 145
Single machine scheduling problems with generalized preemption 144
Strategies for single-machine multi-agent scheduling problems 143
Coordinamento di una supply network nel settore del fashion 141
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. 139
On the Stackelberg knapsack game 139
Scheduling two chains on parallel dedicated machines 137
Radio Resource Allocation in OFDMA Cellular Systems 137
Scheduling Two Chains on m Machines 137
Two Agents Single Machine Scheduling under a Coordination Mechanism 136
Minimum cost subset selection with two competing agents 133
Parallel Dedicated Machines Scheduling with Task-Precedence Constraints 133
Local Restoration for Trees and Arborescences under the Spanning Tree Protocol 132
Optimal channel allocation in OFDMA multi-cell systems 130
Optimal allocation plan for distribution centers of a frozen food company 128
Swapping failing arcs in shortest path arborescences 128
Part batching and scheduling in a flexible cell to minimize setup costs 125
On a resource-constrained Job Shop Scheduling Problem 124
A Stackelberg knapsack game with weight control 122
Coordinating stakeholders in a fashion supply network 116
A COMPARISON OF EXACT AND HEURISTIC METHODS FOR A FACILITY LOCATION PROBLEM 109
Two Stackelberg Knapsack games 101
The price of fairness in two-agent scheduling 97
Single machine scheduling with bounded job rearrangements 95
The Price of Fairness in a Two-Agent Single-Machine Scheduling Problem . 92
Lower bounds for a meal pickup-and-delivery scheduling problem 86
Constrained Job Rearrangements on a Single Machine 81
Optimally rescheduling jobs under LIFO constraints 79
Scheduling for last-mile meal-delivery processes 75
Fairness-utility trade-off in multi-agent scheduling 75
Optimally rescheduling jobs with a Last-In-First-Out buffer 74
On multi-agent knapsack problems 71
Totale 17.016
Salva come PNG Salva come JPEG
Categoria #
all - tutte 49.309
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 49.309
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020258 0 0 0 0 0 0 0 0 0 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/20252.636 22 56 306 67 85 110 1.052 640 264 34 0 0
Totale 17.791