| 2009 |
|---|
| 68 | EE | Iain A. Stewart,
Yonghong Xiang:
Bipanconnectivity and Bipancyclicity in k-ary n-cubes.
IEEE Trans. Parallel Distrib. Syst. 20(1): 25-33 (2009) |
| 2008 |
|---|
| 67 | EE | Argimiro Arratia,
Iain A. Stewart:
Program Schemes with Deep Pushdown Storage.
CiE 2008: 11-21 |
| 66 | EE | 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) |
| 65 | EE | 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) |
| 64 | EE | Iain A. Stewart:
On the fixed-parameter tractability of parameterized model-checking problems.
Inf. Process. Lett. 106(1): 33-36 (2008) |
| 63 | EE | 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) |
| 2007 |
|---|
| 62 | EE | 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) |
| 61 | EE | Florent R. Madelaine,
Iain A. Stewart:
Constraint Satisfaction, Logic and Forbidden Patterns.
SIAM J. Comput. 37(1): 132-163 (2007) |
| 2006 |
|---|
| 60 | EE | Iain A. Stewart:
Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links.
ICPADS (1) 2006: 308-318 |
| 59 | EE | Hajo Broersma,
Matthew Johnson,
Daniël Paulusma,
Iain A. Stewart:
The Computational Complexity of the Parallel Knock-Out Problem.
LATIN 2006: 250-261 |
| 58 | EE | Richard Gault,
Iain A. Stewart:
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes.
Theory Comput. Syst. 39(5): 753-783 (2006) |
| 2004 |
|---|
| 57 | EE | 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) |
| 2003 |
|---|
| 56 | | Florent R. Madelaine,
Iain A. Stewart:
Some problems not definable using structure homomorphisms.
Ars Comb. 67: (2003) |
| 55 | EE | Iain A. Stewart:
The complexity of achievement and maintenance problems in agent-based systems.
Artif. Intell. 146(2): 175-191 (2003) |
| 54 | | Antonio Puricella,
Iain A. Stewart:
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
Theor. Comput. Sci. 290(3): 1897-1913 (2003) |
| 53 | | A. A. Arratia-Quesada,
Iain A. Stewart:
A note on first-order projections and games.
Theor. Comput. Sci. 290(3): 2085-2093 (2003) |
| 2002 |
|---|
| 52 | EE | 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) |
| 51 | EE | Iain A. Stewart:
Program schemes, arrays, Lindström quantifiers and zero-one laws.
Theor. Comput. Sci. 275(1-2): 283-310 (2002) |
| 2001 |
|---|
| 50 | EE | Iain A. Stewart:
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws.
COCOON 2001: 39-48 |
| 49 | EE | Antonio Puricella,
Iain A. Stewart:
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness.
WG 2001: 306-316 |
| 48 | EE | Iain A. Stewart:
Program schemes with binary write-once arrays and the complexity classes they capture
CoRR cs.LO/0112002: (2001) |
| 47 | EE | Richard Gault,
Iain A. Stewart:
On a hierarchy involving transitive closure logic and existential second-order quantification.
Logic Journal of the IGPL 9(6): (2001) |
| 1999 |
|---|
| 46 | | Iain A. Stewart:
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws.
CSL 1999: 374-388 |
| 45 | EE | 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) |
| 44 | EE | A. A. Arratia-Quesada,
S. R. Chauhan,
Iain A. Stewart:
Hierarchies in Classes of Program Schemes.
J. Log. Comput. 9(6): 915-957 (1999) |
| 1998 |
|---|
| 43 | | Clemens Lautemann,
Thomas Schwentick,
Iain A. Stewart:
Positive Versions of Polynomial Time.
Inf. Comput. 147(2): 145-170 (1998) |
| 1997 |
|---|
| 42 | EE | Iain A. Stewart:
A Perspective on Lindström Quantifiers and Oracles.
ESSLLI 1997: 51-71 |
| 41 | EE | Yaagoub Ashir,
Iain A. Stewart:
Embeddings of cycles, meshes and tori in faulty k-ary n-cubes.
ICPADS 1997: 429-435 |
| 40 | EE | Iain A. Stewart:
On locating cubic subgraphs in bounded-degree connected bipartite graphs.
Discrete Mathematics 163(1-3): 319-324 (1997) |
| 39 | EE | Yaagoub Ashir,
Iain A. Stewart,
Aqeel Ahmed:
Communication Algorithms in k-Ary n-Cube Interconnection Networks.
Inf. Process. Lett. 61(1): 43-48 (1997) |
| 38 | EE | A. A. Arratia-Quesada,
Iain A. Stewart:
Generalized Hex and Logical Characterizations of Polynomial Space.
Inf. Process. Lett. 63(3): 147-152 (1997) |
| 37 | | Iain A. Stewart:
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic.
Math. Log. Q. 43: 1-21 (1997) |
| 36 | | Iain A. Stewart:
Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic.
Math. Log. Q. 43: 158-178 (1997) |
| 35 | | Yaagoub Ashir,
Iain A. Stewart:
On Embedding Cycles in k-Ary n-Cubes.
Parallel Processing Letters 7(1): 49-55 (1997) |
| 1996 |
|---|
| 34 | EE | Clemens Lautemann,
Thomas Schwentick,
Iain A. Stewart:
On Positive P.
IEEE Conference on Computational Complexity 1996: 162-170 |
| 33 | EE | Iain A. Stewart:
Finding Regular Subgraphs in Both Arbitrary and Planar Graphs.
Discrete Applied Mathematics 68(3): 223-235 (1996) |
| 1995 |
|---|
| 32 | | Iain A. Stewart:
Reachability in Some Classes of Acyclic Petri Nets.
Fundam. Inform. 23(1): 91-100 (1995) |
| 31 | | Iain A. Stewart:
Completeness of Path-Problems via Logical Reductions
Inf. Comput. 121(1): 123-134 (1995) |
| 30 | EE | Iain A. Stewart:
Complete Problems for Monotone NP.
Theor. Comput. Sci. 145(1&2): 147-157 (1995) |
| 1994 |
|---|
| 29 | | Iain A. Stewart:
Context-Sensitive Transitive Closure Operators.
Ann. Pure Appl. Logic 66(3): 277-301 (1994) |
| 28 | EE | Iain A. Stewart:
Deciding whether a planar graph has a cubic subgraph is NP-complete.
Discrete Mathematics 126(1-3): 349-357 (1994) |
| 27 | | Iain A. Stewart:
Logical Description of Monotone NP Problems.
J. Log. Comput. 4(4): 337-357 (1994) |
| 26 | | Iain A. Stewart:
Monotonicity and the Expressibility of NP Operators.
Math. Log. Q. 40: 132-140 (1994) |
| 25 | | Iain A. Stewart:
On Completeness for NP via Projection Translations.
Mathematical Systems Theory 27(2): 125-157 (1994) |
| 1993 |
|---|
| 24 | | Iain A. Stewart:
Incorporating Generalized Quantifiers and the Least Fixed Point Operator.
CSL 1993: 318-333 |
| 23 | | Iain A. Stewart:
Logical and Schematic Characterization of Complexity Classes.
Acta Inf. 30(1): 61-87 (1993) |
| 22 | | Iain A. Stewart:
An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets.
BIT 33(1): 57-62 (1993) |
| 21 | | Iain A. Stewart:
Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines.
Fundam. Inform. 18: 65-92 (1993) |
| 20 | | Iain A. Stewart:
Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines.
Fundam. Inform. 18: 93-105 (1993) |
| 19 | | Iain A. Stewart:
On Two Approximation Algorithms for the Clique Problem.
Int. J. Found. Comput. Sci. 4(2): 117-133 (1993) |
| 18 | | Stephan Olariu,
Iain A. Stewart:
A New Characterization of Unbreakable Graphs.
Int. J. Found. Comput. Sci. 4(3): 193-196 (1993) |
| 17 | | Iain A. Stewart:
Methods for Proving Completeness via Logical Reductions.
Theor. Comput. Sci. 118(2): 193-229 (1993) |
| 1992 |
|---|
| 16 | | Iain A. Stewart:
Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines.
CSL 1992: 410-424 |
| 15 | | Iain A. Stewart:
Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines.
LFCS 1992: 470-479 |
| 14 | | Iain A. Stewart:
Using the Hamiltonian Path Operator to Capture NP.
J. Comput. Syst. Sci. 45(1): 127-151 (1992) |
| 1991 |
|---|
| 13 | | Iain A. Stewart:
On Completeness for NP via Projection Translations.
CSL 1991: 353-366 |
| 12 | | Iain A. Stewart:
Complete Problems Involving Boolean Labelled Structures and Projections Translations.
FSTTCS 1991: 242-260 |
| 11 | | Iain A. Stewart:
Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs.
WG 1991: 198-208 |
| 10 | | Iain A. Stewart:
Obtaining Nielsen Reduced Sets in Free Groups.
Bulletin of the EATCS 43: 184-188 (1991) |
| 9 | | Iain A. Stewart:
Complete Problems for Symmetric Logspace Involving Free Groups.
Inf. Process. Lett. 40(5): 263-267 (1991) |
| 8 | | Iain A. Stewart:
Comparing the Expressibility of Languages Formed using NP-Complete Operators.
J. Log. Comput. 1(3): 305-330 (1991) |
| 7 | | Iain A. Stewart:
Complete Problems Involving Boolean Labelled Structures and Projection Transactions.
J. Log. Comput. 1(6): 861-882 (1991) |
| 1990 |
|---|
| 6 | | Iain A. Stewart:
Using the Hamiltonian Path Operator to Capture NP.
ICCI 1990: 134-143 |
| 5 | | Iain A. Stewart:
Comparing the expressibility of two languages formed using NP-complete graph operators.
WG 1990: 276-290 |
| 4 | | Iain A. Stewart:
On The Graph Accessibility Problem for Directed Graphs of Bounded Degree.
Bulletin of the EATCS 42: 190-193 (1990) |
| 1989 |
|---|
| 3 | | Iain A. Stewart:
An Algorithm for Colouring Perfect Planar Graphs.
Inf. Process. Lett. 31(2): 97-101 (1989) |
| 1988 |
|---|
| 2 | | Iain A. Stewart:
Colouring Perfect Planar Graphs in Parallel.
WG 1988: 268-275 |
| 1987 |
|---|
| 1 | | Iain A. Stewart:
An Algorithm for Colouring Perfect Planar Graphs.
FSTTCS 1987: 58-64 |
