Alan Gibbons

1.9k total citations · 1 hit paper
33 papers, 1.1k citations indexed

About

Alan Gibbons is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Alan Gibbons has authored 33 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 9 papers in Computer Networks and Communications and 8 papers in Electrical and Electronic Engineering. Recurrent topics in Alan Gibbons's work include Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (6 papers) and DNA and Biological Computing (5 papers). Alan Gibbons is often cited by papers focused on Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (6 papers) and DNA and Biological Computing (5 papers). Alan Gibbons collaborates with scholars based in United Kingdom, Poland and Chile. Alan Gibbons's co-authors include Michael Keating, Rob Aitken, David Flynn, Kaijian Shi, Wojciech Rytter, Paul G. Spirakis, Martyn Amos, Paul E. Dunne, Bogdan S. Chlebus and Leszek Gąsieniec and has published in prestigious journals such as Theoretical Computer Science, The Computer Journal and Information and Computation.

In The Last Decade

Alan Gibbons

31 papers receiving 1.0k 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.

Algorithmic graph theory

1985 543 citations Alan Gibbons Cambridge University Press eBooks profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Alan Gibbons United Kingdom	9	423	346	255	240	153	33	1.1k
K. Thulasiraman United States	17	500 1.2×	579 1.7×	200 0.8×	227 0.9×	124 0.8×	101	1.1k
Thang Nguyen Bui United States	13	328 0.8×	370 1.1×	135 0.5×	246 1.0×	269 1.8×	19	863
Robert W. Leland United States	9	493 1.2×	520 1.5×	350 1.4×	228 0.9×	195 1.3×	14	1.2k
Behrooz Parhami United States	18	471 1.1×	833 2.4×	268 1.1×	275 1.1×	215 1.4×	125	1.3k
Isao Shirakawa Japan	14	391 0.9×	258 0.7×	196 0.8×	327 1.4×	158 1.0×	154	1.1k
N.R. Malik United States	5	208 0.5×	179 0.5×	79 0.3×	144 0.6×	109 0.7×	10	797
Paweł Winter Denmark	14	753 1.8×	621 1.8×	147 0.6×	455 1.9×	131 0.9×	41	1.4k
R. M. Mattheyses United States	6	839 2.0×	412 1.2×	593 2.3×	91 0.4×	81 0.5×	11	1.2k
Burkhard Monien Germany	25	287 0.7×	926 2.7×	260 1.0×	723 3.0×	365 2.4×	118	1.9k
T. Leighton United States	20	537 1.3×	1.1k 3.2×	272 1.1×	516 2.1×	160 1.0×	39	1.6k

Countries citing papers authored by Alan Gibbons

Since Specialization

Citations

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

Fields of papers citing papers by Alan Gibbons

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Alan Gibbons

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

1.

Saito, Toshiyuki, et al.. (2010). What's cool for the future of ultra low power designs?. 523–524. 2 indexed citations

2.

Keating, Michael, David Flynn, Rob Aitken, Alan Gibbons, & Kaijian Shi. (2007). Low Power Methodology Manual: For System-on-Chip Design. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 305 indexed citations

3.

Gibbons, Alan & Paul G. Spirakis. (2005). Lectures on Parallel Computation (Cambridge International Series on Parallel Computation). Cambridge University Press eBooks. 1 indexed citations

4.

Gibbons, Alan & Paul Sant. (2004). Rotation sequences and edge-colouring of binary tree pairs. Theoretical Computer Science. 326(1-3). 409–418. 5 indexed citations

5.

Gibbons, Alan. (2003). Graph theory. 755–759. 1 indexed citations

6.

Gibbons, Alan. (2003). Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. The Computer Journal. 46(4). 391–400. 5 indexed citations

7.

Gibbons, Alan. (2000). Shadow of the Minotaur. Medical Entomology and Zoology. 1 indexed citations

8.

Dunne, Paul E., Alan Gibbons, & Michele Zito. (2000). Complexity-theoretic models of phase transitions in search problems. Theoretical Computer Science. 249(2). 243–263. 2 indexed citations

9.

Gibbons, Alan, et al.. (1999). Hybrid Graph Theory and Network Analysis. Cambridge University Press eBooks. 17 indexed citations

10.

Dı́az, Josep, Alan Gibbons, Grammati Pantziou, et al.. (1997). Parallel algorithms for the minimum cut and the minimum length tree layout problems. Theoretical Computer Science. 181(2). 267–287. 7 indexed citations

11.

Zito, Michele, et al.. (1996). RCN algorithms for the uniform generation of combinatorial structures. Symposium on Discrete Algorithms. 429–437. 3 indexed citations

12.

Czumaj, Artur & Alan Gibbons. (1996). Guthrie's problem: new equivalences and rapid reductions. Theoretical Computer Science. 154(1). 3–22. 1 indexed citations

13.

Gibbons, Alan. (1993). An introduction to distributed memory models of parallel computation. Cambridge University Press eBooks. 197–226.

14.

Spirakis, Paul G. & Alan Gibbons. (1993). PRAM models and fundamental parallel algorithmic techniques. Part I. Cambridge University Press eBooks. 19–40. 2 indexed citations

15.

Gibbons, Alan & Paul G. Spirakis. (1993). Lectures on parallel computation. CERN Document Server (European Organization for Nuclear Research). 36 indexed citations

16.

Gibbons, Alan, et al.. (1991). The balanced binary tree technique on mesh-connected computers. Information Processing Letters. 37(2). 101–109. 5 indexed citations

17.

Gibbons, Alan & Wojciech Rytter. (1990). Optimally edge-colouring outerplanar graphs is in NC. Theoretical Computer Science. 71(3). 401–411. 5 indexed citations

18.

Gibbons, Alan, Amos Israeli, & Wojciech Rytter. (1988). Parallel O(log n) time edge-colouring of trees and Halin graphs. Information Processing Letters. 27(1). 43–51. 7 indexed citations

19.

Gibbons, Alan & Wojciech Rytter. (1986). On the decidability of some problems about rational subsets of free partially commutative monoids. Theoretical Computer Science. 48. 329–337. 11 indexed citations

20.

Gibbons, Alan. (1985). Algorithmic graph theory. Cambridge University Press eBooks. 543 indexed citations breakdown →

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