default search action
Raffaele Mosca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j52]Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in P10-free graphs in polynomial time. Theor. Comput. Sci. 990: 114404 (2024) - 2023
- [j51]Andreas Brandstädt, Raffaele Mosca:
Combining decomposition approaches for the Maximum Weight Stable Set problem. Theor. Comput. Sci. 960: 113914 (2023) - 2022
- [j50]Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in P9-free graphs in polynomial time. Discuss. Math. Graph Theory 42(4): 1139-1162 (2022) - [j49]Raffaele Mosca:
New Results on Independent Sets in Extensions of 2K2-free Graphs. Graphs Comb. 38(4): 127 (2022) - [i22]Raffaele Mosca:
A note on hospital financing: local financing vs. central financing. CoRR abs/2202.08102 (2022) - 2021
- [j48]Raffaele Mosca:
Independent Sets in (P4+P4, Triangle)-Free Graphs. Graphs Comb. 37(6): 2173-2189 (2021) - [j47]Andreas Brandstädt, Raffaele Mosca:
Maximum weight independent sets for (S1, 2, 4, triangle)-free graphs in polynomial time. Theor. Comput. Sci. 878-879: 11-25 (2021) - [i21]Andreas Brandstädt, Raffaele Mosca:
Finding Efficient Domination for P8-Free Bipartite Graphs in Polynomial Time. CoRR abs/2101.01772 (2021) - 2020
- [j46]Andreas Brandstädt, Raffaele Mosca:
Dominating induced matchings in S1, 2, 4-free graphs. Discret. Appl. Math. 278: 83-92 (2020) - [j45]Andreas Brandstädt, Raffaele Mosca:
On efficient domination for some classes of H-free chordal graphs. Discret. Appl. Math. 281: 81-95 (2020) - [j44]Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. Discret. Appl. Math. 283: 417-434 (2020) - [j43]Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time. Discret. Appl. Math. 284: 269-280 (2020) - [j42]Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
:
Independent domination versus weighted independent domination. Inf. Process. Lett. 156: 105914 (2020) - [i20]Raffaele Mosca:
Independent sets in (P4+P4, Triangle)-free graphs. CoRR abs/2003.08649 (2020) - [i19]Andreas Brandstädt, Raffaele Mosca:
Finding Efficient Domination for S1, 3, 3-Free Bipartite Graphs in Polynomial Time. CoRR abs/2008.04046 (2020) - [i18]Andreas Brandstädt, Raffaele Mosca:
Finding Efficient Domination for S1, 1, 5-Free Bipartite Graphs in Polynomial Time. CoRR abs/2010.16076 (2020)
2010 – 2019
- 2019
- [j41]Andreas Brandstädt, Raffaele Mosca:
On efficient domination for some classes of H-free bipartite graphs. Discret. Appl. Math. 270: 58-67 (2019) - [i17]Andreas Brandstädt, Raffaele Mosca:
Finding Dominating Induced Matchings in S1, 1, 5-Free Graphs in Polynomial Time. CoRR abs/1905.05582 (2019) - [i16]Andreas Brandstädt, Raffaele Mosca:
Finding Dominating Induced Matchings in P9-Free Graphs in Polynomial Time. CoRR abs/1908.00978 (2019) - 2018
- [j40]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. Discret. Appl. Math. 236: 57-65 (2018) - [j39]Andreas Brandstädt, Raffaele Mosca:
Maximum weight independent set for ℓclaw-free graphs in polynomial time. Discret. Appl. Math. 237: 57-64 (2018) - [i15]Andreas Brandstädt, Raffaele Mosca:
On Efficient Domination for Some Classes of H-Free Bipartite Graphs. CoRR abs/1806.00386 (2018) - [i14]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets for (S1, 2, 4, Triangle)-Free Graphs in Polynomial Time. CoRR abs/1806.09472 (2018) - 2017
- [j38]Andreas Brandstädt, Raffaele Mosca:
Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time. Algorithmica 77(4): 1283-1302 (2017) - [j37]Raffaele Mosca:
A sufficient condition to extend polynomial results for the Maximum Independent Set Problem. Discret. Appl. Math. 216: 281-289 (2017) - [j36]Andreas Brandstädt, Raffaele Mosca:
On Efficient Domination for Some Classes of H-Free Chordal Graphs. Electron. Notes Discret. Math. 62: 57-62 (2017) - [j35]Vadim V. Lozin
More results on weighted independent domination. Theor. Comput. Sci. 700: 63-74 (2017) - [c7]Vadim V. Lozin, Dmitriy S. Malyshev
New Results on Weighted Independent Domination. WG 2017: 399-411 - [i13]Andreas Brandstädt, Raffaele Mosca:
On Efficient Domination for Some Classes of H-Free Chordal Graphs. CoRR abs/1701.03414 (2017) - [i12]Andreas Brandstädt, Raffaele Mosca:
On Chordal-k-Generalized Split Graphs. CoRR abs/1702.07914 (2017) - [i11]Andreas Brandstädt, Raffaele Mosca:
Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time. CoRR abs/1706.04894 (2017) - [i10]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs. CoRR abs/1706.09301 (2017) - 2016
- [j34]Andreas Brandstädt, Raffaele Mosca:
Weighted Efficient Domination for P5-Free and P6-Free Graphs. SIAM J. Discret. Math. 30(4): 2288-2303 (2016) - [c6]Andreas Brandstädt, Raffaele Mosca:
Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. WG 2016: 38-49 - [i9]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time. CoRR abs/1602.05838 (2016) - [i8]Vadim V. Lozin, Raffaele Mosca, Victor Zamaraev
Independent Domination versus Weighted Independent Domination. CoRR abs/1602.09124 (2016) - [i7]Andreas Brandstädt, Suhail Mahfud, Raffaele Mosca:
Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs. CoRR abs/1608.01820 (2016) - 2015
- [j33]Vadim V. Lozin
Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. 182: 2-14 (2015) - [j32]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. Graphs Comb. 31(5): 1249-1262 (2015) - [j31]Raffaele Mosca, Paolo Nobili
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. Graphs Comb. 31(5): 1649-1658 (2015) - [i6]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P8-free Graphs in Polynomial Time. CoRR abs/1507.06541 (2015) - [i5]Andreas Brandstädt, Raffaele Mosca:
Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time. CoRR abs/1508.07733 (2015) - [i4]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time. CoRR abs/1511.08066 (2015) - 2014
- [j30]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P 7-Free Graphs in Linear Time. Algorithmica 68(4): 998-1018 (2014) - [i3]Raffaele Mosca:
The stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs. CoRR abs/1404.7623 (2014) - 2013
- [j29]Vadim V. Lozin
Sparse regular induced subgraphs in 2P3-free graphs. Discret. Optim. 10(4): 304-309 (2013) - [j28]Raffaele Mosca:
Maximum weight independent sets in (P6, co-banner)-free graphs. Inf. Process. Lett. 113(3): 89-93 (2013) - 2012
- [j27]Raffaele Mosca:
Stable sets for (P6, K2, 3)-free graphs. Discuss. Math. Graph Theory 32(3): 387-401 (2012) - [j26]Raffaele Mosca:
Some Results on Stable Sets for k-Colorable P6-Free Graphs and Generalizations. Discret. Math. Theor. Comput. Sci. 14(2): 37-56 (2012) - [j25]Vadim V. Lozin
Maximum regular induced subgraphs in 2 P3-free graphs. Theor. Comput. Sci. 460: 26-33 (2012) - [i2]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. CoRR abs/1209.2512 (2012) - 2011
- [j24]Andreas Brandstädt, Raffaele Mosca:
On distance-3 matchings and induced matchings. Discret. Appl. Math. 159(7): 509-520 (2011) - [c5]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P 7-free Graphs in Linear Time. ISAAC 2011: 100-109 - [i1]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P7-Free Graphs in Linear Time. CoRR abs/1106.2772 (2011) - 2010
- [j23]Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin
On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica 56(4): 383-393 (2010) - [j22]Andreas Brandstädt, Vadim V. Lozin
Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discret. Math. 24(1): 239-254 (2010)
2000 – 2009
- 2009
- [j21]Raffaele Mosca:
The stable set polytope for some extensions of P4-free graphs. Discret. Math. 309(1): 176-187 (2009) - [j20]Raffaele Mosca:
Independent sets in (P6, diamond)-free graphs. Discret. Math. Theor. Comput. Sci. 11(1): 125-140 (2009) - [j19]Vadim V. Lozin
Maximum independent sets in subclasses of P5-free graphs. Inf. Process. Lett. 109(6): 319-324 (2009) - [c4]Andreas Brandstädt, Raffaele Mosca:
On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 116-126 - 2008
- [j18]Raffaele Mosca:
Stable sets of maximum weight in (P7, banner)-free graphs. Discret. Math. 308(1): 20-33 (2008) - [j17]Raffaele Mosca:
Some observations on maximum weight stable sets in certain P. Eur. J. Oper. Res. 184(3): 849-859 (2008) - [j16]Van Bang Le, Raffaele Mosca, Haiko Müller
On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms 6(2): 256-276 (2008) - [c3]Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin
Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC 2008: 848-858 - 2007
- [j15]Caterina De Simone, Raffaele Mosca:
Stable set and clique polytopes of (P5, gem)-free graphs. Discret. Math. 307(22): 2661-2670 (2007) - [j14]Marco Dall'Aglio
How to allocate hard candies fairly. Math. Soc. Sci. 54(3): 218-237 (2007) - 2006
- [j13]Vadim V. Lozin
Polar graphs and maximal independent sets. Discret. Math. 306(22): 2901-2908 (2006) - 2005
- [j12]Andreas Brandstädt, Hoàng-Oanh Le
Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. Discret. Appl. Math. 145(2): 232-241 (2005) - [j11]Vadim V. Lozin
Independent sets in extensions of 2K2-free graphs. Discret. Appl. Math. 146(1): 74-80 (2005) - [j10]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le
New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38(5): 623-645 (2005) - [c2]Van Bang Le, Raffaele Mosca, Haiko Müller
On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG 2005: 163-174 - 2004
- [j9]Andreas Brandstädt, Hoàng-Oanh Le
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. Int. J. Found. Comput. Sci. 15(1): 163-185 (2004) - 2003
- [j8]Andreas Brandstädt, Raffaele Mosca:
On variations of P4-sparse graphs. Discret. Appl. Math. 129(2-3): 521-532 (2003) - [j7]Andreas Brandstädt, Raffaele Mosca:
On the structure and stability number of P5- and co-chair-free graphs. Discret. Appl. Math. 132(1-3): 47-65 (2003) - [j6]Raffaele Mosca:
Some results on maximum stable sets in certain P5-free graphs. Discret. Appl. Math. 132(1-3): 175-183 (2003) - 2002
- [j5]Claudio Arbib
On (P5, diamond)-free graphs. Discret. Math. 250(1-3): 1-22 (2002) - [j4]Raffaele Mosca:
A Shy Invariant of Graphs. Graphs Comb. 18(2): 367-379 (2002) - [c1]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le
New Graph Classes of Bounded Clique-Width. WG 2002: 57-67 - 2001
- [j3]Raffaele Mosca:
A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. Graphs Comb. 17(3): 517-528 (2001)
1990 – 1999
- 1999
- [j2]Raffaele Mosca:
Stable Sets in Certain P6-free Graphs. Discret. Appl. Math. 92(2-3): 177-191 (1999) - 1997
- [j1]Raffaele Mosca:
Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs. Inf. Process. Lett. 61(3): 137-143 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: