NOBILI, Paolo
 Distribuzione geografica
Continente #
EU - Europa 1.655
NA - Nord America 693
AS - Asia 224
SA - Sud America 2
Continente sconosciuto - Info sul continente non disponibili 1
OC - Oceania 1
Totale 2.576
Nazione #
IT - Italia 770
US - Stati Uniti d'America 692
IE - Irlanda 538
SE - Svezia 129
UA - Ucraina 108
CN - Cina 63
SG - Singapore 55
HK - Hong Kong 49
IN - India 38
FI - Finlandia 33
BE - Belgio 20
TR - Turchia 14
GB - Regno Unito 12
RO - Romania 10
NL - Olanda 9
DE - Germania 6
PT - Portogallo 6
RU - Federazione Russa 4
VN - Vietnam 3
AT - Austria 2
BR - Brasile 2
DK - Danimarca 2
AU - Australia 1
CA - Canada 1
ES - Italia 1
EU - Europa 1
FR - Francia 1
GR - Grecia 1
HU - Ungheria 1
IL - Israele 1
PL - Polonia 1
SK - Slovacchia (Repubblica Slovacca) 1
TH - Thailandia 1
Totale 2.576
Città #
Lecce 719
Dublin 538
Chandler 135
Jacksonville 70
West Jordan 64
Wayanad 38
Princeton 35
Ann Arbor 34
Singapore 31
Central District 25
Des Moines 24
Brussels 18
New York 18
Brooklyn 17
Boardman 14
Wilmington 14
Central 11
Kocaeli 11
Shanghai 11
Ogden 10
Rome 9
Amsterdam 8
Cedar Knolls 8
Hong Kong 8
Timișoara 8
Bologna 5
Jinan 5
Zola Predosa 5
Guangzhou 4
Beijing 3
Hangzhou 3
Hanoi 3
Istanbul 3
London 3
Nanjing 3
Ashburn 2
Aveiro 2
Braga 2
Edinburgh 2
Florence 2
Grafing 2
Grottaglie 2
Horia 2
Islington 2
Jiaxing 2
Los Angeles 2
Matino 2
Milan 2
Munich 2
North Bergen 2
Norwalk 2
Porto 2
Rio de Janeiro 2
Spoltore 2
Taizhou 2
Tappahannock 2
Bangkok 1
Bari 1
Bratislava 1
Brisbane 1
Budapest 1
Changsha 1
Chenzhou 1
Copenhagen 1
Dallas 1
Frankfurt am Main 1
Fuzhou 1
Handan 1
Hebei 1
Lanciano 1
Lanzhou 1
Lappeenranta 1
Lequile 1
Madrid 1
Montreal 1
Moscow 1
Nanchang 1
Ningbo 1
Rotterdam 1
Saint Petersburg 1
San Jose 1
Santa Clara 1
Scorzè 1
Shenzhen 1
Stockholm 1
Tel Aviv 1
Tianjin 1
Torre Santa Susanna 1
Vibo Valentia 1
Vienna 1
Warsaw 1
Woodbridge 1
Wuxi 1
Xuzhou 1
Totale 1.995
Nome #
(0, +-1) Ideal Matrices 208
(0, +-1) Ideal Matrices 198
Improved approximation of maximum vertex cover 96
The Anti-join Composition and Polyhedra 83
On the Chromatic Polynomial of a Graph 82
Facets and Lifting Procedures for the Set Covering Polytope 82
An O(mlogn) algorithm for the weighted stable set problem in claw-free graphs with α(G)≤3 81
Non-Regular Square Bipartite Designs 78
An O(n√m) algorithm for the weighted stable set problem in claw, net-free graphs with α(G)≥4 75
A Lagrangian-based Heuristic for Large-scale Set Covering Problems 74
A 5/6-approximation algorithm for max vertex cover 74
Composition Operations for Clutters and Related Polyhedra 73
Capacity Allocation and Packet Routing in Ad-Hoc Wireless Networks 73
A decomposition algorithm for the weighted stable-set problem in claw-free graphs 73
Polyhedral Properties of Clutter Amalgam 72
Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem 71
Un Algoritmo Euristico per la Determinazione dei Turni del Personale Ferroviario 70
A Set Covering Formulation of the Matrix Equipartition Problem 68
Minimum Power Multicasting Problem in Wireless Networks 66
A Separation Routine for the Set Covering Polytope 64
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number 63
On the Satisfiability of Dependency Constraints in Entity-Relationship Schemata 63
Minimum Power Multicasting in Wireless Networks under Probabilistic Node Failures 63
Set Covering Problem 61
Turnazione del Personale 59
The relation of time indexed formulations of single machine scheduling problems to the node packing problem 58
A reduction algorithm for the weighted stable set problem in claw-free graphs 58
Mathematical models for the multicasting problem in wireless networks 56
Optimal Routing and Resource Allocation in Multi-Hop Wireless Networks 54
Two Conjectures on the Chromatic Polynomial 53
Preprocessing Techniques for the Multicast Problem in Wireless Networks 53
A MILP Algorithm for the Minimization of Train Delay and Energy Consumption. In: (a cura di): Sforza A., Sterle C., Optimization and Decision Science: Methodologies and Applications. ODS 2017. SPRINGER PROCEEDINGS IN MATHEMATICS & STATISTICS, vol. 217, p. 485-493, Springer, ISSN: 2194-1009, Sorrento, Italy, 4-7 September 2017, doi: https://doi.org/10.1007/978-3-319-67308-0_49 52
Routing and Scheduling in Wireless Ad Hoc Networks 49
A reduction algorithm for the weighted stable set problem in claw-free graphs 45
Solving efficiently the weighted stable-set problem in claw-free graphs using a reduction operation 43
Totale 2.591
Categoria #
all - tutte 14.201
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 14.201


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020259 0 0 0 0 0 89 45 56 13 14 42 0
2020/2021317 41 3 36 43 18 35 4 39 0 50 7 41
2021/2022201 6 0 17 10 47 5 3 14 4 3 36 56
2022/2023972 43 43 46 43 45 60 0 57 584 2 33 16
2023/2024296 20 13 7 9 25 23 2 0 21 110 46 20
2024/2025100 9 7 12 19 45 8 0 0 0 0 0 0
Totale 2.591