Iain A. Stewart

Iain A. Stewart, Daniël Paulusma, Matthew Johnson: Editorial. J. Discrete Algorithms 12: 1 (2012)

Iain A. Stewart: On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes. Parallel Processing Letters 22(1) (2012)

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

Yonghong Xiang, Iain A. Stewart: A Multipath Analysis of Biswapped Networks. Comput. J. 54(6): 920-930 (2011)

Yonghong Xiang, Iain A. Stewart: Augmented k-ary n-cubes. Inf. Sci. 181(1): 239-256 (2011)

Yonghong Xiang, Iain A. Stewart: Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption. IEEE Trans. Parallel Distrib. Syst. 22(9): 1506-1513 (2011)

Iain A. Stewart: Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes. COCOA 2011: 82-97

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

Yonghong Xiang, Iain A. Stewart: One-to-many node-disjoint paths in (n, k)-star graphs. Discrete Applied Mathematics 158(1): 62-70 (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): 2912-2924 (2010)

James Gate, Iain A. Stewart: Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. CSR 2010: 120-131

Iain A. Stewart: A general algorithm for detecting faults under the comparison diagnosis model. IPDPS 2010: 1-9

Argimiro Arratia Quesada, Iain A. Stewart: On the power of deep pushdown stacks. Acta Inf. 46(7): 509-531 (2009)

Iain A. Stewart: Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws. Fundam. Inform. 91(2): 411-435 (2009)

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

Iain A. Stewart, Yonghong Xiang: Bipanconnectivity and Bipancyclicity in k-ary n-cubes. IEEE Trans. Parallel Distrib. Syst. 20(1): 25-33 (2009)

Yonghong Xiang, Iain A. Stewart: Pancyclicity and Panconnectivity in Augmented k-ary n-cubes. ICPADS 2009: 308-315

Florent R. Madelaine, Iain A. Stewart: Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. Discrete Mathematics 308(18): 4144-4164 (2008)

Iain A. Stewart: On the fixed-parameter tractability of parameterized model-checking problems. Inf. Process. Lett. 106(1): 33-36 (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): 182-195 (2008)

Iain A. Stewart, Yonghong Xiang: Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links. IEEE Trans. Parallel Distrib. Syst. 19(8): 1071-1085 (2008)

Argimiro Arratia, Iain A. Stewart: Program Schemes with Deep Pushdown Storage. CiE 2008: 11-21

Iain A. Stewart: Distributed Algorithms for Building Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes with Faulty Links. Journal of Interconnection Networks 8(3): 253-284 (2007)

Florent R. Madelaine, Iain A. Stewart: Constraint Satisfaction, Logic and Forbidden Patterns. SIAM J. Comput. 37(1): 132-163 (2007)

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

Iain A. Stewart: Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links. ICPADS (1) 2006: 308-318

Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261

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

Iain A. Stewart: The complexity of achievement and maintenance problems in agent-based systems. Artif. Intell. 146(2): 175-191 (2003)

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

Antonio Puricella, Iain A. Stewart: Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. Theor. Comput. Sci. 290(3): 1897-1913 (2003)

A. A. Arratia-Quesada, Iain A. Stewart: A note on first-order projections and games. Theor. Comput. Sci. 290(3): 2085-2093 (2003)

Yaagoub Ashir, Iain A. Stewart: Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. SIAM J. Discrete Math. 15(3): 317-328 (2002)

Iain A. Stewart: Program schemes, arrays, Lindström quantifiers and zero-one laws. Theor. Comput. Sci. 275(1-2): 283-310 (2002)

Richard Gault, Iain A. Stewart: On a hierarchy involving transitive closure logic and existential second-order quantification. Logic Journal of the IGPL 9(6): 769-780 (2001)

Iain A. Stewart: Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws. COCOON 2001: 39-48

Antonio Puricella, Iain A. Stewart: A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. WG 2001: 306-316

Iain A. Stewart: Program schemes with binary write-once arrays and the complexity classes they capture. CoRR cs.LO/0112002 (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): 77-82 (1999)

A. A. Arratia-Quesada, S. R. Chauhan, Iain A. Stewart: Hierarchies in Classes of Program Schemes. J. Log. Comput. 9(6): 915-957 (1999)

Iain A. Stewart: Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. CSL 1999: 374-388

Clemens Lautemann, Thomas Schwentick, Iain A. Stewart: Positive Versions of Polynomial Time. Inf. Comput. 147(2): 145-170 (1998)

Iain A. Stewart: On locating cubic subgraphs in bounded-degree connected bipartite graphs. Discrete Mathematics 163(1-3): 319-324 (1997)

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

A. A. Arratia-Quesada, Iain A. Stewart: Generalized Hex and Logical Characterizations of Polynomial Space. Inf. Process. Lett. 63(3): 147-152 (1997)

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

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

