ORIOLO, GIANPAOLO
 Distribuzione geografica
Continente #
NA - Nord America 17.010
AS - Asia 1.620
EU - Europa 1.370
SA - Sud America 234
AF - Africa 23
OC - Oceania 7
Continente sconosciuto - Info sul continente non disponibili 4
Totale 20.268
Nazione #
US - Stati Uniti d'America 16.957
SG - Singapore 747
CN - Cina 304
DE - Germania 236
UA - Ucraina 232
BR - Brasile 186
RU - Federazione Russa 171
IT - Italia 170
VN - Vietnam 168
HK - Hong Kong 152
IE - Irlanda 144
SE - Svezia 141
GB - Regno Unito 81
KR - Corea 69
FI - Finlandia 60
JP - Giappone 53
FR - Francia 45
CA - Canada 33
NL - Olanda 23
IN - India 19
AR - Argentina 18
AT - Austria 16
BE - Belgio 16
BD - Bangladesh 15
ID - Indonesia 14
MX - Messico 13
IQ - Iraq 12
ES - Italia 10
PH - Filippine 9
PK - Pakistan 9
PL - Polonia 9
CL - Cile 8
AU - Australia 6
PE - Perù 6
VE - Venezuela 6
ZA - Sudafrica 6
CO - Colombia 5
TW - Taiwan 5
EG - Egitto 4
SA - Arabia Saudita 4
TR - Turchia 4
CH - Svizzera 3
EU - Europa 3
IR - Iran 3
JO - Giordania 3
MA - Marocco 3
MD - Moldavia 3
MY - Malesia 3
NP - Nepal 3
TH - Thailandia 3
TN - Tunisia 3
UY - Uruguay 3
AE - Emirati Arabi Uniti 2
AZ - Azerbaigian 2
BA - Bosnia-Erzegovina 2
EC - Ecuador 2
ET - Etiopia 2
GT - Guatemala 2
IL - Israele 2
KE - Kenya 2
LB - Libano 2
LT - Lituania 2
PS - Palestinian Territory 2
RO - Romania 2
UZ - Uzbekistan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AL - Albania 1
AO - Angola 1
BB - Barbados 1
BH - Bahrain 1
BT - Bhutan 1
CI - Costa d'Avorio 1
DO - Repubblica Dominicana 1
GD - Grenada 1
GE - Georgia 1
GR - Grecia 1
JM - Giamaica 1
KH - Cambogia 1
KI - Kiribati 1
KW - Kuwait 1
LA - Repubblica Popolare Democratica del Laos 1
MN - Mongolia 1
NE - Niger 1
OM - Oman 1
PT - Portogallo 1
RS - Serbia 1
SV - El Salvador 1
SY - Repubblica araba siriana 1
Totale 20.268
Città #
Woodbridge 5.057
Wilmington 4.238
Houston 4.188
Fairfield 481
Singapore 434
Ann Arbor 350
Ashburn 291
Chandler 227
Jacksonville 211
Seattle 209
Cambridge 160
San Jose 157
Hong Kong 152
Dublin 143
Dearborn 124
Beijing 110
Medford 107
Council Bluffs 80
Santa Clara 69
The Dalles 61
Ho Chi Minh City 60
Rome 55
Lawrence 51
Hanoi 46
Los Angeles 46
Tokyo 42
Mülheim 33
New York 29
Buffalo 26
Moscow 24
Phoenix 23
San Diego 23
Lauterbourg 21
Milan 20
Daejeon 18
University Park 18
Brussels 16
Helsinki 15
Karlsruhe 15
Menlo Park 15
San Mateo 15
São Paulo 15
Boardman 14
London 14
Dallas 13
Toronto 13
Nuremberg 12
Chicago 11
Columbus 11
Dong Ket 11
Jakarta 11
Shanghai 11
Amsterdam 10
Guangzhou 10
Haiphong 9
Norwalk 9
Redondo Beach 9
San Francisco 9
Zhengzhou 9
Atlanta 8
Falls Church 8
Florence 8
Stockholm 8
Warsaw 8
Orem 7
Redwood City 7
Saint Petersburg 7
Verona 7
Vienna 7
Frankfurt am Main 6
Montreal 6
Nanjing 6
Baghdad 5
Chennai 5
Denver 5
Johannesburg 5
Manila 5
Mountain View 5
North Bergen 5
Santiago 5
Uberlândia 5
Boston 4
Brooklyn 4
Buenos Aires 4
Da Nang 4
Dhaka 4
Fuzhou 4
Guarulhos 4
Indiana 4
Lahore 4
Lima 4
Newport Beach 4
Porto Alegre 4
Rio de Janeiro 4
Seoul 4
Auburn Hills 3
Bauru 3
Belo Horizonte 3
Berlin 3
Biên Hòa 3
Totale 17.870
Nome #
Scheduling of flexible flow lines in an automobile assembly plant 557
Design of trees in the hose model: The balanced case 486
A new algorithm for the maximum weighted stable set problem in claw-free graphs 482
A short proof of the VPN tree Routing conjecture on ring networks 472
A new algorithm for the maximum weighted stable set problem in claw-free graphs 471
Reserving resilient capacity in a network 466
The stable set polytope of quasi-line graphs 461
Circular ones matrices and the stable set polytope of quasi-line graphs 453
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) 451
On coloring problems with local constraints 451
On coloring problems with local constraints 449
Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm 446
Clique family inequalities for the stable set polytope of quasi-line graphs 445
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) 443
Reserving resilient capacity for a single commodity with upper-bound constraints 441
Stable routing under the spanning tree protocol 439
Network design with a discrete set of traffic matrices 432
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs 431
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs 431
Patent number EP2008/25640: fine protection solution for multi-layer networks 422
On the recognition of fuzzy circular interval graphs 422
Dynamic routing in packet switching multilayer communication networks 421
The Online Replacement Path Problem 421
New approaches for virtual private network design 418
Clique-circulants and the stable set polytope of fuzzy circular interval graphs 418
On coloring problems with local constraints 414
The decision process for the material flow management in a FIAT car assembly plant 410
On the cubicity of certain graphs 409
An approximate A(*) algorithm and its application to the SCS problem 408
The Independent set problem and the thinness of a graph 408
Hardness of robust network design 407
Domination between traffic matrices 403
Minimum weighted clique cover on strip-composed perfect graphs 403
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property 400
A multilayer solution for path provisioning in new-generation optical/MPLS networks 399
The VPN problems with concave costs 399
Solving the weighted stable set problem in claw-free graphs via decomposition 392
Optimal design of a regional railway service in Italy 389
Protection of flows under targeted attacks 380
Strategy for dynamic routing and grooming of data flows into lightpaths in new generation network based on the GMPLS paradigm 376
Apparatus and method for traffic routing 374
An algorithmic decomposition of claw-free graphs leading to an O(n^3)-algorithm for the weighted stable set problem. 369
Building topology in communications networks 367
The hidden matching-structure of the composition of strips: a polyhedral perspective 364
Scheduling flexible flow lines in an automobile assembly plant 346
Rerouting flows when links fail 331
Circular one matrices and the stable set polytope of quasi-line graphs 300
Adaptivity in Network Interdiction 233
Single courier single restaurant meal delivery (without routing) 188
REROUTING FLOWS WHEN LINKS FAIL 64
Minimum weighted clique cover on claw-free perfect graphs 58
On the facets of stable set polytopes of circular interval graphs 49
Separation routine and extended formulations for the stable set problem in claw-free graphs 47
Courier assignment in meal delivery via integer programming: A case study in Rome 19
Avoiding Deadlocks via Weak Deadlock Sets 16
Totale 20.351
Categoria #
all - tutte 42.718
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.718


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021231 0 0 0 0 0 0 0 0 0 67 114 50
2021/2022543 38 53 51 22 15 52 26 15 30 57 40 144
2022/2023683 80 35 8 97 61 170 58 46 71 0 48 9
2023/2024153 37 7 10 3 13 21 3 1 1 15 1 41
2024/20251.036 31 247 112 46 7 112 80 87 65 76 86 87
2025/20261.831 147 113 181 104 224 65 301 236 226 234 0 0
Totale 20.351