MOSCA, Raffaele
 Distribuzione geografica
Continente #
NA - Nord America 1.551
EU - Europa 1.534
AS - Asia 659
Continente sconosciuto - Info sul continente non disponibili 6
SA - Sud America 2
AF - Africa 1
Totale 3.753
Nazione #
US - Stati Uniti d'America 1.548
CN - Cina 292
IT - Italia 285
UA - Ucraina 283
IE - Irlanda 253
SG - Singapore 197
SE - Svezia 167
GB - Regno Unito 163
FR - Francia 157
TR - Turchia 157
DE - Germania 87
FI - Finlandia 72
RU - Federazione Russa 46
BE - Belgio 8
IN - India 7
EU - Europa 6
CZ - Repubblica Ceca 4
IL - Israele 3
MX - Messico 2
PL - Polonia 2
SI - Slovenia 2
BN - Brunei Darussalam 1
CA - Canada 1
CH - Svizzera 1
CL - Cile 1
CO - Colombia 1
ES - Italia 1
NL - Olanda 1
OM - Oman 1
RO - Romania 1
SC - Seychelles 1
SK - Slovacchia (Repubblica Slovacca) 1
VN - Vietnam 1
Totale 3.753
Città #
Jacksonville 314
Chandler 282
Dublin 245
Singapore 167
Dearborn 157
Southend 132
Princeton 128
Izmir 98
Nanjing 87
Ann Arbor 55
Cambridge 54
Altamura 46
Wilmington 46
Beijing 45
Santa Clara 42
Ashburn 34
Nanchang 33
Helsinki 27
Woodbridge 22
Shenyang 19
Kunming 17
Francavilla Al Mare 15
Hebei 14
Pescara 14
New York 12
Rome 10
Tianjin 10
Jiaxing 9
Brussels 8
Hangzhou 8
Hefei 8
Kocaeli 8
Boardman 7
Chieti 7
Los Angeles 7
Norwalk 7
Changsha 6
Lanzhou 6
Grevenbroich 5
Guangzhou 5
Teramo 5
Giulianova 4
Leeds 4
Padova 4
Trieste 4
Washington 4
Changchun 3
Chengdu 3
Jinan 3
Nottingham 3
Olomouc 3
Portoscuso 3
Pune 3
Rocca San Casciano 3
Seattle 3
Sormano 3
Ascoli Piceno 2
Bristol 2
Capua 2
Dob pri Sentvidu 2
Dundee 2
Ferrara 2
Houston 2
Isernia 2
Mexico City 2
Milan 2
Mumbai 2
Napoli 2
North Bergen 2
Orange 2
Pisa 2
Polska 2
Ravenna 2
San Salvo 2
San Vito Chietino 2
Spoltore 2
Taizhou 2
Velletri 2
Xi'an 2
Xian 2
Adliswil 1
Ameno 1
Amsterdam 1
Auburn Hills 1
Bagnacavallo 1
Bandar Seri Begawan 1
Bergamo 1
Bogotá 1
Brooklyn 1
Edinburgh 1
Falkenstein 1
Frankfurt am Main 1
Fuzhou 1
Glen Burnie 1
Guiyang 1
Hamm 1
Hanoi 1
London 1
Madrid 1
Moscow 1
Totale 2.339
Nome #
null 92
Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time 90
A model for the economic and environmental optimization of integrated waste management systems 89
“LCA e modelli di programmazione lineare per la scelta di scenari nella gestione integrata dei rifiuti” 84
Polynomial algortithms for the maximum stable set problem on particular classes of $P_5$-free graphs 81
How to allocate hard candies fairly 80
Environmental optimization of waste management systems by integrating LCA and linear programming: a simulation 79
LCA and linear programming for the environmental optimization of waste management systems: a simulation 79
Stable set and clique polytope of (P5,gem)-free graphs 77
A property about minimum edge- and minimum clique-cover of a graph 75
Independent domination versus weighted independent domination 75
New graph classes of bounded clique-width 73
Stable sets in certain $P_6$-free graphs 72
Maximum weight independent set for lclaw-free graphs in polynomial time 70
Chordal co-gem-free and ($P_5,{\rm gem}$)-free graphs have bounded clique-width 69
The stable set polytope for some extensions of $P_4$-free graphs 67
A sufficient condition to extend polynomial results for the Maximum Independent Set Problem 67
On variations of P4-free graphs 66
Weighted efficient Domination for P5-free and P6-free graphs 65
Dominating induced matchings for P 7-free graphs in linear time 65
Gem- and co-gem-free graphs have bounded clique-width 64
A time expanded version of the (Hitchcock-) tranportation problem 63
Some observations on maximum weight stable sets in certain $P_5$-free graphs 62
Some results on maximum stable sets in certain $P_5$-free graphs 61
Independent sets in extensions of $2K_2$-free graphs 61
Weighted efficient domination for P6-free and for P5-free graphs 61
On the structure and stability number of $P_5$- and chair-free graphs 60
On independent vertex sets in subclasses of apple-free graphs 60
On distance-3 matchings and induced matchings 60
A shy invariant of graphs 59
New graph classes of bounded clique-width 59
Stable sets of maximum weight in ($P_7$,banner)-free graphs 59
Independent sets in ($P_6$,diamond)-free graphs 59
Stable sets for (P6,K_{2,3})-free graphs 59
Some results on stable sets for k-colorable P6-free graphs and generalizations 59
Polar graphs and maximal independent sets 58
On stable cutsets in claw-free graphs and planar graphs 56
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number 56
New results on weighted independent domination 56
Independent sets of maximum weight in apple-free graphs 55
On stable cutsets in claw-free graphs and planar graphs 54
On Efficient Domination for Some Classes of H-Free Chordal Graphs 53
More results on weighted independent domination 52
null 52
On distance-3 matchings and induced matchings 51
Maximum Weight Independent Sets for (P7,triangle)-free graphs in polynomial time 51
Maximum independent setsin subclasses of $P_5$-free graphs 51
Polynomial algorithms for special cases of the balanced completge bipartite subgraph problem 50
On ($P_5$,diamond)-free graphs 49
Independent domination in finitely defined classes of graphs: Polynomial algorithms 49
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull 48
Maximum regular induced subgraphs in 2P3-free graphs 47
Sparse regular induced subgraphs in 2P3-free graphs 47
Dominating induced matchings for P7-free graphs in linear time 46
A proposal of an economic optimization model for sustainable waste management 44
On efficient domination for some classes of H-free bipartite graphs 39
Maximum weight independent sets in (P6,co-banner)-free graphs 38
Dominating induced matchings in S1,2,4-free graphs 36
A note on hospital financing: local financing vs. central financing 34
Maximum weight independent sets for (S1,2,4,triangle)-free graphs in polynomial time 31
New Results on Independent Sets in Extensions of 2K(2)-free Graphs 29
Independent Sets in (P4+ P4 ,Triangle)-Free Graphs 28
Finding dominating induced matchings in S1,1,5-free graphs in polynomial time 26
On efficient domination for some classes of H-free chordal graphs 25
Independent sets of maximum weight in apple-free graphs 24
Finding dominating induced matchings in S2,2,3-free graphs in polynomial time 24
The stable set polytope of ($P_6$,triangle)-free graphs and new facet-inducing graphs 23
Optimizing the environmental performance of integrated waste management scenarios by means of linear programming: a case study 23
Finding Dominating Induced Matchings in P-9-Free Graphs in Polynomial Time 20
Combining decomposition approaches for the Maximum Weight Stable Set problem 14
Finding dominating induced matchings in P10-free graphs in polynomial time 12
Totale 3.872
Categoria #
all - tutte 16.516
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 16.516


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020469 0 0 0 0 78 98 109 79 18 14 70 3
2020/2021379 48 1 64 15 48 74 8 2 33 56 18 12
2021/2022305 8 14 10 62 8 1 8 21 27 11 60 75
2022/2023858 78 101 58 92 83 158 56 62 107 12 24 27
2023/2024298 28 15 17 5 18 82 85 13 0 7 3 25
2024/2025353 65 151 100 11 26 0 0 0 0 0 0 0
Totale 3.872