| 2024 | Algosensors | Reconfigurable Routing in Data Center Networks. | David C. Kutner, Iain A. Stewart |
| 2023 | SOFSEM | Payment Scheduling in the Interval Debt Model. | Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan |
| 2015 | COCOA | An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar. | Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart |
| 2015 | FCT | On the Mathematics of Data Centre Network Topologies. | Iain A. Stewart |
| 2015 | ICA3PP | On Routing Algorithms for the DPillar Data Centre Networks. | Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart |
| 2015 | TrustCom | Routing Algorithms for Recursively-Defined Data Centre Networks. | Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart |
| 2014 | CEC | Accelerating ant colony optimization-based edge detection on the GPU using CUDA. | Laurence Dawson, Iain A. Stewart |
| 2013 | CEC | Improving Ant Colony Optimization performance on the GPU using CUDA. | Laurence Dawson, Iain A. Stewart |
| 2013 | ICA3PP | Candidate Set Parallelization Strategies for Ant Colony Optimization on the GPU. | Laurence Dawson, Iain A. Stewart |
| 2013 | IWOCA | Graph Editing to a Fixed Target. | Petr A. Golovach, Danil Paulusma, Iain A. Stewart |
| 2011 | COCOA | Hamiltonian Cycles through Prescribed Edges in | Iain A. Stewart |
| 2011 | ICPADS | Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. | Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine |
| 2010 | CSR | Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. | James Gate, Iain A. Stewart |
| 2009 | ICPADS | Pancyclicity and Panconnectivity in Augmented k-ary n-cubes. | Yonghong Xiang, Iain A. Stewart |
| 2008 | CiE | Program Schemes with Deep Pushdown Storage. | Argimiro Arratia, Iain A. Stewart |
| 2006 | ICPADS | Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links. | Iain A. Stewart |
| 2006 | LATIN | The Computational Complexity of the Parallel Knock-Out Problem. | Hajo Broersma, Matthew Johnson, Danil Paulusma, Iain A. Stewart |
| 2001 | COCOON | Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws. | Iain A. Stewart |
| 2001 | WG | A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. | Antonio Puricella, Iain A. Stewart |
| 1999 | CSL | Program Schemes, Arrays, Lindstrm Quantifiers and Zero-One Laws. | Iain A. Stewart |
| 1997 | ICPADS | Embeddings of cycles, meshes and tori in faulty k-ary n-cubes. | Yaagoub Ashir, Iain A. Stewart |
| 1993 | CSL | Incorporating Generalized Quantifiers and the Least Fixed Point Operator. | Iain A. Stewart |
| 1992 | CSL | Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. | Iain A. Stewart |
| 1992 | LFCS | Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. | Iain A. Stewart |
| 1991 | CSL | On Completeness for NP via Projection Translations. | Iain A. Stewart |
| 1991 | WG | Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. | Iain A. Stewart |
| 1990 | ICCI | Using the Hamiltonian Path Operator to Capture NP. | Iain A. Stewart |
| 1990 | WG | Comparing the expressibility of two languages formed using NP-complete graph operators. | Iain A. Stewart |
| 1988 | WG | Colouring Perfect Planar Graphs in Parallel. | Iain A. Stewart |