Colouring Perfect Planar Graphs in Parallel. - Iain A. Stewart (WG, 1988)

An Algorithm for Colouring Perfect Planar Graphs. - Iain A. Stewart (Inf. Process. Lett., 1989)

Comparing the expressibility of two languages formed using NP-complete graph operators. - Iain A. Stewart (WG, 1990)

On The Graph Accessibility Problem for Directed Graphs of Bounded Degree. - Iain A. Stewart (Bull. EATCS, 1990)

Complete Problems Involving Boolean Labelled Structures and Projections Translations. - Iain A. Stewart (FSTTCS, 1991)

Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. - Iain A. Stewart (WG, 1991)

Obtaining Nielsen Reduced Sets in Free Groups. - Iain A. Stewart (Bull. EATCS, 1991)

Complete Problems for Symmetric Logspace Involving Free Groups. - Iain A. Stewart (Inf. Process. Lett., 1991)

Comparing the Expressibility of Languages Formed using NP-Complete Operators. - Iain A. Stewart (J. Log. Comput., 1991)

Complete Problems Involving Boolean Labelled Structures and Projection Transactions. - Iain A. Stewart (J. Log. Comput., 1991)

Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. - Iain A. Stewart (CSL, 1992)

Refining known Results on the generalized Word Problem for Free Groups. - Iain A. Stewart (Int. J. Algebra Comput., 1992)

Using the Hamiltonian Path Operator to Capture NP. - Iain A. Stewart (J. Comput. Syst. Sci., 1992)

Incorporating Generalized Quantifiers and the Least Fixed Point Operator. - Iain A. Stewart (CSL, 1993)

Logical and Schematic Characterization of Complexity Classes. - Iain A. Stewart (Acta Informatica, 1993)

An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. - Iain A. Stewart (BIT, 1993)

Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. - Iain A. Stewart (Fundam. Informaticae, 1993)

Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines. - Iain A. Stewart (Fundam. Informaticae, 1993)

A New Characterization of Unbreakable Graphs. - Stephan Olariu; Iain A. Stewart (Int. J. Found. Comput. Sci., 1993)

On Two Approximation Algorithms for the Clique Problem. - Iain A. Stewart (Int. J. Found. Comput. Sci., 1993)

Methods for Proving Completeness via Logical Reductions. - Iain A. Stewart (Theor. Comput. Sci., 1993)

Context-Sensitive Transitive Closure Operators. - Iain A. Stewart (Ann. Pure Appl. Log., 1994)

Deciding whether a planar graph has a cubic subgraph is NP-complete. - Iain A. Stewart (Discret. Math., 1994)

Logical Description of Monotone NP Problems. - Iain A. Stewart (J. Log. Comput., 1994)

Monotonicity and the Expressibility of NP Operators. - Iain A. Stewart (Math. Log. Q., 1994)

On Completeness for NP via Projection Translations. - Iain A. Stewart (Math. Syst. Theory, 1994)

On the Intersections of Longest Cycles in a Graph. - Iain A. Stewart; Ben Thompson (Exp. Math., 1995)

Reachability in Some Classes of Acyclic Petri Nets. - Iain A. Stewart (Fundam. Informaticae, 1995)

Complete Problems for Monotone NP. - Iain A. Stewart (Theor. Comput. Sci., 1995)

Completeness of Path-Problems via Logical Reductions - Iain A. Stewart (Inf. Comput., 1995)

On Positive P. - Clemens Lautemann; Thomas Schwentick; Iain A. Stewart (CCC, 1996)

Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. - Iain A. Stewart (Discret. Appl. Math., 1996)

A Perspective on Lindström Quantifiers and Oracles. - Iain A. Stewart (ESSLLI, 1997)

Embeddings of cycles, meshes and tori in faulty k-ary n-cubes. - Yaagoub Ashir; Iain A. Stewart (ICPADS, 1997)

On locating cubic subgraphs in bounded-degree connected bipartite graphs. - Iain A. Stewart (Discret. Math., 1997)

Generalized Hex and Logical Characterizations of Polynomial Space. - Argimiro Arratia Quesada; Iain A. Stewart (Inf. Process. Lett., 1997)

Communication Algorithms in k-Ary n-Cube Interconnection Networks. - Yaagoub Ashir; Iain A. Stewart; Aqeel Ahmed (Inf. Process. Lett., 1997)

Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic. - Iain A. Stewart (Math. Log. Q., 1997)

Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic. - Iain A. Stewart (Math. Log. Q., 1997)

On Embedding Cycles in k-Ary n-Cubes. - Yaagoub Ashir; Iain A. Stewart (Parallel Process. Lett., 1997)

