Michael Ferrara

549 total citations
47 papers, 271 citations indexed

About

Michael Ferrara is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Michael Ferrara has authored 47 papers receiving a total of 271 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computational Theory and Mathematics, 30 papers in Discrete Mathematics and Combinatorics and 15 papers in Geometry and Topology. Recurrent topics in Michael Ferrara's work include Advanced Graph Theory Research (31 papers), Limits and Structures in Graph Theory (29 papers) and Digital Image Processing Techniques (13 papers). Michael Ferrara is often cited by papers focused on Advanced Graph Theory Research (31 papers), Limits and Structures in Graph Theory (29 papers) and Digital Image Processing Techniques (13 papers). Michael Ferrara collaborates with scholars based in United States, Germany and United Kingdom. Michael Ferrara's co-authors include Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Stephen G. Hartke, Jeffrey S. Powell, Ralph J. Faudree, Colton Magnant, Bryan Wee, Robert M. Talbot and Michał Karoński and has published in prestigious journals such as Discrete Applied Mathematics, Discrete Mathematics and COMBINATORICA.

In The Last Decade

Michael Ferrara

46 papers receiving 252 citations

Peers

Michael Ferrara
Izak Broere South Africa
Clifford Smyth United States
John Hannah New Zealand
Arnfried Kemnitz Germany
Dalibor Fronček United States
Anthony B. Evans United States
Dan Pritikin United States
Célia Picinin de Mello Brazil
Margaret B. Cozzens United States
Mieczysław Borowiecki Poland
Izak Broere South Africa
Michael Ferrara
Citations per year, relative to Michael Ferrara Michael Ferrara (= 1×) peers Izak Broere

Countries citing papers authored by Michael Ferrara

Since Specialization
Citations

This map shows the geographic impact of Michael Ferrara'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 Michael Ferrara with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Ferrara more than expected).

Fields of papers citing papers by Michael Ferrara

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Ferrara. 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 Michael Ferrara. The network helps show where Michael Ferrara may publish in the future.

Co-authorship network of co-authors of Michael Ferrara

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Ferrara. A scholar is included among the top collaborators of Michael Ferrara 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 Michael Ferrara. Michael Ferrara is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Roberts, Caleb P., Michael Ferrara, Lauren Luther, et al.. (2025). Rallus elegans (King Rail) occupancy is stable, but habitat is in short supply in the Arkansas Delta. Ornithological applications. 128(1). 1–9.
2.
Ferrara, Michael, et al.. (2017). The saturation number of induced subposets of the Boolean lattice. Discrete Mathematics. 340(10). 2479–2487. 12 indexed citations
3.
Ferrara, Michael, et al.. (2017). Colored Saturation Parameters for Rainbow Subgraphs. Journal of Graph Theory. 86(4). 375–386. 5 indexed citations
4.
Ferrara, Michael, et al.. (2016). Ore and Chv\'atal-type Degree Conditions for Bootstrap Percolation from Small Sets. arXiv (Cornell University). 1 indexed citations
5.
Ferrara, Michael, et al.. (2015). On the sum necessary to ensure that a degree sequence is potentially H-graphic. COMBINATORICA. 36(6). 687–702. 4 indexed citations
6.
Ferrara, Michael, et al.. (2014). Ramsey-minimal saturation numbers for matchings. Discrete Mathematics. 322. 26–30. 5 indexed citations
7.
Ferrara, Michael, et al.. (2013). New Results on Degree Sequences of Uniform Hypergraphs. The Electronic Journal of Combinatorics. 20(4). 13 indexed citations
8.
Ferrara, Michael, et al.. (2013). Conditions for families of disjointk-connected subgraphs in a graph. Discrete Mathematics. 313(6). 760–764. 3 indexed citations
9.
Ferrara, Michael, et al.. (2013). Improved degree conditions for 2-factors withkcycles in hamiltonian graphs. Discrete Mathematics. 320. 51–54. 3 indexed citations
10.
Ferrara, Michael, et al.. (2012). Saturation numbers for families of graph subdivisions. Journal of Graph Theory. 71(4). 416–434. 5 indexed citations
11.
Ferrara, Michael, et al.. (2012). List distinguishing parameters of trees. Discrete Applied Mathematics. 161(6). 864–869. 2 indexed citations
12.
Ferrara, Michael, et al.. (2012). Pancyclicity of 4-connected {claw, generalized bull}-free graphs. Discrete Mathematics. 313(4). 460–467. 2 indexed citations
13.
Ferrara, Michael, Michael S. Jacobson, & Jeffrey S. Powell. (2011). Characterizing degree-sum maximal nonhamiltonian bipartite graphs. Discrete Mathematics. 312(2). 459–461. 6 indexed citations
14.
Ferrara, Michael, et al.. (2009). The game of F-saturator. Discrete Applied Mathematics. 158(3). 189–197. 1 indexed citations
15.
Ferrara, Michael, et al.. (2008). Disjoint hamiltonian cycles in bipartite graphs. Discrete Mathematics. 309(12). 3811–3820. 2 indexed citations
16.
Chen, Guantao, et al.. (2008). Graphic sequences with a realization containing a complete multipartite subgraph. Discrete Mathematics. 308(23). 5712–5721. 3 indexed citations
17.
Ferrara, Michael, et al.. (2007). HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH. Australas. J Comb.. 48. 191–204. 3 indexed citations
18.
Ferrara, Michael, et al.. (2007). Graphic Sequences with a Realization Containing a Friendship Graph.. Ars Combinatoria. 85. 10 indexed citations
19.
Ferrara, Michael, et al.. (2007). Generalizing D-graphs. Discrete Applied Mathematics. 155(18). 2487–2495. 1 indexed citations
20.
Ferrara, Michael, et al.. (2006). On H-Linked Graphs. Graphs and Combinatorics. 22(2). 217–224. 16 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

Breakdown of academic impact, for papers by Izak Broere Breakdown of academic impact, for papers by Clifford Smyth Breakdown of academic impact, for papers by John Hannah Breakdown of academic impact, for papers by Arnfried Kemnitz Breakdown of academic impact, for papers by Dalibor Fronček Breakdown of academic impact, for papers by Anthony B. Evans Breakdown of academic impact, for papers by Dan Pritikin Breakdown of academic impact, for papers by Célia Picinin de Mello Breakdown of academic impact, for papers by Margaret B. Cozzens Breakdown of academic impact, for papers by Mieczysław Borowiecki
Rankless by CCL
2026