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