Raffaele Mosca

发表

Optimizing the environmental performance of integrated waste management scenarios by means of linear programming: a case study

Valentino Tascione, Raffaele Mosca, Andrea Raggi, 2016 .

The stable set polytope for some extensions of P4-free graphs

Raffaele Mosca, R. Mosca, 2009, Discret. Math..

Dominating Induced Matchings for P8-free Graphs in Polynomial Time pdf

Andreas Brandstädt, Raffaele Mosca, 2015, ArXiv.

Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca, 2020, Discret. Appl. Math..

More results on weighted independent domination

Vadim V. Lozin, Raffaele Mosca, Viktor Zamaraev, 2017, Theor. Comput. Sci..

On (P5, diamond)-free graphs

Raffaele Mosca, Claudio Arbib, 2002, Discret. Math..

The stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs pdf

Raffaele Mosca, R. Mosca, 2014, ArXiv.

Maximum independent sets in subclasses of P5-free graphs

Vadim V. Lozin, Raffaele Mosca, V. Lozin, 2009, Inf. Process. Lett..

Finding Efficient Domination for P8-Free Bipartite Graphs in Polynomial Time pdf

Andreas Brandstädt, Raffaele Mosca, 2021, ArXiv.

Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number

Raffaele Mosca, Paolo Nobili, 2015, Graphs Comb..

How to allocate hard candies fairly

Raffaele Mosca, Marco Dall'Aglio, M. Dall’Aglio, 2007, Math. Soc. Sci..

Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs pdf

Andreas Brandstädt, Raffaele Mosca, Suhail Mahfud, 2016, ArXiv.

Finding Dominating Induced Matchings in P9-Free Graphs in Polynomial Time pdf

Andreas Brandstädt, Raffaele Mosca, 2019, ArXiv.

LCA and Linear Programming for the Environmental Optimization of Waste Management Systems: A Simulation

Valentino Tascione, Raffaele Mosca, Andrea Raggi, 2014 .

New Results on Weighted Independent Domination

Vadim V. Lozin, Raffaele Mosca, Viktor Zamaraev, 2017, WG.

On Stable Cutsets in Claw-Free Graphs and Planar Graphs

Raffaele Mosca, Van Bang Le, Haiko Müller, 2005, WG.

Independent sets in (P4+P4, Triangle)-free graphs pdf

Raffaele Mosca, 2020, ArXiv.

Maximum weight independent set for ℓclaw-free graphs in polynomial time

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2016, Discret. Appl. Math..

Independent domination in finitely defined classes of graphs: Polynomial algorithms

Vadim V. Lozin, Christopher Purcell, Raffaele Mosca, 2015, Discret. Appl. Math..

Polar graphs and maximal independent sets

Raffaele Mosca, Vadim V. Lozin, V. Lozin, 2006, Discret. Math..

14 Years of agcom, What Has Changed in the Italian tlc since 1998

Raffaele Mosca, 2012 .

A sufficient condition to extend polynomial results for the Maximum Independent Set Problem

Raffaele Mosca, R. Mosca, 2017, Discret. Appl. Math..

Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs

Andreas Brandstädt, Raffaele Mosca, 2020, Discret. Appl. Math..

On the structure and stability number of P5- and co-chair-free graphs

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2003, Discret. Appl. Math..

Dominating Induced Matchings for P7-Free Graphs in Linear Time

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2011, Algorithmica.

Dominating Induced Matchings for P7-Free Graphs in Linear Time

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2011, Algorithmica.

Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time pdf

Andreas Brandstädt, Raffaele Mosca, 2015, ArXiv.

On distance-3 matchings and induced matchings

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2009, Discret. Appl. Math..

A Shy Invariant of Graphs

Raffaele Mosca, 2002, Graphs Comb..

Finding Efficient Domination for S1, 3, 3-Free Bipartite Graphs in Polynomial Time pdf

Andreas Brandstädt, Raffaele Mosca, 2020, ArXiv.

A proposal of an economic optimization model for sustainable waste management

Valentino Tascione, Raffaele Mosca, Andrea Raggi, 2021 .

Maximum regular induced subgraphs in 2 P3-free graphs

Vadim V. Lozin, Raffaele Mosca, V. Lozin, 2012, Theor. Comput. Sci..

On Chordal-k-Generalized Split Graphs pdf

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2017, ArXiv.

Stable sets for (P6, K2, 3)-free graphs

Raffaele Mosca, 2012, Discuss. Math. Graph Theory.

Some observations on maximum weight stable sets in certain P

Raffaele Mosca, 2008, Eur. J. Oper. Res..

Finding Dominating Induced Matchings in $$P_8$$P8-Free Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca, 2016, Algorithmica.

Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2015, Discret. Appl. Math..

