NOBILI, Paolo
 Distribuzione geografica
Continente #
EU - Europa 1.634
NA - Nord America 649
AS - Asia 190
SA - Sud America 2
Continente sconosciuto - Info sul continente non disponibili 1
Totale 2.476
Nazione #
IT - Italia 759
US - Stati Uniti d'America 648
IE - Irlanda 538
SE - Svezia 129
UA - Ucraina 108
CN - Cina 54
HK - Hong Kong 49
IN - India 38
FI - Finlandia 33
SG - Singapore 32
BE - Belgio 20
GB - Regno Unito 12
TR - Turchia 12
RO - Romania 10
PT - Portogallo 6
DE - Germania 4
NL - Olanda 4
RU - Federazione Russa 4
VN - Vietnam 3
BR - Brasile 2
DK - Danimarca 2
CA - Canada 1
ES - Italia 1
EU - Europa 1
FR - Francia 1
GR - Grecia 1
HU - Ungheria 1
IL - Israele 1
SK - Slovacchia (Repubblica Slovacca) 1
TH - Thailandia 1
Totale 2.476
Città #
Lecce 719
Dublin 538
Chandler 135
Jacksonville 70
West Jordan 64
Wayanad 38
Princeton 35
Ann Arbor 34
Central District 25
Des Moines 24
Singapore 20
Brussels 18
New York 18
Brooklyn 17
Boardman 14
Wilmington 14
Central 11
Kocaeli 11
Shanghai 11
Ogden 10
Cedar Knolls 8
Hong Kong 8
Timișoara 8
Bologna 5
Jinan 5
Zola Predosa 5
Amsterdam 4
Rome 4
Guangzhou 3
Hangzhou 3
Hanoi 3
London 3
Nanjing 3
Ashburn 2
Aveiro 2
Beijing 2
Braga 2
Edinburgh 2
Florence 2
Grafing 2
Grottaglie 2
Horia 2
Islington 2
Jiaxing 2
Los Angeles 2
Matino 2
Norwalk 2
Porto 2
Rio de Janeiro 2
Spoltore 2
Taizhou 2
Tappahannock 2
Bangkok 1
Bratislava 1
Budapest 1
Changsha 1
Copenhagen 1
Frankfurt am Main 1
Fuzhou 1
Hebei 1
Istanbul 1
Lanciano 1
Lanzhou 1
Lappeenranta 1
Lequile 1
Madrid 1
Montreal 1
Moscow 1
Nanchang 1
Ningbo 1
Saint Petersburg 1
San Jose 1
Scorzè 1
Shenzhen 1
Stockholm 1
Tel Aviv 1
Tianjin 1
Vibo Valentia 1
Woodbridge 1
Wuxi 1
Xuzhou 1
Totale 1.955
Nome #
(0, +-1) Ideal Matrices 192
(0, +-1) Ideal Matrices 187
Improved approximation of maximum vertex cover 94
On the Chromatic Polynomial of a Graph 79
The Anti-join Composition and Polyhedra 78
An O(mlogn) algorithm for the weighted stable set problem in claw-free graphs with α(G)≤3 78
Non-Regular Square Bipartite Designs 76
Facets and Lifting Procedures for the Set Covering Polytope 76
A 5/6-approximation algorithm for max vertex cover 73
An O(n√m) algorithm for the weighted stable set problem in claw, net-free graphs with α(G)≥4 73
A Lagrangian-based Heuristic for Large-scale Set Covering Problems 72
Capacity Allocation and Packet Routing in Ad-Hoc Wireless Networks 72
Composition Operations for Clutters and Related Polyhedra 70
Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem 70
A decomposition algorithm for the weighted stable-set problem in claw-free graphs 70
Un Algoritmo Euristico per la Determinazione dei Turni del Personale Ferroviario 68
Polyhedral Properties of Clutter Amalgam 67
A Set Covering Formulation of the Matrix Equipartition Problem 67
Minimum Power Multicasting Problem in Wireless Networks 64
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number 62
On the Satisfiability of Dependency Constraints in Entity-Relationship Schemata 62
Minimum Power Multicasting in Wireless Networks under Probabilistic Node Failures 62
A Separation Routine for the Set Covering Polytope 61
Set Covering Problem 59
A reduction algorithm for the weighted stable set problem in claw-free graphs 57
The relation of time indexed formulations of single machine scheduling problems to the node packing problem 56
Turnazione del Personale 54
Mathematical models for the multicasting problem in wireless networks 54
Optimal Routing and Resource Allocation in Multi-Hop Wireless Networks 53
Preprocessing Techniques for the Multicast Problem in Wireless Networks 52
Two Conjectures on the Chromatic Polynomial 51
Routing and Scheduling in Wireless Ad Hoc Networks 48
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 48
A reduction algorithm for the weighted stable set problem in claw-free graphs 44
Solving efficiently the weighted stable-set problem in claw-free graphs using a reduction operation 42
Totale 2.491
Categoria #
all - tutte 11.257
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 11.257


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020364 5 34 0 41 25 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
Totale 2.491