Iain A. Stewart

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