Positive Versions of Polynomial Time. - Clemens Lautemann; Thomas Schwentick; Iain A. Stewart (Inf. Comput., 1998)

On the Power of Built-In Relations in Certain Classes of Program Schemes. - S. R. Chauhan; Iain A. Stewart (Inf. Process. Lett., 1999)

Hierarchies in Classes of Program Schemes. - Argimiro Arratia Quesada; S. R. Chauhan; Iain A. Stewart (J. Log. Comput., 1999)

A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. - Antonio Puricella; Iain A. Stewart (WG, 2001)

Program schemes with binary write-once arrays and the complexity classes they capture - Iain A. Stewart (CoRR, 2001)

On a hierarchy involving transitive closure logic and existential second-order quantification. - Richard Gault; Iain A. Stewart (Log. J. IGPL, 2001)

Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. - Yaagoub Ashir; Iain A. Stewart (SIAM J. Discret. Math., 2002)

Program schemes, arrays, Lindström quantifiers and zero-one laws. - Iain A. Stewart (Theor. Comput. Sci., 2002)

The complexity of achievement and maintenance problems in agent-based systems. - Iain A. Stewart (Artif. Intell., 2003)

Some problems not definable using structure homomorphisms. - Florent R. Madelaine; Iain A. Stewart (Ars Comb., 2003)

Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures. - Iain A. Stewart (LMS J. Comput. Math., 2003)

A note on first-order projections and games. - Argimiro Arratia Quesada; Iain A. Stewart (Theor. Comput. Sci., 2003)

Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. - Antonio Puricella; Iain A. Stewart (Theor. Comput. Sci., 2003)

Dichotomies for classes of homomorphism problems involving unary functions. - Tomás Feder; Florent R. Madelaine; Iain A. Stewart (Theor. Comput. Sci., 2004)

An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes. - Richard Gault; Iain A. Stewart (Theory Comput. Syst., 2006)

Distributed Algorithms for Building Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes with Faulty Links. - Iain A. Stewart (J. Interconnect. Networks, 2007)

Constraint Satisfaction, Logic and Forbidden Patterns. - Florent R. Madelaine; Iain A. Stewart (SIAM J. Comput., 2007)

Program Schemes with Deep Pushdown Storage. - Argimiro Arratia; Iain A. Stewart (CiE, 2008)

Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. - Florent R. Madelaine; Iain A. Stewart (Discret. Math., 2008)

On the fixed-parameter tractability of parameterized model-checking problems. - Iain A. Stewart (Inf. Process. Lett., 2008)

The computational complexity of the parallel knock-out problem. - Hajo Broersma; Matthew Johnson 002; Daniël Paulusma; Iain A. Stewart (Theor. Comput. Sci., 2008)

Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links. - Iain A. Stewart; Yonghong Xiang (IEEE Trans. Parallel Distributed Syst., 2008)

Pancyclicity and Panconnectivity in Augmented k-ary n-cubes. - Yonghong Xiang; Iain A. Stewart (ICPADS, 2009)

On the power of deep pushdown stacks. - Argimiro Arratia Quesada; Iain A. Stewart (Acta Informatica, 2009)

Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws. - Iain A. Stewart (Fundam. Informaticae, 2009)

Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays. - Iain A. Stewart (J. Log. Comput., 2009)

Bipanconnectivity and Bipancyclicity in k-ary n-cubes. - Iain A. Stewart; Yonghong Xiang (IEEE Trans. Parallel Distributed Syst., 2009)

Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. - James Gate; Iain A. Stewart (CSR, 2010)

A general algorithm for detecting faults under the comparison diagnosis model. - Iain A. Stewart (IPDPS, 2010)

One-to-many node-disjoint paths in (n, k)-star graphs. - Yonghong Xiang; Iain A. Stewart (Discret. Appl. Math., 2010)

A class of hierarchical graphs as topologies for interconnection networks. - Pao-Lien Lai; Hong-Chun Hsu; Chang-Hsiung Tsai; Iain A. Stewart (Theor. Comput. Sci., 2010)

Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes. - Iain A. Stewart (COCOA, 2011)

Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. - Yonghong Xiang; Iain A. Stewart; Florent R. Madelaine (ICPADS, 2011)

A Multipath Analysis of Biswapped Networks. - Yonghong Xiang; Iain A. Stewart (Comput. J., 2011)

Augmented k-ary n-cubes. - Yonghong Xiang; Iain A. Stewart (Inf. Sci., 2011)

Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption. - Yonghong Xiang; Iain A. Stewart (IEEE Trans. Parallel Distributed Syst., 2011)