Weighted Efficient Domination for P5-Free and P6-Free Graphs

Andreas Brandstädt, Raffaele Mosca, 2016, SIAM J. Discret. Math..

On stable cutsets in claw-free graphs and planar graphs

Raffaele Mosca, Van Bang Le, Haiko Müller, 2005, J. Discrete Algorithms.

On variations of P4-sparse graphs

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2003, Discret. Appl. Math..

Stable Sets in Certain P6-free Graphs

Raffaele Mosca, 1999, Discret. Appl. Math..

Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs

Raffaele Mosca, R. Mosca, 1997, Inf. Process. Lett..

On Efficient Domination for Some Classes of H-Free Chordal Graphs

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2017, Electron. Notes Discret. Math..

Independent Domination versus Weighted Independent Domination pdf

Vadim V. Lozin, Victor Zamaraev, Raffaele Mosca, 2020, Inf. Process. Lett..

New Graph Classes of Bounded Clique-Width

Feodor F. Dragan, Andreas Brandstädt, Raffaele Mosca, 2002, WG.

Stable set and clique polytopes of (P5, gem)-free graphs

Caterina De Simone, Raffaele Mosca, C. Simone, 2007, Discret. Math..

Independent sets in extensions of 2K2-free graphs

Vadim V. Lozin, Raffaele Mosca, V. Lozin, 2005, Discret. Appl. Math..

On Efficient Domination for Some Classes of H-Free Bipartite Graphs pdf

Andreas Brandstädt, Raffaele Mosca, 2019, Discret. Appl. Math..

Sparse regular induced subgraphs in 2P3-free graphs

Vadim V. Lozin, Christopher Purcell, Raffaele Mosca, 2013, Discret. Optim..

Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time

Andreas Brandstädt, Raffaele Mosca, 2020, Discret. Appl. Math..

Independent Sets of Maximum Weight in Apple-Free Graphs

Vadim V. Lozin, Andreas Brandstädt, Raffaele Mosca, 2008, ISAAC.

Stable sets of maximum weight in (P7, banner)-free graphs

Raffaele Mosca, R. Mosca, 2008, Discret. Math..

Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width

Andreas Brandstädt, Raffaele Mosca, Hoàng-Oanh Le, 2004, Int. J. Found. Comput. Sci..

On Distance-3 Matchings and Induced Matchings

Andreas Brandstädt, Raffaele Mosca, 2009, Graph Theory, Computational Intelligence and Thought.

Independent sets in (P6, diamond)-free graphs

Raffaele Mosca, R. Mosca, 2009, Discret. Math. Theor. Comput. Sci..

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

Raffaele Mosca, 2001, Graphs Comb..

New Graph Classes of Bounded Clique-Width

Feodor F. Dragan, Andreas Brandstädt, Raffaele Mosca, 2002, Theory of Computing Systems.

Maximum Weight Independent Sets for (S1, 2, 4, Triangle)-Free Graphs in Polynomial Time pdf

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2018, Theor. Comput. Sci..

On efficient domination for some classes of H-free chordal graphs

Andreas Brandstädt, Raffaele Mosca, 2020, Discret. Appl. Math..

Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width

Andreas Brandstädt, Raffaele Mosca, Hoàng-Oanh Le, 2005, Discret. Appl. Math..

On Independent Vertex Sets in Subclasses of Apple-Free Graphs

Vadim V. Lozin, Andreas Brandstädt, Raffaele Mosca, 2010, Algorithmica.

Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs

Andreas Brandstädt, Raffaele Mosca, 2016, WG.

Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull

Andreas Brandstädt, Raffaele Mosca, A. Brandstädt, 2012, Graphs Comb..

Independent Sets of Maximum Weight in Apple-Free Graphs

Vadim V. Lozin, Andreas Brandstädt, Raffaele Mosca, 2008, SIAM J. Discret. Math..

Some Results on Stable Sets for k-Colorable P6-Free Graphs and Generalizations

Raffaele Mosca, R. Mosca, 2012, Discret. Math. Theor. Comput. Sci..

Independent sets in (P4+P4, Triangle)-free graphs

Raffaele Mosca, R. Mosca, 2020, Graphs Comb..

Some results on maximum stable sets in certain P5-free graphs

Raffaele Mosca, 2003, Discret. Appl. Math..

Finding Dominating Induced Matchings in $(S_{2,2,3},S_{1,4,4})$-Free Graphs in Polynomial Time

Raffaele Mosca, Andreas Brandstadt, 2017 .

Maximum weight independent sets in (P6, co-banner)-free graphs

Raffaele Mosca, 2013, Inf. Process. Lett..