Clifford Smyth

462 total citations
27 papers, 197 citations indexed

About

Clifford Smyth is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Clifford Smyth has authored 27 papers receiving a total of 197 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Discrete Mathematics and Combinatorics, 14 papers in Computational Theory and Mathematics and 7 papers in Geometry and Topology. Recurrent topics in Clifford Smyth's work include Limits and Structures in Graph Theory (11 papers), Advanced Graph Theory Research (9 papers) and graph theory and CDMA systems (7 papers). Clifford Smyth is often cited by papers focused on Limits and Structures in Graph Theory (11 papers), Advanced Graph Theory Research (9 papers) and graph theory and CDMA systems (7 papers). Clifford Smyth collaborates with scholars based in United States, Israel and Hungary. Clifford Smyth's co-authors include Irit Dinur, Oded Regev, Alan Frieze, Michael Saks, Oded Regev, J. Kahn, Ryan R. Martin, Miklós Ruszinkó, Julien Moncel and Raúl Sánchez García and has published in prestigious journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Clifford Smyth

27 papers receiving 183 citations

Peers

Clifford Smyth
Kolja Knauer France
Holger Dell Germany
Garth Isaak United States
Toshiki Saitoh Japan
Luérbio Faria Brazil
Margaret B. Cozzens United States
Zhengke Miao China
Uroš Milutinović Slovenia
Min Chih Lin Argentina
Pavel Hrubeš United States
Kolja Knauer France
Clifford Smyth
Citations per year, relative to Clifford Smyth Clifford Smyth (= 1×) peers Kolja Knauer

Countries citing papers authored by Clifford Smyth

Since Specialization
Citations

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

Fields of papers citing papers by Clifford Smyth

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Clifford Smyth

This figure shows the co-authorship network connecting the top 25 collaborators of Clifford Smyth. A scholar is included among the top collaborators of Clifford Smyth 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 Clifford Smyth. Clifford Smyth 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.
Hauenstein, Jonathan D., et al.. (2024). Smooth connectivity in real algebraic varieties. Numerical Algorithms. 100(1). 63–84. 1 indexed citations
2.
Chen, Jung‐Sheng, et al.. (2021). TopoResNet: A Hybrid Deep Learning Architecture and Its Application to Skin Lesion Classification. Mathematics. 9(22). 2924–2924. 8 indexed citations
3.
Smyth, Clifford, et al.. (2020). The Noncrossing Bond Poset of a Graph. The Electronic Journal of Combinatorics. 27(4). 2 indexed citations
4.
Abrahamson, Dor, Raúl Sánchez García, & Clifford Smyth. (2016). Metaphors Are Projected Constraints on Action:An Ecological Dynamics View on Learning Across the Disciplines. eScholarship (California Digital Library). 12 indexed citations
5.
Smyth, Clifford, et al.. (2016). Equivalent Formulations of the Bunk Bed Conjecture. 2. 23–28. 4 indexed citations
6.
Mahlburg, Karl & Clifford Smyth. (2013). Symmetric Polynomials and Symmetric Mean Inequalities. The Electronic Journal of Combinatorics. 20(3). 2 indexed citations
7.
Howard, David M. & Clifford Smyth. (2012). Revolutionaries and Spies. Discrete Mathematics. 312(22). 3384–3391. 1 indexed citations
8.
Mahlburg, Karl, et al.. (2010). Enumeration of non-crossing pairings on bit strings. Journal of Combinatorial Theory Series A. 118(1). 129–151. 1 indexed citations
9.
Brown, John, et al.. (2010). Marjorie Fleming's book, the story of Pet Marjorie together with her journals and her letters, to which is added Marjorie Fleming, a story of child-life fifty years ago. Bulletin of Miscellaneous Information (Royal Gardens Kew). 1 indexed citations
10.
Bohman, Tom, Alan Frieze, Oleg Pikhurko, & Clifford Smyth. (2009). Anti-Ramsey properties of random graphs. Journal of Combinatorial Theory Series B. 100(3). 299–312. 5 indexed citations
11.
Abraham, Uri, James Cummings, & Clifford Smyth. (2007). Some results in polychromatic Ramsey theory. Journal of Symbolic Logic. 72(3). 865–896. 7 indexed citations
12.
Bohman, Tom, Alan Frieze, Tomasz Łuczak, et al.. (2007). First-Order Definability of Trees and Sparse Random Graphs. Combinatorics Probability Computing. 16(3). 375–400. 2 indexed citations
13.
Frieze, Alan, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, & Clifford Smyth. (2006). Codes identifying sets of vertices in random networks. Discrete Mathematics. 307(9-10). 1094–1107. 24 indexed citations
14.
Bohman, Tom, Alan Frieze, Ryan R. Martin, Miklós Ruszinkó, & Clifford Smyth. (2006). Randomly generated intersecting hypergraphs II. Random Structures and Algorithms. 30(1-2). 17–34. 3 indexed citations
15.
Dinur, Irit, Oded Regev, & Clifford Smyth. (2005). The Hardness of 3-Uniform Hypergraph Coloring. COMBINATORICA. 25(5). 519–535. 38 indexed citations
16.
Regev, Oded, et al.. (2004). Long Monotone Paths in Line Arrangements. Discrete & Computational Geometry. 32(2). 4 indexed citations
17.
Regev, Oded, et al.. (2003). Long monotone paths in line arrangements. 124–128. 1 indexed citations
18.
Regev, Oded, et al.. (2003). Long monotone paths in line arrangements. 2 indexed citations
19.
Dinur, Irit, Oded Regev, & Clifford Smyth. (2003). The hardness of 3-uniform hypergraph coloring. 33–40. 21 indexed citations
20.
Smyth, Clifford. (2002). Reimer's inequality and tardos' conjecture. 218–221. 2 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 Kolja Knauer Breakdown of academic impact, for papers by Holger Dell Breakdown of academic impact, for papers by Garth Isaak Breakdown of academic impact, for papers by Toshiki Saitoh Breakdown of academic impact, for papers by Luérbio Faria Breakdown of academic impact, for papers by Margaret B. Cozzens Breakdown of academic impact, for papers by Zhengke Miao Breakdown of academic impact, for papers by Uroš Milutinović Breakdown of academic impact, for papers by Min Chih Lin Breakdown of academic impact, for papers by Pavel Hrubeš
Rankless by CCL
2026