| 2010 | DAC | What's cool for the future of ultra low power designs? | Nagaraj Ns, John Byler, Koorosh Nazifi, Venugopal Puvvada, Toshiyuki Saito, Alan Gibbons, S. Balajee |
| 2002 | MFCS | Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps. | Alan Gibbons, Paul Sant |
| 2000 | SODA | Deterministic broadcasting in unknown radio networks. | Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter |
| 1999 | CEC | Molecular implementation of computational components. | Gerald G. Owenson, Martyn Amos, David A. Hodgson, Alan Gibbons |
| 1999 | MFCS | Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. | Leszek Gasieniec, Alan Gibbons, Wojciech Rytter |
| 1999 | WADS | Efficient Web Searching Using Temporal Factors. | Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito |
| 1996 | MFCS | Models of DNA Computation. | Alan Gibbons, Martyn Amos, David A. Hodgson |
| 1996 | SODA | RNC Algorithms for the Uniform Generation of Combinatorial Structures. | Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons |
| 1995 | COCOON | Efficient Parallel Algorithms for some Tree Layout Problems. | Josep Daz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torn |
| 1993 | ICALP | Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. | Artur Czumaj, Alan Gibbons |
| 1993 | WG | Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. | N. W. Holloway, Somasundaram Ravindran, Alan Gibbons |
| 1992 | SPAA | Dense Edge-Disjoint Embedding of Binary Trees in the Mesh. | Alan Gibbons, Mike Paterson |
| 1991 | WADS | The MINSUMCUT Problem. | Josep Daz, Alan Gibbons, Mike Paterson, Jacobo Torn |
| 1987 | FCT | Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. | Alan Gibbons, Wojciech Rytter |