Raffaele Mosca

907 total citations
47 papers, 469 citations indexed

About

Raffaele Mosca is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Raffaele Mosca has authored 47 papers receiving a total of 469 indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Computational Theory and Mathematics, 17 papers in Computer Networks and Communications and 14 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Raffaele Mosca's work include Advanced Graph Theory Research (44 papers), Complexity and Algorithms in Graphs (31 papers) and Graph Labeling and Dimension Problems (14 papers). Raffaele Mosca is often cited by papers focused on Advanced Graph Theory Research (44 papers), Complexity and Algorithms in Graphs (31 papers) and Graph Labeling and Dimension Problems (14 papers). Raffaele Mosca collaborates with scholars based in Italy, Germany and United Kingdom. Raffaele Mosca's co-authors include Andreas Brandstädt, Vadim Lozin, Hoàng-Oanh Le, Andrea Raggi, Claudio Arbib, Feodor F. Dragan, Van Bang Lê, Haiko Müller, Christopher Purcell and Paolo Nobili and has published in prestigious journals such as Journal of Cleaner Production, European Journal of Operational Research and Theoretical Computer Science.

In The Last Decade

Raffaele Mosca

45 papers receiving 450 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Raffaele Mosca Italy	14	424	164	111	57	31	47	469
Oliver Schaudt Germany	9	192 0.5×	77 0.5×	61 0.5×	37 0.6×	28 0.9×	47	235
Frank Gurski Germany	9	144 0.3×	18 0.1×	72 0.6×	43 0.8×	14 0.5×	26	186
Yuri Faenza United States	7	92 0.2×	22 0.1×	36 0.3×	4 0.1×	27 0.9×	27	141
Ioannis Milis Greece	7	66 0.2×	10 0.1×	117 1.1×	8 0.1×	16 0.5×	20	190
Alexander Langer Germany	9	122 0.3×	16 0.1×	50 0.5×	3 0.1×	12 0.4×	16	152
Anna Adamaszek Denmark	9	58 0.1×	5 0.0×	50 0.5×	7 0.1×	8 0.3×	27	142
Mordechai Shalom Israel	8	56 0.1×	7 0.0×	136 1.2×	2 0.0×	77 2.5×	45	213
Dušan Knop Czechia	7	79 0.2×	7 0.0×	32 0.3×	3 0.1×	9 0.3×	40	111
Kristoffer Arnsfelt Hansen Denmark	7	82 0.2×	4 0.0×	28 0.3×	3 0.1×	12 0.4×	28	146
Bundit Laekhanukit Canada	7	120 0.3×	3 0.0×	78 0.7×		9 0.3×	26	151

Countries citing papers authored by Raffaele Mosca

Since Specialization

Citations

This map shows the geographic impact of Raffaele Mosca's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Raffaele Mosca with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Raffaele Mosca more than expected).

Fields of papers citing papers by Raffaele Mosca

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Raffaele Mosca. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Raffaele Mosca. The network helps show where Raffaele Mosca may publish in the future.

Co-authorship network of co-authors of Raffaele Mosca

This figure shows the co-authorship network connecting the top 25 collaborators of Raffaele Mosca. A scholar is included among the top collaborators of Raffaele Mosca based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Raffaele Mosca. Raffaele Mosca is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Brandstädt, Andreas & Raffaele Mosca. (2024). Finding dominating induced matchings in P10-free graphs in polynomial time. Theoretical Computer Science. 990. 114404–114404.

Brandstädt, Andreas & Raffaele Mosca. (2021). Maximum weight independent sets for (S1,2,4,triangle)-free graphs in polynomial time. Theoretical Computer Science. 878-879. 11–25.

Brandstädt, Andreas & Raffaele Mosca. (2018). Dominating induced matchings in S1,2,4-free graphs. Discrete Applied Mathematics. 278. 83–92. 3 indexed citations

Brandstädt, Andreas & Raffaele Mosca. (2017). Maximum weight independent set for ℓclaw-free graphs in polynomial time. Discrete Applied Mathematics. 237. 57–64. 9 indexed citations

Mosca, Raffaele. (2015). A sufficient condition to extend polynomial results for the Maximum Independent Set Problem. Discrete Applied Mathematics. 216. 281–289. 3 indexed citations

Lozin, Vadim, Raffaele Mosca, & Christopher Purcell. (2013). Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discrete Applied Mathematics. 182. 2–14. 2 indexed citations

Lozin, Vadim, Raffaele Mosca, & Christopher Purcell. (2013). Sparse regular induced subgraphs in2P3-free graphs. Discrete Optimization. 10(4). 304–309. 4 indexed citations

Brandstädt, Andreas & Raffaele Mosca. (2012). Dominating Induced Matchings for P 7-Free Graphs in Linear Time. Algorithmica. 68(4). 998–1018. 16 indexed citations

Brandstädt, Andreas & Raffaele Mosca. (2010). On distance-3 matchings and induced matchings. Discrete Applied Mathematics. 159(7). 509–520. 16 indexed citations

10.

Simone, Caterina De & Raffaele Mosca. (2007). Stable set and clique polytopes of (P5,gem)-free graphs. Discrete Mathematics. 307(22). 2661–2670. 1 indexed citations

11.

Lê, Van Bang, Raffaele Mosca, & Haiko Müller. (2007). On stable cutsets in claw-free graphs and planar graphs. Journal of Discrete Algorithms. 6(2). 256–276. 10 indexed citations

12.

Mosca, Raffaele. (2007). Stable sets of maximum weight in (P7, banner)-free graphs. Discrete Mathematics. 308(1). 20–33. 8 indexed citations

13.

Lozin, Vadim & Raffaele Mosca. (2004). Independent sets in extensions of 2K2-free graphs. Discrete Applied Mathematics. 146(1). 74–80. 34 indexed citations

14.

Brandstädt, Andreas, Hoàng-Oanh Le, & Raffaele Mosca. (2004). Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width. Discrete Applied Mathematics. 145(2). 232–241. 21 indexed citations

15.

Brandstädt, Andreas, Hoàng-Oanh Le, & Raffaele Mosca. (2004). GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH. International Journal of Foundations of Computer Science. 15(1). 163–185. 22 indexed citations

16.

Brandstädt, Andreas & Raffaele Mosca. (2003). On the structure and stability number of P5- and co-chair-free graphs. Discrete Applied Mathematics. 132(1-3). 47–65. 31 indexed citations

17.

Mosca, Raffaele. (2003). Some results on maximum stable sets in certain P5-free graphs. Discrete Applied Mathematics. 132(1-3). 175–183. 17 indexed citations

18.

Brandstädt, Andreas & Raffaele Mosca. (2003). On variations of P4-sparse graphs. Discrete Applied Mathematics. 129(2-3). 521–532. 11 indexed citations

19.

Arbib, Claudio & Raffaele Mosca. (2002). On (P5, diamond)-free graphs. Discrete Mathematics. 250(1-3). 1–22. 16 indexed citations

20.

Mosca, Raffaele. (1999). Stable sets in certain P6-free graphs. Discrete Applied Mathematics. 92(2-3). 177–191. 29 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact