Benvenuti nell'Anagrafe della Ricerca d'Ateneo

NICOSIA, GAIA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.454
EU - Europa 5.681
AS - Asia 2.100
AF - Africa 109
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 5
SA - Sud America 1
Totale 14.363
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.445
DK - Danimarca 1.963
CN - Cina 1.794
GB - Regno Unito 1.432
SE - Svezia 623
DE - Germania 478
IT - Italia 308
UA - Ucraina 305
VN - Vietnam 234
FI - Finlandia 145
RU - Federazione Russa 119
IE - Irlanda 108
CI - Costa d'Avorio 106
AL - Albania 83
TR - Turchia 39
BE - Belgio 30
FR - Francia 24
NL - Olanda 20
IN - India 16
AU - Australia 13
AT - Austria 10
RO - Romania 10
CA - Canada 9
SI - Slovenia 5
A2 - ???statistics.table.value.countryCode.A2??? 4
MD - Moldavia 4
PT - Portogallo 4
CH - Svizzera 3
JP - Giappone 3
SG - Singapore 3
BD - Bangladesh 2
IQ - Iraq 2
NO - Norvegia 2
SN - Senegal 2
BG - Bulgaria 1
BR - Brasile 1
EU - Europa 1
GR - Grecia 1
HU - Ungheria 1
ID - Indonesia 1
IR - Iran 1
LK - Sri Lanka 1
LU - Lussemburgo 1
LV - Lettonia 1
MY - Malesia 1
NP - Nepal 1
PH - Filippine 1
SA - Arabia Saudita 1
ZA - Sudafrica 1
Totale 14.363
Salva come PNG Salva come JPEG
Città #
Southend 1.296
Woodbridge 948
Fairfield 847
Wilmington 534
Houston 487
Ann Arbor 469
Chandler 435
Ashburn 428
Seattle 409
Nanjing 362
Cambridge 332
Dearborn 239
Jacksonville 238
Dong Ket 234
Princeton 169
Beijing 156
Shenyang 144
Nanchang 143
Rome 125
Jinan 120
Hebei 119
Dublin 106
Bremen 104
Changsha 104
Plano 99
Tianjin 70
Jiaxing 67
Helsinki 65
Orange 63
Redwood City 56
Guangzhou 50
Izmir 39
Kunming 38
Zhengzhou 38
San Diego 37
Shanghai 37
Hefei 34
Hangzhou 31
Haikou 30
Taizhou 29
Brussels 28
Ningbo 26
Altamura 21
Lanzhou 21
London 20
San Paolo di Civitate 20
Eitensheim 19
Taiyuan 17
Boardman 16
Fuzhou 16
Milan 14
Venezia 14
Walnut 14
Pune 11
Flushing 9
Verona 9
Fort Worth 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
Los Angeles 5
Stevenage 5
Toronto 5
Trieste 5
Chicago 4
Dallas 4
Edinburgh 4
Nanning 4
Norwalk 4
Acton 3
Alatri 3
Chengdu 3
Chongqing 3
Graz 3
Hanover 3
Hongtong 3
Islington 3
Monterotondo 3
North York 3
Quzhou 3
Wuhan 3
Yicheng 3
Aprilia 2
Arsiero 2
Auburn Hills 2
Baghdad 2
Bethesda 2
Chisinau 2
Colleferro 2
Totale 9.793
Salva come PNG Salva come JPEG
Nome #
Two Agents Competing for a Shared Machine 257
10th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011) 255
10th cologne-twente workshop on graphs and combinatorial optimization (CTW 2011) 248
Price of Fairness for allocating a bounded resource 221
A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models 210
Exact algorithms for a discrete metric labeling problem 207
An exact algorithm for a multicommodity min-cost flow over time problem 204
Optimally balancing assembly lines with different workstations 203
Strategies in Competing Subset Selection 202
Competitive multi-agent scheduling with an iterative selection rule 202
Maximin Fairness-profit Tradeoff in Project Budget Allocation 200
Subset Weight Maximization with Two Competing Agents 199
A job-shop problem with one additional resource type 198
Brief announcement: the fair subset sum problem 198
Optimal power control in OFDMA cellular networks 196
Cheapest paths in dynamic networks 196
On-line load balancing made simple: Greedy strikes back 195
Local Restoration for Trees and Arborescences 194
Optimally Balancing Assembly Lines with Different Workstations 194
Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines 193
Assessing the quality of heuristic solutions to parallel machines min-max scheduling problems 191
On-line load balancing made simple: Greedy strikes back 191
Decentralized route guidance algorithms in urban transportation networks 188
Decentralized algorithms for multiple path routing in urban transportation networks 184
Cyclic Schedules for Pipeline Assembly Processes 181
Robust paths in urban transportation networks 181
Scheduling tasks with comb precedence constraints on dedicated machines 180
A Heuristic Approach to Batching and Scheduling a Single Machine to Minimize Setup Costs 179
An approximate A* algorithm and its application to the SCS problem, 179
Optimal channel allocation in OFDMA multi-cell systems 177
Scheduling three chains on two parallel machines 175
Sequencing a batching flexible cell to minimise set-up costs 173
Exact algorithms for a discrete metric labeling problem 169
On the bicriteria k-server problem 166
Competitive subset selection with two agents 164
Efficient offline algorithms for the bicriteria k-server problem and online applications 164
The Subset Sum game 161
On multicriteria online problems 160
Exact algorithms for a discrete metric labeling problem 160
Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds 159
Parallel dedicated machines scheduling with chain precedence constraints 159
Robust single machine scheduling with external-party jobs 159
Single machine scheduling problems with generalized preemption 158
Minimum Cost Paths Over Dynamic Networks 158
Local Restoration for Trees and Arborescences 157
Competitive algorithms for the bicriteria k-server problem 156
Minimum Cost Multi-Product Flow Lines 156
Two Agent Scheduling with a Central Selection Mechanism 156
Maximin Fairness in Project Budget Allocation 155
Minimum cost paths over dynamic networks 154
Scheduling Two Agent Task Chains with a Central Selection Mechanism 152
Single machine scheduling problems with generalized preemption 152
Robust single machine scheduling with a flexible maintenance activity 151
Stable Routing under the Spanning Tree Protocol 148
Profit-fairness trade-off in project selection 148
A column generation approach to a class of single-machine preemptive scheduling problems 147
Cellular Radio Resource Allocation Problem 144
An exact algorithm for a multicommodity min-cost flow over time problem 142
A branch and bound algorithm for a generalized Job Shop Scheduling problem 141
Price of fairness in two-agent single-machine scheduling problems 139
A multi-resource Job Shop Scheduling Problem 138
Competitive algorithms for the bicriteria k-server problem 137
Maximin fairness in project budget allocation 137
Price of Fairness for Multiagent Subset Sum Problems 136
Build or merge: Locational decisions in mobile access networks 135
A branch and bound algorithm for a generalized Job Shop Scheduling problem 133
Subset Weight Maximization with Two Competing Agents 132
On-line scheduling with setup costs 131
Coordinamento di una supply network nel settore del fashion 128
Strategies for single-machine multi-agent scheduling problems 126
Two Agents Single Machine Scheduling under a Coordination Mechanism 121
Scheduling Two Chains on m Machines 121
Parallel Dedicated Machines Scheduling with Task-Precedence Constraints 119
Radio Resource Allocation in OFDMA Cellular Systems 118
Minimum cost subset selection with two competing agents 118
Scheduling two chains on parallel dedicated machines 117
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. 117
Local Restoration for Trees and Arborescences under the Spanning Tree Protocol 117
Optimal channel allocation in OFDMA multi-cell systems 115
Single machine scheduling problems with generalized preemption 115
Optimal allocation plan for distribution centers of a frozen food company 114
Swapping failing arcs in shortest path arborescences 114
Part batching and scheduling in a flexible cell to minimize setup costs 112
On a Stackelberg Subset Sum Game 110
On a resource-constrained Job Shop Scheduling Problem 110
Coordinating stakeholders in a fashion supply network 98
On the Stackelberg knapsack game 96
A Stackelberg knapsack game with weight control 93
A COMPARISON OF EXACT AND HEURISTIC METHODS FOR A FACILITY LOCATION PROBLEM 77
Two Stackelberg Knapsack games 76
The price of fairness in two-agent scheduling 67
The Price of Fairness in a Two-Agent Single-Machine Scheduling Problem . 67
Single machine scheduling with bounded job rearrangements 66
Optimally rescheduling jobs under LIFO constraints 56
Constrained Job Rearrangements on a Single Machine 47
Scheduling for last-mile meal-delivery processes 44
Fairness-utility trade-off in multi-agent scheduling 44
Rescheduling jobs with a LIFO buffer 43
Optimally rescheduling jobs with a Last-In-First-Out buffer 43
Lower bounds for a meal pickup-and-delivery scheduling problem 42
Totale 14.716
Salva come PNG Salva come JPEG
Categoria #
all - tutte 36.059
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 36.059
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019980 0 0 0 0 0 0 0 0 0 0 514 466
2019/20203.844 883 256 185 279 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/2024633 34 48 68 27 44 90 47 226 15 33 1 0
Totale 14.984