Yaagoub Ashir, Iain A. Stewart: On Embedding Cycles in k-Ary n-Cubes. Parallel Processing Letters 7(1): 49-55 (1997)

Iain A. Stewart: A Perspective on Lindström Quantifiers and Oracles. ESSLLI 1997: 51-71

Yaagoub Ashir, Iain A. Stewart: Embeddings of cycles, meshes and tori in faulty k-ary n-cubes. ICPADS 1997: 429-435

Iain A. Stewart: Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. Discrete Applied Mathematics 68(3): 223-235 (1996)

Clemens Lautemann, Thomas Schwentick, Iain A. Stewart: On Positive P. IEEE Conference on Computational Complexity 1996: 162-170

Iain A. Stewart, Ben Thompson: On the Intersections of Longest Cycles in a Graph. Experimental Mathematics 4(1): 41-48 (1995)

Iain A. Stewart: Reachability in Some Classes of Acyclic Petri Nets. Fundam. Inform. 23(1): 91-100 (1995)

Iain A. Stewart: Completeness of Path-Problems via Logical Reductions. Inf. Comput. 121(1): 123-134 (1995)

Iain A. Stewart: Complete Problems for Monotone NP. Theor. Comput. Sci. 145(1&2): 147-157 (1995)

Iain A. Stewart: Context-Sensitive Transitive Closure Operators. Ann. Pure Appl. Logic 66(3): 277-301 (1994)

Iain A. Stewart: Deciding whether a planar graph has a cubic subgraph is NP-complete. Discrete Mathematics 126(1-3): 349-357 (1994)

Iain A. Stewart: Logical Description of Monotone NP Problems. J. Log. Comput. 4(4): 337-357 (1994)

Iain A. Stewart: Monotonicity and the Expressibility of NP Operators. Math. Log. Q. 40: 132-140 (1994)

Iain A. Stewart: On Completeness for NP via Projection Translations. Mathematical Systems Theory 27(2): 125-157 (1994)

Iain A. Stewart: Logical and Schematic Characterization of Complexity Classes. Acta Inf. 30(1): 61-87 (1993)

Iain A. Stewart: An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. BIT 33(1): 57-62 (1993)

Iain A. Stewart: Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. Fundam. Inform. 18: 65-92 (1993)

Iain A. Stewart: Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines. Fundam. Inform. 18: 93-105 (1993)

Iain A. Stewart: On Two Approximation Algorithms for the Clique Problem. Int. J. Found. Comput. Sci. 4(2): 117-133 (1993)

Stephan Olariu, Iain A. Stewart: A New Characterization of Unbreakable Graphs. Int. J. Found. Comput. Sci. 4(3): 193-196 (1993)

Iain A. Stewart: Methods for Proving Completeness via Logical Reductions. Theor. Comput. Sci. 118(2): 193-229 (1993)

Iain A. Stewart: Incorporating Generalized Quantifiers and the Least Fixed Point Operator. CSL 1993: 318-333

Iain A. Stewart: Using the Hamiltonian Path Operator to Capture NP. J. Comput. Syst. Sci. 45(1): 127-151 (1992)

Iain A. Stewart: Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. CSL 1992: 410-424

Iain A. Stewart: Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. LFCS 1992: 470-479

Iain A. Stewart: Obtaining Nielsen Reduced Sets in Free Groups. Bulletin of the EATCS 43: 184-188 (1991)

Iain A. Stewart: Complete Problems for Symmetric Logspace Involving Free Groups. Inf. Process. Lett. 40(5): 263-267 (1991)

Iain A. Stewart: Comparing the Expressibility of Languages Formed using NP-Complete Operators. J. Log. Comput. 1(3): 305-330 (1991)

Iain A. Stewart: Complete Problems Involving Boolean Labelled Structures and Projection Transactions. J. Log. Comput. 1(6): 861-882 (1991)

Iain A. Stewart: On Completeness for NP via Projection Translations. CSL 1991: 353-366

Iain A. Stewart: Complete Problems Involving Boolean Labelled Structures and Projections Translations. FSTTCS 1991: 242-260

Iain A. Stewart: Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. WG 1991: 198-208

Iain A. Stewart: On The Graph Accessibility Problem for Directed Graphs of Bounded Degree. Bulletin of the EATCS 42: 190-193 (1990)

Iain A. Stewart: Using the Hamiltonian Path Operator to Capture NP. ICCI 1990: 134-143

Iain A. Stewart: Comparing the expressibility of two languages formed using NP-complete graph operators. WG 1990: 276-290

Iain A. Stewart: An Algorithm for Colouring Perfect Planar Graphs. Inf. Process. Lett. 31(2): 97-101 (1989)

Iain A. Stewart: Colouring Perfect Planar Graphs in Parallel. WG 1988: 268-275

Iain A. Stewart: An Algorithm for Colouring Perfect Planar Graphs. FSTTCS 1987: 58-64