CINECA IRIS Institutional Research Information System

GALLI, LAURA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.547
AS - Asia 1.403
EU - Europa 1.216
SA - Sud America 189
AF - Africa 88
OC - Oceania 6
Totale 6.449
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.478
IT - Italia 525
CN - Cina 470
SG - Singapore 405
HK - Hong Kong 252
SE - Svezia 199
BR - Brasile 156
DE - Germania 96
BG - Bulgaria 91
GB - Regno Unito 87
VN - Vietnam 76
RU - Federazione Russa 51
CA - Canada 48
CI - Costa d'Avorio 44
FI - Finlandia 39
IN - India 37
TR - Turchia 33
JP - Giappone 24
KR - Corea 19
SN - Senegal 19
UA - Ucraina 19
NL - Olanda 17
BD - Bangladesh 16
FR - Francia 16
BE - Belgio 15
ES - Italia 11
PK - Pakistan 11
ID - Indonesia 10
PL - Polonia 10
AR - Argentina 9
CO - Colombia 9
IQ - Iraq 9
MX - Messico 9
ZA - Sudafrica 9
IE - Irlanda 7
AU - Australia 6
GR - Grecia 6
JO - Giordania 5
MY - Malesia 5
TW - Taiwan 5
BJ - Benin 4
CH - Svizzera 4
HU - Ungheria 4
JM - Giamaica 4
KE - Kenya 4
LT - Lituania 4
NP - Nepal 4
PE - Perù 4
PT - Portogallo 4
SA - Arabia Saudita 4
AL - Albania 3
AZ - Azerbaigian 3
PY - Paraguay 3
TH - Thailandia 3
UZ - Uzbekistan 3
VE - Venezuela 3
AT - Austria 2
CL - Cile 2
DK - Danimarca 2
EC - Ecuador 2
IR - Iran 2
MA - Marocco 2
NG - Nigeria 2
PA - Panama 2
PH - Filippine 2
TN - Tunisia 2
AM - Armenia 1
BB - Barbados 1
BM - Bermuda 1
BN - Brunei Darussalam 1
CR - Costa Rica 1
CZ - Repubblica Ceca 1
EE - Estonia 1
EG - Egitto 1
GA - Gabon 1
GE - Georgia 1
GT - Guatemala 1
HN - Honduras 1
KW - Kuwait 1
NO - Norvegia 1
OM - Oman 1
SK - Slovacchia (Repubblica Slovacca) 1
TT - Trinidad e Tobago 1
UY - Uruguay 1
Totale 6.449
Salva come PNG Salva come JPEG
Città #
Woodbridge 458
Ashburn 380
Fairfield 367
Ann Arbor 309
Houston 264
Hong Kong 230
Serra 230
Singapore 213
Santa Clara 180
Seattle 152
Wilmington 132
Dallas 129
Cambridge 122
Shanghai 118
Chandler 99
Sofia 90
Beijing 89
New York 75
Boardman 54
Princeton 54
Los Angeles 53
Bondeno 48
Abidjan 44
Lawrence 40
Medford 35
Florence 32
Lancaster 32
Ottawa 32
Des Moines 31
Crespellano 29
Dong Ket 27
Hefei 25
Nanjing 24
Redondo Beach 24
Tokyo 23
Dakar 19
Dearborn 19
San Diego 17
Buffalo 16
Frankfurt am Main 15
Seoul 15
Brussels 14
Istanbul 14
Council Bluffs 13
São Paulo 13
Falls Church 12
Fuzhou 12
Jacksonville 12
Pisa 12
Mountain View 11
Indiana 10
Pistoia 10
Ciampino 9
Helsinki 9
Ho Chi Minh City 9
Redwood City 9
Washington 9
Guangzhou 8
Johannesburg 8
Milan 8
Ogden 8
Phoenix 8
Bologna 7
Columbus 7
London 7
Rome 7
Aachen 6
Chennai 6
Denver 6
Hangzhou 6
Montreal 6
Munich 6
Quanzhou 6
Rio de Janeiro 6
San Jose 6
Shenzhen 6
The Dalles 6
Torino 6
Amman 5
Chengdu 5
Dhaka 5
Düsseldorf 5
Hebei 5
Hyderabad 5
Nanchang 5
Norwalk 5
San Vincenzo 5
Shenyang 5
Stockholm 5
Taipei 5
Tianjin 5
Viareggio 5
Wroclaw 5
Ankara 4
Bogotá 4
Boulder 4
Campinas 4
Cotonou 4
Easley 4
Moscow 4
Totale 4.766
Salva come PNG Salva come JPEG
Nome #
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G 304
Recoverable robustness for railway rolling stock planning 254
Minimizing power consumption in virtualized cellular networks 221
Optimal joint path computation and rate allocation for real-time traffic 207
A testbed for flexible and energy-efficient resource management with virtualized LTE-A nodes 193
Delay-constrained shortest paths: approximation algorithms and second-order cone models 190
Solution of the train platforming problem 186
Delay-constrained Routing Problems: Accurate Scheduling Models and Admission Control 180
Railway rolling stock planning: robustness against large disruptions 176
Scalability and energy efficiency of Coordinated Scheduling in cellular networks towards 5G 175
Flexible dynamic Coordinated Scheduling in Virtual-RAN deployments 173
A Lagrangian approach to Chance Constrained Routing with Local Broadcast 171
QoS Routing with worst-case delay constraints: models, algorithms and performance analysis 169
Towards Robust Admission Control in Delay-Constrained Routing Problems 167
A MILP Approach to DRAM Access Worst-Case Analysis 166
Demand uncertainty in robust Home Care optimization 165
Combinatorial and robust optimisation models and algorithms for railway applications 164
Gap inequalities for the max-cut problem: a cutting-plane algorithm 164
Modeling with stochastic programming, Alan J. King and Stein W. Wallace. 160
A matheuristic for integrated timetabling and vehicle scheduling 158
Strong formulations for the multi-module PESP and a quadratic algorithm for graphical diophantine equation systems 153
A compact variant of the QCR method for quadratically constrained quadratic 01 programs 150
Small bipartite subgraph polytopes 149
Gap inequalities for non-convex mixed-integer quadratic programs 148
Complexity results for the gap inequalities for the max-cut problem 146
An electromagnetism metaheuristic for the unicost set covering problem 146
On the Lovász theta function and some variants 145
New valid inequalities and facets for the Simple Plant Location Problem 145
A tutorial on non-periodic train timetabling and platforming problems 139
Delay-robust event scheduling 138
A Tool for Practical Integrated Time-Table Design and Vehicle Scheduling in Public Transport Systems 135
Solution of the Train Platforming Problem 134
A binarisation heuristic for non-convex quadratic programming with box constraints 133
Robust train routing and online re-scheduling 125
Modern Challenges in Timetabling 122
Bi-dimensional Assignment in 5G Periodic Scheduling 121
Recovery-robust platforming by network buffering 111
Recoverable robustness for scheduling with precedence constraints 109
Optimization Methods: An Applications-Oriented Primer 106
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem 104
Lagrangian approaches for QoS scheduling in computer networks 74
A separation algorithm for the simple plant location problem 66
Valid inequalities for quadratic optimisation with domain constraints 64
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem 59
On upper bounds for the multiple knapsack assignment problem 44
Totale 6.709
Salva come PNG Salva come JPEG
Categoria #
all - tutte 17.865
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 17.865
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021433 0 0 0 0 0 45 16 45 151 59 36 81
2021/2022578 25 31 13 30 102 85 15 31 42 44 41 119
2022/2023482 65 34 39 20 44 78 10 28 108 1 41 14
2023/2024390 19 23 52 21 73 93 6 11 13 17 15 47
2024/20251.239 12 51 15 80 139 81 132 71 137 156 141 224
2025/2026944 164 188 147 127 158 160 0 0 0 0 0 0
Totale 6.709