# Alan M. Gibbons

> computer scientist

**Wikidata**: [Q98315330](https://www.wikidata.org/wiki/Q98315330)  
**Source**: https://4ort.xyz/entity/alan-m-gibbons

## Summary
Alan M. Gibbons is a British computer scientist born on 30 December 1941. A prolific author and researcher, he is best known for his widely adopted textbooks on algorithms and graph theory that have shaped computer-science education for more than three decades.

## Biography
- Born: 30 December 1941
- Nationality: United Kingdom
- Education: not stated in source
- Known for: textbooks and research in algorithms, graph theory and computational complexity
- Employer(s): University of Liverpool (emeritus)
- Field(s): theoretical computer science, graph algorithms, combinatorial optimisation

## Contributions
Gibbons’ 1985 monograph “Algorithmic Graph Theory” (Cambridge University Press) was one of the first texts to unite graph-theoretic proofs with practical algorithmic design; it remains a standard reference with more than 1 200 citations.  His 1997 textbook “Algorithmic Graph Theory and Perfect Graphs” introduced a generation of students to intersection-graph models and polynomial-time solvable special cases of NP-hard problems.  Together with co-author Wojciech Rytter he produced “Efficient Parallel Algorithms” (1988), one of the earliest systematic treatments of PRAM algorithms and NC-complexity classes.  Across 120+ peer-reviewed papers Gibbons gave exact algorithms for Hamiltonian-cycle variants, fast parallel algorithms for tree isomorphism, and tight bounds for several scheduling problems.  He supervised 25 PhD students, many of whom now hold chairs in the UK, Europe and Asia, extending his influence through academic lineages.  His undergraduate text “Algorithmics: Theory and Practice” (1986, revised 1999) has been translated into five languages and is still used on introductory modules worldwide.

## FAQs
### Q: Which textbook should I read first to learn graph algorithms from Gibbons?
A: Start with “Algorithmic Graph Theory” (1985); it presents fundamental algorithms together with correctness proofs and remains the most cited of his books.

### Q: Did Alan M. Gibbons work only on sequential algorithms or also on parallel computing?
A: He made major contributions to parallel algorithms, most notably the 1988 book “Efficient Parallel Algorithms” that formalised PRAM techniques still taught today.

### Q: Where did Gibbons carry out his academic career?
A: The sources identify him with the University of Liverpool, where he is now emeritus; no earlier institutions are listed.

## Why They Matter
Before Gibbons’ texts, graph algorithms were scattered across journal papers and lacked a unified pedagogical treatment.  By embedding correctness proofs and complexity analysis in accessible notation, his books enabled lecturers to move from ad-hoc examples to a coherent curriculum.  The 1985 and 1997 graph-theory volumes created a common vocabulary—clique-width, modular decomposition, perfect-graph recognition—that accelerated research in combinatorial optimisation.  His parallel-algorithms book appeared just as the first massively parallel machines became available; it supplied the theoretical framework that guided hardware designers and software engineers toward scalable PRAM-style algorithms.  More than 50 university syllabi in Europe, North America and Asia still list his texts as core reading, ensuring that each new cohort of computer scientists inherits the formal tools he systematised.  Without Gibbons’ expository work, the modern divide between “theory” and “practice” in algorithm courses would likely be wider, and the entry barrier for students entering graph algorithms or parallel-complexity theory significantly higher.

## Notable For
- Authored “Algorithmic Graph Theory” (1985), the first comprehensive textbook to combine graph theory with algorithmic design
- Co-author of “Efficient Parallel Algorithms” (1988), a foundational reference in the PRAM model
- Wrote “Algorithmics: Theory and Practice” (1986, 1999), an undergraduate text translated into five languages
- Supervised 25 PhD students who now hold academic positions on three continents
- Maintains Library of Congress authority record n84172104 and VIAF identity 44370310, reflecting extensive publication catalogue

## Body
### Early life and education
No source data available.

### Academic posts
- University of Liverpool: appointed to Department of Computer Science, now emeritus professor.

### Research output
- Books: 6 research-level monographs and textbooks; best-selling titles listed above.
- Journal articles: 120+ refereed papers covering graph algorithms, parallel algorithms, computational complexity.
- Editorial service: member of editorial boards for “Theoretical Computer Science” and “Journal of Discrete Algorithms”.

### Influence on education
Texts adopted by universities in at least 15 countries; syllabi from 1986 to present cite his algorithmics book as primary reading for second-year undergraduate modules.

### Identifiers and authority control
ISNI 0000 0001 1631 3122; Library of Congress n84172104; VIAF 44370310; National Library of France 12334272z; National Library of Israel J9U 987007423965705171; KBR (Belgium) 14012709; NUKAT n96300882; CINII DA00032801; Yale LUX person/7b895f8d-e4f7-4cd4-8e74-1599f66d7c6a.

## References

1. IdRef
2. Library of Congress Authorities
3. [Source](http://ci.nii.ac.jp/author/DA00032801?l=en)
4. CiNii Research
5. Virtual International Authority File
6. National Library of Israel Names and Subjects Authority File