IRIS
ORIOLO, GIANPAOLO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 17.318
AS - Asia 1.696
EU - Europa 1.416
SA - Sud America 253
Continente sconosciuto - Info sul continente non disponibili 87
AF - Africa 24
OC - Oceania 7
Totale 20.801
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 17.256
SG - Singapore 758
CN - Cina 310
DE - Germania 236
UA - Ucraina 233
IT - Italia 210
BR - Brasile 196
RU - Federazione Russa 171
VN - Vietnam 170
HK - Hong Kong 152
IE - Irlanda 144
SE - Svezia 141
GB - Regno Unito 81
KR - Corea 69
BD - Bangladesh 63
FI - Finlandia 60
JP - Giappone 53
FR - Francia 47
CA - Canada 37
NL - Olanda 24
AR - Argentina 19
IN - India 19
AT - Austria 16
BE - Belgio 16
ID - Indonesia 15
MX - Messico 15
IQ - Iraq 12
CO - Colombia 11
ES - Italia 10
PH - Filippine 10
PK - Pakistan 10
PL - Polonia 10
CL - Cile 8
AU - Australia 6
PE - Perù 6
TR - Turchia 6
VE - Venezuela 6
ZA - Sudafrica 6
SA - Arabia Saudita 5
TW - Taiwan 5
EC - Ecuador 4
EG - Egitto 4
NP - Nepal 4
CH - Svizzera 3
EU - Europa 3
IR - Iran 3
JO - Giordania 3
MA - Marocco 3
MD - Moldavia 3
MY - Malesia 3
TH - Thailandia 3
TN - Tunisia 3
UY - Uruguay 3
AE - Emirati Arabi Uniti 2
AZ - Azerbaigian 2
BA - Bosnia-Erzegovina 2
DO - Repubblica Dominicana 2
ET - Etiopia 2
GE - Georgia 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
GD - Grenada 1
GR - Grecia 1
HT - Haiti 1
IS - Islanda 1
JM - Giamaica 1
KH - Cambogia 1
KI - Kiribati 1
KW - Kuwait 1
KZ - Kazakistan 1
LA - Repubblica Popolare Democratica del Laos 1
MN - Mongolia 1
NE - Niger 1
OM - Oman 1
PT - Portogallo 1
RS - Serbia 1
SC - Seychelles 1
SV - El Salvador 1
SY - Repubblica araba siriana 1
TT - Trinidad e Tobago 1
Totale 20.718
Salva come PNG Salva come JPEG
Città #
Woodbridge 5.057
Wilmington 4.238
Houston 4.190
Fairfield 481
Singapore 441
Ann Arbor 350
Ashburn 306
Chandler 228
San Jose 220
Jacksonville 212
Seattle 209
Cambridge 160
Hong Kong 152
Dublin 143
Council Bluffs 139
Dearborn 124
Beijing 111
Medford 107
Santa Clara 82
The Dalles 61
Ho Chi Minh City 60
Rome 60
Los Angeles 52
Lawrence 51
Hanoi 48
Tokyo 42
New York 35
Mülheim 33
Buffalo 27
Milan 25
Phoenix 25
Moscow 24
San Diego 23
Lauterbourg 21
Daejeon 18
São Paulo 18
University Park 18
Brussels 16
Dallas 16
Helsinki 15
Karlsruhe 15
Menlo Park 15
San Mateo 15
Toronto 15
Boardman 14
London 14
Columbus 13
Nuremberg 12
Chicago 11
Dong Ket 11
Jakarta 11
San Francisco 11
Shanghai 11
Amsterdam 10
Guangzhou 10
Norwalk 10
Haiphong 9
Redondo Beach 9
Zhengzhou 9
Atlanta 8
Falls Church 8
Florence 8
Stockholm 8
Verona 8
Warsaw 8
Orem 7
Redwood City 7
Saint Petersburg 7
Vienna 7
Denver 6
Frankfurt am Main 6
Montreal 6
Nanjing 6
Baghdad 5
Boston 5
Brasília 5
Brooklyn 5
Chennai 5
Johannesburg 5
Manila 5
Mountain View 5
North Bergen 5
Rio de Janeiro 5
Santiago 5
Springfield 5
Uberlândia 5
Belo Horizonte 4
Buenos Aires 4
Da Nang 4
Denton 4
Dhaka 4
Fuzhou 4
Guarulhos 4
Indiana 4
Lahore 4
Lima 4
Newport Beach 4
Philadelphia 4
Porto Alegre 4
Seoul 4
Totale 18.084
Salva come PNG Salva come JPEG
Nome #
Scheduling of flexible flow lines in an automobile assembly plant 573
Design of trees in the hose model: The balanced case 492
A new algorithm for the maximum weighted stable set problem in claw-free graphs 487
A new algorithm for the maximum weighted stable set problem in claw-free graphs 486
A short proof of the VPN tree Routing conjecture on ring networks 479
Reserving resilient capacity in a network 476
The stable set polytope of quasi-line graphs 467
Circular ones matrices and the stable set polytope of quasi-line graphs 460
On coloring problems with local constraints 458
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) 454
On coloring problems with local constraints 454
Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm 451
Clique family inequalities for the stable set polytope of quasi-line graphs 450
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) 450
Clique-circulants and the stable set polytope of fuzzy circular interval graphs 448
Reserving resilient capacity for a single commodity with upper-bound constraints 444
Stable routing under the spanning tree protocol 444
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs 438
Network design with a discrete set of traffic matrices 438
New approaches for virtual private network design 438
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs 437
Dynamic routing in packet switching multilayer communication networks 428
Patent number EP2008/25640: fine protection solution for multi-layer networks 427
The Online Replacement Path Problem 426
On the recognition of fuzzy circular interval graphs 424
The Independent set problem and the thinness of a graph 419
The decision process for the material flow management in a FIAT car assembly plant 417
On coloring problems with local constraints 417
Hardness of robust network design 416
On the cubicity of certain graphs 414
Domination between traffic matrices 410
An approximate A(*) algorithm and its application to the SCS problem 409
Minimum weighted clique cover on strip-composed perfect graphs 408
The VPN problems with concave costs 403
A multilayer solution for path provisioning in new-generation optical/MPLS networks 402
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property 402
Solving the weighted stable set problem in claw-free graphs via decomposition 396
Optimal design of a regional railway service in Italy 395
The hidden matching-structure of the composition of strips: a polyhedral perspective 387
Protection of flows under targeted attacks 387
Apparatus and method for traffic routing 386
Strategy for dynamic routing and grooming of data flows into lightpaths in new generation network based on the GMPLS paradigm 380
An algorithmic decomposition of claw-free graphs leading to an O(n^3)-algorithm for the weighted stable set problem. 376
Building topology in communications networks 375
Scheduling flexible flow lines in an automobile assembly plant 354
Rerouting flows when links fail 341
Circular one matrices and the stable set polytope of quasi-line graphs 305
Adaptivity in Network Interdiction 238
Single courier single restaurant meal delivery (without routing) 194
Courier assignment in meal delivery via integer programming: A case study in Rome 72
REROUTING FLOWS WHEN LINKS FAIL 72
Minimum weighted clique cover on claw-free perfect graphs 64
Separation routine and extended formulations for the stable set problem in claw-free graphs 56
On the facets of stable set polytopes of circular interval graphs 51
Avoiding Deadlocks via Weak Deadlock Sets 26
Totale 20.801
Salva come PNG Salva come JPEG
Categoria #
all - tutte 45.904
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 45.904
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022452 0 0 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/20262.013 147 113 181 104 224 65 301 236 226 237 128 51
2026/2027268 75 93 100 0 0 0 0 0 0 0 0 0
Totale 20.801