Peter B. Gibbons

1.1k total citations
21 papers, 733 citations indexed

About

Peter B. Gibbons is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Peter B. Gibbons has authored 21 papers receiving a total of 733 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Electrical and Electronic Engineering, 7 papers in Artificial Intelligence and 5 papers in Computational Theory and Mathematics. Recurrent topics in Peter B. Gibbons's work include graph theory and CDMA systems (11 papers), Coding theory and cryptography (5 papers) and Advanced Graph Theory Research (4 papers). Peter B. Gibbons is often cited by papers focused on graph theory and CDMA systems (11 papers), Coding theory and cryptography (5 papers) and Advanced Graph Theory Research (4 papers). Peter B. Gibbons collaborates with scholars based in New Zealand, Canada and United States. Peter B. Gibbons's co-authors include Charles J. Colbourn, W.B. Mugridge, Myra B. Cohen, L. R. Foulds, Rudolf Mathon, J.S. Collofello, Paul Denny, Patric R. J. Östergård, J. Richard Elliott and Eric Mendelsohn and has published in prestigious journals such as Molecular and Cellular Biology, Operations Research and Networks.

In The Last Decade

Peter B. Gibbons

21 papers receiving 682 citations

Peers

Peter B. Gibbons
Man‐Tak Shing United States
Marc Auslander United States
Avi Ziv Israel
Peter B. Gibbons
Citations per year, relative to Peter B. Gibbons Peter B. Gibbons (= 1×) peers Xiangjuan Yao

Countries citing papers authored by Peter B. Gibbons

Since Specialization
Citations

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

Fields of papers citing papers by Peter B. Gibbons

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Peter B. Gibbons

This figure shows the co-authorship network connecting the top 25 collaborators of Peter B. Gibbons. A scholar is included among the top collaborators of Peter B. Gibbons 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 Peter B. Gibbons. Peter B. Gibbons 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.
Gibbons, Peter B. & Rudolf Mathon. (2008). Enumeration of generalized Hadamard matrices of order 16 and related designs. Journal of Combinatorial Designs. 17(2). 119–135. 5 indexed citations
2.
Gibbons, Peter B. & Patric R. J. Östergård. (2006). Computational Methods in Design Theory. 781–808. 11 indexed citations
3.
Cohen, Myra B., Peter B. Gibbons, W.B. Mugridge, Charles J. Colbourn, & J.S. Collofello. (2004). A variable strength interaction testing of components. 413–418. 90 indexed citations
4.
Cohen, Myra B., Peter B. Gibbons, W.B. Mugridge, & Charles J. Colbourn. (2003). Constructing test suites for interaction testing. International Conference on Software Engineering. 38–48. 214 indexed citations
5.
Cohen, Myra B., Peter B. Gibbons, W.B. Mugridge, & Charles J. Colbourn. (2003). Constructing test suites for interaction testing. 38–48. 179 indexed citations
6.
Gibbons, Peter B., et al.. (2001). Computational methods and new results for chessboard problems. ResearchSpace (University of Auckland). 23. 253–284. 4 indexed citations
7.
Denny, Paul & Peter B. Gibbons. (2000). Case studies and new results in combinatorial enumeration. Journal of Combinatorial Designs. 8(4). 239–260. 16 indexed citations
8.
Denny, Paul & Peter B. Gibbons. (2000). Case studies and new results in combinatorial enumeration. Journal of Combinatorial Designs. 8(4). 239–260. 1 indexed citations
9.
Gibbons, Peter B., et al.. (1997). Some new results for the queens domination problem.. Australas. J Comb.. 15. 145–160. 7 indexed citations
10.
Colbourn, Charles J. & Peter B. Gibbons. (1996). Uniform Orthogonal Group Divisible Designs with Block Size Three. Molecular and Cellular Biology. 24(10). 4151–65. 2 indexed citations
11.
Gibbons, Peter B. & Eric Mendelsohn. (1996). The construction of antipodal triple systems by simulated annealing. Discrete Mathematics. 155(1-3). 59–76. 2 indexed citations
12.
Gibbons, Peter B. & Rudolf Mathon. (1995). Signings of group divisible designs and projective planes.. Australas. J Comb.. 11. 79–104. 2 indexed citations
13.
Gibbons, Peter B., et al.. (1994). Antipodal triple systems.. Australas. J Comb.. 9. 137–152. 1 indexed citations
14.
Colbourn, Charles J., Peter B. Gibbons, Rudolf Mathon, Ronald C. Mullin, & Alexander Rosa. (1994). The Spectrum of Orthogonal Steiner Triple Systems. Canadian Journal of Mathematics. 46(2). 239–252. 9 indexed citations
15.
Gibbons, Peter B. & Rudolf Mathon. (1993). The use of hill‐climbing to construct orthogonal steiner triple systems. Journal of Combinatorial Designs. 1(1). 27–50. 12 indexed citations
16.
Elliott, J. Richard & Peter B. Gibbons. (1992). The construction of subsquare free Latin squares by simulated annealing.. Australas. J Comb.. 5. 209–228. 10 indexed citations
17.
Gibbons, Peter B. & Rudolf Mathon. (1987). Construction methods for Bhaskar Rao and related designs. Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics. 42(1). 5–30. 26 indexed citations
18.
Foulds, L. R., et al.. (1985). Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics. Operations Research. 33(5). 1091–1106. 59 indexed citations
19.
Foulds, L. R., et al.. (1982). An algorithm for the steiner problem in graphs. Networks. 12(3). 323–333. 37 indexed citations
20.
Gibbons, Peter B.. (1976). Computing techniques for the construction and analysis of block designs.. 418. 1–43. 44 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

Rankless by CCL
2026