Iain A. Stewart

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 23

Top Venues

CoRR

J. Comput. Syst. Sci.

Discret. Appl. Math.

J. Parallel Distributed Comput.

Publications

David C. Kutner, Iain A. Stewart
Reconfigurable routing in data center networks. CoRR (2024)
Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan
Payment Scheduling in the Interval Debt Model. CoRR (2024)
Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan
Payment Scheduling in the Interval Debt Model. SOFSEM (2023)
Alejandro Erickson, Javier Navaridas, Iain A. Stewart
Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs. J. Comput. Syst. Sci. 108 (2020)
Iain A. Stewart
Using semidirect products of groups to build classes of interconnection networks. Discret. Appl. Math. 283 (2020)
Iain A. Stewart
Variational networks of cube-connected cycles are recursive cubes of rings. Inf. Process. Lett. 157 (2020)
Javier Navaridas, Jose Antonio Pascual, Alejandro Erickson, Iain A. Stewart, Mikel Luján
INRFlow: An interconnection networks research flow-level simulation framework. J. Parallel Distributed Comput. 130 (2019)
Iain A. Stewart, Alejandro Erickson
The influence of datacenter usage on symmetry in datacenter network design. J. Supercomput. 74 (6) (2018)
Petr A. Golovach, Daniël Paulusma, Iain A. Stewart
Graph editing to a fixed target. Discret. Appl. Math. 216 (2017)
Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart
An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar. IEEE Trans. Parallel Distributed Syst. 28 (3) (2017)
Iain A. Stewart
On the combinatorial design of data centre network topologies. J. Comput. Syst. Sci. 89 (2017)
Alejandro Erickson, Iain A. Stewart, Javier Navaridas, Abbas Eslami Kiasari
The stellar transformation: From interconnection networks to datacenter networks. Comput. Networks 113 (2017)
Iain A. Stewart
Sufficient conditions for Hamiltonicity in multiswapped networks. J. Parallel Distributed Comput. 101 (2017)
Alejandro Erickson, Iain A. Stewart, Jose Antonio Pascual, Javier Navaridas
Improved routing algorithms in the dual-port datacenter networks HCN and BCN. Future Gener. Comput. Syst. 75 (2017)
Che-Nan Kuo, Iain A. Stewart
Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes. Theor. Comput. Sci. 627 (2016)
Iain A. Stewart
On the Mathematics of Data Centre Network Topologies. CoRR (2016)
Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart
An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar. COCOA (2015)
Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart
On Routing Algorithms for the DPillar Data Centre Networks. ICA3PP (4) (2015)
Alejandro Erickson, Iain A. Stewart, Javier Navaridas, Abbas Eslami Kiasari
Star-Replaced Networks: A Generalised Class of Dual-Port Server-Centric Data Centre Networks. CoRR (2015)
Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart
An efficient shortest-path routing algorithm in the data centre network {DP}illar. CoRR (2015)
Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart
Routing Algorithms for Recursively-Defined Data Centre Networks. CoRR (2015)
Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart
Routing Algorithms for Recursively-Defined Data Centre Networks. TrustCom/BigDataSE/ISPA (3) (2015)
Iain A. Stewart
On the Mathematics of Data Centre Network Topologies. FCT (2015)
Iain A. Stewart
Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori. IEEE Trans. Computers 63 (10) (2014)
Laurence Dawson, Iain A. Stewart
Accelerating ant colony optimization-based edge detection on the GPU using CUDA. IEEE Congress on Evolutionary Computation (2014)
Iain A. Stewart
Improved Routing in the Data Centre Networks HCN and BCN. CANDAR (2014)
Laurence Dawson, Iain A. Stewart
Candidate Set Parallelization Strategies for Ant Colony Optimization on the GPU. ICA3PP (1) (2013)
Petr A. Golovach, Daniël Paulusma, Iain A. Stewart
Graph Editing to a Fixed Target. IWOCA (2013)
Iain A. Stewart
Multiswapped networks and their topological and algorithmic properties. J. Comput. Syst. Sci. 79 (8) (2013)
James Gate, Iain A. Stewart
The expressibility of fragments of Hybrid Graph Logic on finite digraphs. J. Appl. Log. 11 (3) (2013)
Laurence Dawson, Iain A. Stewart
Improving Ant Colony Optimization performance on the GPU using CUDA. IEEE Congress on Evolutionary Computation (2013)
Iain A. Stewart
A general technique to establish the asymptotic conditional diagnosability of interconnection networks. Theor. Comput. Sci. 452 (2012)
Iain A. Stewart
On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes. Parallel Process. Lett. 22 (1) (2012)
Iain A. Stewart, Daniël Paulusma, Matthew Johnson
Editorial. J. Discrete Algorithms 12 (2012)
Yonghong Xiang, Iain A. Stewart
A Multipath Analysis of Biswapped Networks. Comput. J. 54 (6) (2011)
Iain A. Stewart
-Cubes. COCOA (2011)
Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. ICPADS (2011)
Yonghong Xiang, Iain A. Stewart
Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption. IEEE Trans. Parallel Distributed Syst. 22 (9) (2011)
Yonghong Xiang, Iain A. Stewart
Augmented k-ary n-cubes. Inf. Sci. 181 (1) (2011)
James Gate, Iain A. Stewart
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. CSR (2010)
Yonghong Xiang, Iain A. Stewart
One-to-many node-disjoint paths in (n, k)-star graphs. Discret. Appl. Math. 158 (1) (2010)
Pao-Lien Lai, Hong-Chun Hsu, Chang-Hsiung Tsai, Iain A. Stewart
A class of hierarchical graphs as topologies for interconnection networks. Theor. Comput. Sci. 411 (31-33) (2010)
Iain A. Stewart
A general algorithm for detecting faults under the comparison diagnosis model. IPDPS (2010)
Argimiro Arratia Quesada, Iain A. Stewart
On the power of deep pushdown stacks. Acta Informatica 46 (7) (2009)
Iain A. Stewart, Yonghong Xiang
Bipanconnectivity and Bipancyclicity in k-ary n-cubes. IEEE Trans. Parallel Distributed Syst. 20 (1) (2009)
Yonghong Xiang, Iain A. Stewart
Pancyclicity and Panconnectivity in Augmented k-ary n-cubes. ICPADS (2009)
Iain A. Stewart
Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays. J. Log. Comput. 19 (1) (2009)
Iain A. Stewart
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws. Fundam. Informaticae 91 (2) (2009)
Argimiro Arratia, Iain A. Stewart
Program Schemes with Deep Pushdown Storage. CiE (2008)
Florent R. Madelaine, Iain A. Stewart
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. Discret. Math. 308 (18) (2008)
Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393 (1-3) (2008)
Iain A. Stewart, Yonghong Xiang
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links. IEEE Trans. Parallel Distributed Syst. 19 (8) (2008)
Iain A. Stewart
On the fixed-parameter tractability of parameterized model-checking problems. Inf. Process. Lett. 106 (1) (2008)
Florent R. Madelaine, Iain A. Stewart
Constraint Satisfaction, Logic and Forbidden Patterns. SIAM J. Comput. 37 (1) (2007)
Iain A. Stewart
Distributed Algorithms for Building Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes with Faulty Links. J. Interconnect. Networks 8 (3) (2007)
Richard Gault, Iain A. Stewart
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes. Theory Comput. Syst. 39 (5) (2006)
Iain A. Stewart
Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links. ICPADS (1) (2006)
Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
The Computational Complexity of the Parallel Knock-Out Problem. LATIN (2006)
Tomás Feder, Florent R. Madelaine, Iain A. Stewart
Dichotomies for classes of homomorphism problems involving unary functions. Theor. Comput. Sci. 314 (1-2) (2004)
Iain A. Stewart
The complexity of achievement and maintenance problems in agent-based systems. Artif. Intell. 146 (2) (2003)
Antonio Puricella, Iain A. Stewart
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. Theor. Comput. Sci. 290 (3) (2003)
Iain A. Stewart
Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures. LMS J. Comput. Math. 6 (2003)
Argimiro Arratia Quesada, Iain A. Stewart
A note on first-order projections and games. Theor. Comput. Sci. 290 (3) (2003)
Florent R. Madelaine, Iain A. Stewart
Some problems not definable using structure homomorphisms. Ars Comb. 67 (2003)
Yaagoub Ashir, Iain A. Stewart
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. SIAM J. Discret. Math. 15 (3) (2002)
Iain A. Stewart
Program schemes, arrays, Lindström quantifiers and zero-one laws. Theor. Comput. Sci. 275 (1-2) (2002)
Iain A. Stewart
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws. COCOON (2001)
Iain A. Stewart
Program schemes with binary write-once arrays and the complexity classes they capture CoRR (2001)
Antonio Puricella, Iain A. Stewart
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. WG (2001)
Richard Gault, Iain A. Stewart
On a hierarchy involving transitive closure logic and existential second-order quantification. Log. J. IGPL 9 (6) (2001)
S. R. Chauhan, Iain A. Stewart
On the Power of Built-In Relations in Certain Classes of Program Schemes. Inf. Process. Lett. 69 (2) (1999)
Iain A. Stewart
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. CSL (1999)
Argimiro Arratia Quesada, S. R. Chauhan, Iain A. Stewart
Hierarchies in Classes of Program Schemes. J. Log. Comput. 9 (6) (1999)
Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
Positive Versions of Polynomial Time. Inf. Comput. 147 (2) (1998)
Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed
Communication Algorithms in k-Ary n-Cube Interconnection Networks. Inf. Process. Lett. 61 (1) (1997)
Yaagoub Ashir, Iain A. Stewart
-Cubes. Parallel Process. Lett. 7 (1) (1997)
Iain A. Stewart
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic. Math. Log. Q. 43 (1997)
Iain A. Stewart
A Perspective on Lindström Quantifiers and Oracles. ESSLLI (1997)
Iain A. Stewart
On locating cubic subgraphs in bounded-degree connected bipartite graphs. Discret. Math. 163 (1-3) (1997)
Yaagoub Ashir, Iain A. Stewart
Embeddings of cycles, meshes and tori in faulty k-ary n-cubes. ICPADS (1997)
Iain A. Stewart
Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic. Math. Log. Q. 43 (1997)
Argimiro Arratia Quesada, Iain A. Stewart
Generalized Hex and Logical Characterizations of Polynomial Space. Inf. Process. Lett. 63 (3) (1997)
Iain A. Stewart
Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. Discret. Appl. Math. 68 (3) (1996)
Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
On Positive P. Computational Complexity Conference (1996)
Iain A. Stewart
Completeness of Path-Problems via Logical Reductions Inf. Comput. 121 (1) (1995)
Iain A. Stewart
Reachability in Some Classes of Acyclic Petri Nets. Fundam. Informaticae 23 (1) (1995)
Iain A. Stewart, Ben Thompson
On the Intersections of Longest Cycles in a Graph. Exp. Math. 4 (1) (1995)
Iain A. Stewart
Complete Problems for Monotone NP. Theor. Comput. Sci. 145 (1&2) (1995)
Iain A. Stewart
Context-Sensitive Transitive Closure Operators. Ann. Pure Appl. Log. 66 (3) (1994)
Iain A. Stewart
Monotonicity and the Expressibility of NP Operators. Math. Log. Q. 40 (1994)
Iain A. Stewart
On Completeness for NP via Projection Translations. Math. Syst. Theory 27 (2) (1994)
Iain A. Stewart
Logical Description of Monotone NP Problems. J. Log. Comput. 4 (4) (1994)
Iain A. Stewart
Deciding whether a planar graph has a cubic subgraph is NP-complete. Discret. Math. 126 (1-3) (1994)
Iain A. Stewart
Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines. Fundam. Informaticae 18 (1993)
Iain A. Stewart
On Two Approximation Algorithms for the Clique Problem. Int. J. Found. Comput. Sci. 4 (2) (1993)
Iain A. Stewart
Methods for Proving Completeness via Logical Reductions. Theor. Comput. Sci. 118 (2) (1993)
Iain A. Stewart
An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. BIT 33 (1) (1993)
Iain A. Stewart
Logical and Schematic Characterization of Complexity Classes. Acta Informatica 30 (1) (1993)
Iain A. Stewart
Incorporating Generalized Quantifiers and the Least Fixed Point Operator. CSL (1993)
Stephan Olariu, Iain A. Stewart
A New Characterization of Unbreakable Graphs. Int. J. Found. Comput. Sci. 4 (3) (1993)

Iain A. Stewart.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Iain A. Stewart