MOSCA, Raffaele

MOSCA, Raffaele  

DIPARTIMENTO DI ECONOMIA  

Mostra records
Risultati 1 - 20 di 68 (tempo di esecuzione: 0.025 secondi).
Titolo Data di pubblicazione Autore(i) File
A model for the economic and environmental optimization of integrated waste management systems 2017 Mosca, R.; Tascione, V.; Raggi, A.
A note on hospital financing: local financing vs. central financing 2022 Mosca, Raffaele
A property about minimum edge- and minimum clique-cover of a graph 2001 Mosca, Raffaele
A proposal of an economic optimization model for sustainable waste management 2020 Tascione, V.; Mosca, R.; Raggi, A.
A shy invariant of graphs 2002 Mosca, Raffaele
A sufficient condition to extend polynomial results for the Maximum Independent Set Problem 2017 Mosca, Raffaele
A time expanded version of the (Hitchcock-) tranportation problem 2011 Mosca, Raffaele
Chordal co-gem-free and ($P_5,{\rm gem}$)-free graphs have bounded clique-width 2005 A., Brandstadt; H. O., Le; Mosca, Raffaele
Combining decomposition approaches for the Maximum Weight Stable Set problem 2023 Brandstädt, A; Mosca, R
Dominating induced matchings for P 7-free graphs in linear time 2011 Brandstädt, Andreas; Mosca, Raffaele
Dominating induced matchings for P7-free graphs in linear time 2014 A., Brandstädt; Mosca, Raffaele
Dominating induced matchings in S1,2,4-free graphs 2020 Brandstädt, Andreas; Mosca, Raffaele
Environmental optimization of waste management systems by integrating LCA and linear programming: a simulation 2012 Tascione, Valentino; Mosca, Raffaele; Raggi, Andrea
Finding Dominating Induced Matchings in P-9-Free Graphs in Polynomial Time 2022 Brandstadt, A; Mosca, R
Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time 2016 Brandstädt, Andreas; Mosca, Raffaele
Finding dominating induced matchings in S1,1,5-free graphs in polynomial time 2020 Brandstadt, A.; Mosca, R.
Finding dominating induced matchings in S2,2,3-free graphs in polynomial time 2020 Brandstadt, A.; Mosca, R.
Gem- and co-gem-free graphs have bounded clique-width 2004 A., Brandstadt; H. O., Le; Mosca, Raffaele
How to allocate hard candies fairly 2007 Dall'Aglio, Marco; Mosca, Raffaele
Independent domination in finitely defined classes of graphs: Polynomial algorithms 2015 Lozin, Vadim; Mosca, Raffaele; Purcell, Christopher