Editorial. - Iain A. Stewart; Daniël Paulusma; Matthew Johnson 002 (J. Discrete Algorithms, 2012)

On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes. - Iain A. Stewart (Parallel Process. Lett., 2012)

A general technique to establish the asymptotic conditional diagnosability of interconnection networks. - Iain A. Stewart (Theor. Comput. Sci., 2012)

Improving Ant Colony Optimization performance on the GPU using CUDA. - Laurence Dawson; Iain A. Stewart (IEEE Congress on Evolutionary Computation, 2013)

Candidate Set Parallelization Strategies for Ant Colony Optimization on the GPU. - Laurence Dawson; Iain A. Stewart (ICA3PP (1), 2013)

The expressibility of fragments of Hybrid Graph Logic on finite digraphs. - James Gate; Iain A. Stewart (J. Appl. Log., 2013)

Multiswapped networks and their topological and algorithmic properties. - Iain A. Stewart (J. Comput. Syst. Sci., 2013)

Accelerating ant colony optimization-based edge detection on the GPU using CUDA. - Laurence Dawson; Iain A. Stewart (IEEE Congress on Evolutionary Computation, 2014)

Improved Routing in the Data Centre Networks HCN and BCN. - Iain A. Stewart (CANDAR, 2014)

Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori. - Iain A. Stewart (IEEE Trans. Computers, 2014)

An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar. - Alejandro Erickson; Abbas Eslami Kiasari; Javier Navaridas; Iain A. Stewart (COCOA, 2015)

On the Mathematics of Data Centre Network Topologies. - Iain A. Stewart (FCT, 2015)

On Routing Algorithms for the DPillar Data Centre Networks. - Abbas Eslami Kiasari; Javier Navaridas; Iain A. Stewart (ICA3PP (4), 2015)

Routing Algorithms for Recursively-Defined Data Centre Networks. - Alejandro Erickson; Abbas Eslami Kiasari; Javier Navaridas; Iain A. Stewart (TrustCom/BigDataSE/ISPA (3), 2015)

An efficient shortest-path routing algorithm in the data centre network {DP}illar. - Alejandro Erickson; Abbas Eslami Kiasari; Javier Navaridas; Iain A. Stewart (CoRR, 2015)

Star-Replaced Networks: A Generalised Class of Dual-Port Server-Centric Data Centre Networks. - Alejandro Erickson; Iain A. Stewart; Javier Navaridas; Abbas Eslami Kiasari (CoRR, 2015)

Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes. - Che-Nan Kuo; Iain A. Stewart (Theor. Comput. Sci., 2016)

The stellar transformation: From interconnection networks to datacenter networks. - Alejandro Erickson; Iain A. Stewart; Javier Navaridas; Abbas Eslami Kiasari (Comput. Networks, 2017)

Graph editing to a fixed target. - Petr A. Golovach; Daniël Paulusma; Iain A. Stewart (Discret. Appl. Math., 2017)

Improved routing algorithms in the dual-port datacenter networks HCN and BCN. - Alejandro Erickson; Iain A. Stewart; Jose Antonio Pascual; Javier Navaridas (Future Gener. Comput. Syst., 2017)

On the combinatorial design of data centre network topologies. - Iain A. Stewart (J. Comput. Syst. Sci., 2017)

Sufficient conditions for Hamiltonicity in multiswapped networks. - Iain A. Stewart (J. Parallel Distributed Comput., 2017)

An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar. - Alejandro Erickson; Abbas Eslami Kiasari; Javier Navaridas; Iain A. Stewart (IEEE Trans. Parallel Distributed Syst., 2017)

The influence of datacenter usage on symmetry in datacenter network design. - Iain A. Stewart; Alejandro Erickson (J. Supercomput., 2018)

INRFlow: An interconnection networks research flow-level simulation framework. - Javier Navaridas; Jose Antonio Pascual; Alejandro Erickson; Iain A. Stewart; Mikel Luján (J. Parallel Distributed Comput., 2019)

Using semidirect products of groups to build classes of interconnection networks. - Iain A. Stewart (Discret. Appl. Math., 2020)

Variational networks of cube-connected cycles are recursive cubes of rings. - Iain A. Stewart (Inf. Process. Lett., 2020)

Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs. - Alejandro Erickson; Javier Navaridas; Iain A. Stewart (J. Comput. Syst. Sci., 2020)

Payment scheduling in the Interval Debt Model. - Tom Friedetzky; David C. Kutner; George B. Mertzios; Iain A. Stewart; Amitabh Trehan (Theor. Comput. Sci., 2025)

Reconfigurable routing in data center networks. - David C. Kutner; Iain A. Stewart (Theor. Comput. Sci., 2025)