John S. Caughman

1.3k total citations · 1 hit paper
35 papers, 956 citations indexed

About

John S. Caughman is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, John S. Caughman has authored 35 papers receiving a total of 956 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Discrete Mathematics and Combinatorics, 13 papers in Artificial Intelligence and 10 papers in Computational Theory and Mathematics. Recurrent topics in John S. Caughman's work include Coding theory and cryptography (12 papers), Finite Group Theory Research (11 papers) and graph theory and CDMA systems (7 papers). John S. Caughman is often cited by papers focused on Coding theory and cryptography (12 papers), Finite Group Theory Research (11 papers) and graph theory and CDMA systems (7 papers). John S. Caughman collaborates with scholars based in United States, Slovakia and Philippines. John S. Caughman's co-authors include J. J. P. Veerman, A. Williams, Gerardo Lafferriere, Elise Lockwood, Paul Terwilliger, Estrella Johnson, Keith Weber, Bruce E. Sagan, Stanca M. Ciupe and Josep Bassaganya‐Riera and has published in prestigious journals such as Journal of Theoretical Biology, Systems & Control Letters and Journal of Statistical Physics.

In The Last Decade

John S. Caughman

33 papers receiving 914 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Decentralized control of vehicle formations

2005 488 citations Gerardo Lafferriere, A. Williams et al. Systems & Control Letters profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
John S. Caughman United States	13	582	222	174	125	123	35	956
J. J. P. Veerman United States	13	613 1.1×	287 1.3×	12 0.1×	72 0.6×	39 0.3×	60	957
Ovidiu Bagdasar United Kingdom	13	278 0.5×	73 0.3×	36 0.2×	102 0.8×	160 1.3×	75	625
Vitaly Voloshin United Kingdom	16	62 0.1×	18 0.1×	162 0.9×	339 2.7×	72 0.6×	66	867
Mohamed-Ali Belabbas United States	12	321 0.6×	148 0.7×	16 0.1×	20 0.2×	72 0.6×	51	559
Eunjeong Lee South Korea	8	56 0.1×	169 0.8×	29 0.2×	30 0.2×	138 1.1×	54	471
Xiaojun Liu China	13	201 0.3×	74 0.3×	6 0.0×	73 0.6×	31 0.3×	60	511
Alessandro Arsie United States	10	233 0.4×	60 0.3×	5 0.0×	22 0.2×	26 0.2×	32	474
Nader Motee United States	15	631 1.1×	445 2.0×		136 1.1×	72 0.6×	89	1.1k
Ulrich Münz Germany	16	929 1.6×	586 2.6×		240 1.9×	49 0.4×	58	1.3k
Yuan Sun China	21	1.0k 1.8×	771 3.5×		84 0.7×	54 0.4×	64	1.7k

Countries citing papers authored by John S. Caughman

Since Specialization

Citations

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

Fields of papers citing papers by John S. Caughman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of John S. Caughman

This figure shows the co-authorship network connecting the top 25 collaborators of John S. Caughman. A scholar is included among the top collaborators of John S. Caughman 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 John S. Caughman. John S. Caughman 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

Caughman, John S., et al.. (2023). Area, perimeter, height, and width of rectangle visibility graphs. Journal of Combinatorial Optimization. 46(3).

Lockwood, Elise, John S. Caughman, & Keith Weber. (2020). An essay on proof, conviction, and explanation: multiple representation systems in combinatorics. Educational Studies in Mathematics. 103(2). 173–189. 12 indexed citations

Caughman, John S., et al.. (2017). On the girth and diameter of generalized Johnson graphs. Discrete Mathematics. 341(1). 138–142. 8 indexed citations

Leber, Andrew, Vida Abedi, Raquel Hontecillas, et al.. (2016). Bistability analyses of CD4+ T follicular helper and regulatory cells during Helicobacter pylori infection. Journal of Theoretical Biology. 398. 74–84. 18 indexed citations

Lafferriere, Gerardo, et al.. (2016). Towards a complete characterization of vulnerability of networked synchronization processes. PDXScholar (Portland State University). 5207–5212. 1 indexed citations

Banda, Peter, John S. Caughman, & Jiřı́ Pospı́chal. (2015). Configuration Symmetry and Performance Upper Bound of One-Dimensional Cellular Automata for the Leader Election Problem. Open Repository and Bibliography (University of Luxembourg). 10. 1–21. 1 indexed citations

Lockwood, Elise, et al.. (2015). Categorizing Statements of the Multiplication Principle.. Proceedings of the ... PME Conference. 1 indexed citations

Perkowski, Marek, et al.. (2011). Reversible Function Synthesis of Large Reversible Functions with No Ancillary Bits Using Covering Set Partitions. 1008–1013. 7 indexed citations

Caughman, John S., et al.. (2011). Counting lattice chains and Delannoy paths in higher dimensions. Discrete Mathematics. 311(16). 1803–1812.

10.

Caughman, John S., et al.. (2007). The last subconstituent of the Hemmeter graph. Discrete Mathematics. 308(14). 3056–3060. 1 indexed citations

11.

Caughman, John S., et al.. (2007). A note on lattice chains and Delannoy numbers. Discrete Mathematics. 308(12). 2623–2628. 13 indexed citations

12.

Caughman, John S., et al.. (2006). Tips for the Job Search: Applying for Academic and Postdoctoral Positions. Notices of the American Mathematical Society. 1 indexed citations

13.

Caughman, John S., et al.. (2005). The Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme. Discrete Mathematics. 292(1-3). 17–44. 21 indexed citations

14.

Caughman, John S., et al.. (2005). The Terwilliger Algebra of a Distance-Regular Graph that Supports a Spin Model. Journal of Algebraic Combinatorics. 21(3). 289–310. 18 indexed citations

15.

Lafferriere, Gerardo, A. Williams, John S. Caughman, & J. J. P. Veerman. (2005). Decentralized control of vehicle formations. Systems & Control Letters. 54(9). 899–910. 488 indexed citations breakdown →

16.

Caughman, John S.. (2003). The last subconstituent of a bipartite Q-polynomial distance-regular graph. European Journal of Combinatorics. 24(5). 459–470. 7 indexed citations

17.

Caughman, John S.. (1999). The Terwilliger algebras of bipartite P- and Q-polynomial schemes. Discrete Mathematics. 196(1-3). 65–95. 69 indexed citations

18.

Caughman, John S.. (1999). Bipartite Q-Polynomial Quotients of Antipodal Distance-Regular Graphs. Journal of Combinatorial Theory Series B. 76(2). 291–296. 6 indexed citations

19.

Caughman, John S.. (1997). The Terwilliger Algebra for Bipartite $P$-and $Q$-polynomial Schemes(Groups and Combinatorics). Kyoto University Research Information Repository (Kyoto University). 991. 108–109. 1 indexed citations

20.

Caughman, John S.. (1997). Intersection numbers of bipartite distance-regular graphs. Discrete Mathematics. 163(1-3). 235–241. 7 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