| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Iain A. Stewart |
On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes.  |
Parallel Processing Letters  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart, Daniël Paulusma, Matthew Johnson |
Editorial. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonghong Xiang, Iain A. Stewart |
Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption. |
IEEE Trans. Parallel Distrib. Syst. |
2011 |
DBLP DOI BibTeX RDF |
bipancyclicity, fault-tolerance, Interconnection networks, k-ary n-cubes |
| 1 | Yonghong Xiang, Iain A. Stewart |
Augmented k-ary n-cubes. |
Inf. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonghong Xiang, Iain A. Stewart |
A Multipath Analysis of Biswapped Networks. |
Comput. J. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine |
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. |
ICPADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes. |
COCOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonghong Xiang, Iain A. Stewart |
One-to-many node-disjoint paths in (n, k)-star graphs. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | James Gate, Iain A. Stewart |
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. |
CSR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
A general algorithm for detecting faults under the comparison diagnosis model. |
IPDPS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Argimiro Arratia Quesada, Iain A. Stewart |
On the power of deep pushdown stacks. |
Acta Inf. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart, Yonghong Xiang |
Bipanconnectivity and Bipancyclicity in k-ary n-cubes. |
IEEE Trans. Parallel Distrib. Syst. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays. |
J. Log. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws. |
Fundam. Inform. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonghong Xiang, Iain A. Stewart |
Pancyclicity and Panconnectivity in Augmented k-ary n-cubes. |
ICPADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
On the fixed-parameter tractability of parameterized model-checking problems. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart |
The computational complexity of the parallel knock-out problem. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent R. Madelaine, Iain A. Stewart |
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart, Yonghong Xiang |
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links. |
IEEE Trans. Parallel Distrib. Syst. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Argimiro Arratia, Iain A. Stewart |
Program Schemes with Deep Pushdown Storage. |
CiE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Distributed Algorithms for Building Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes with Faulty Links. |
Journal of Interconnection Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent R. Madelaine, Iain A. Stewart |
Constraint Satisfaction, Logic and Forbidden Patterns. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Gault, Iain A. Stewart |
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart |
The Computational Complexity of the Parallel Knock-Out Problem. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
Parallel knock-out, computational complexity, graphs |
| 1 | Iain A. Stewart |
Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links. |
ICPADS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Florent R. Madelaine, Iain A. Stewart |
Dichotomies for classes of homomorphism problems involving unary functions. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Puricella, Iain A. Stewart |
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | A. A. Arratia-Quesada, Iain A. Stewart |
A note on first-order projections and games. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
The complexity of achievement and maintenance problems in agent-based systems. |
Artif. Intell. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent R. Madelaine, Iain A. Stewart |
Some problems not definable using structure homomorphisms. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
Program schemes, arrays, Lindström quantifiers and zero-one laws. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaagoub Ashir, Iain A. Stewart |
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Gault, Iain A. Stewart |
On a hierarchy involving transitive closure logic and existential second-order quantification. |
Logic Journal of the IGPL |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Program schemes with binary write-once arrays and the complexity classes they capture |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Antonio Puricella, Iain A. Stewart |
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | S. R. Chauhan, Iain A. Stewart |
On the Power of Built-In Relations in Certain Classes of Program Schemes. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | A. A. Arratia-Quesada, S. R. Chauhan, Iain A. Stewart |
Hierarchies in Classes of Program Schemes. |
J. Log. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Lautemann, Thomas Schwentick, Iain A. Stewart |
Positive Versions of Polynomial Time. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic. |
Math. Log. Q. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic. |
Math. Log. Q. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed |
Communication Algorithms in k-Ary n-Cube Interconnection Networks. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | A. A. Arratia-Quesada, Iain A. Stewart |
Generalized Hex and Logical Characterizations of Polynomial Space. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
On locating cubic subgraphs in bounded-degree connected bipartite graphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaagoub Ashir, Iain A. Stewart |
On Embedding Cycles in k-Ary n-Cubes. |
Parallel Processing Letters |
1997 |
DBLP BibTeX RDF |
|
| 1 | Yaagoub Ashir, Iain A. Stewart |
Embeddings of cycles, meshes and tori in faulty k-ary n-cubes. (PDF / PS) |
ICPADS |
1997 |
DBLP DOI BibTeX RDF |
cycles embedding, faulty k-ary n-cubes, meshes, hypercube networks, tori |
| 1 | Iain A. Stewart |
A Perspective on Lindström Quantifiers and Oracles. |
ESSLLI |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Lautemann, Thomas Schwentick, Iain A. Stewart |
On Positive P. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
monotone problems, polynomial time |
| 1 | Iain A. Stewart |
Complete Problems for Monotone NP. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Completeness of Path-Problems via Logical Reductions |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Reachability in Some Classes of Acyclic Petri Nets. |
Fundam. Inform. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Monotonicity and the Expressibility of NP Operators. |
Math. Log. Q. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
Deciding whether a planar graph has a cubic subgraph is NP-complete. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Logical Description of Monotone NP Problems. |
J. Log. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Context-Sensitive Transitive Closure Operators. |
Ann. Pure Appl. Logic |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
On Completeness for NP via Projection Translations. |
Mathematical Systems Theory |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Methods for Proving Completeness via Logical Reductions. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
On Two Approximation Algorithms for the Clique Problem. |
Int. J. Found. Comput. Sci. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Stephan Olariu, Iain A. Stewart |
A New Characterization of Unbreakable Graphs. |
Int. J. Found. Comput. Sci. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
Logical and Schematic Characterization of Complexity Classes. |
Acta Inf. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. |
Fundam. Inform. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines. |
Fundam. Inform. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. |
BIT |
1993 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
Incorporating Generalized Quantifiers and the Least Fixed Point Operator. |
CSL |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Using the Hamiltonian Path Operator to Capture NP. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. |
LFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. |
CSL |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Complete Problems for Symmetric Logspace Involving Free Groups. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Comparing the Expressibility of Languages Formed using NP-Complete Operators. |
J. Log. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Complete Problems Involving Boolean Labelled Structures and Projection Transactions. |
J. Log. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Obtaining Nielsen Reduced Sets in Free Groups. |
Bulletin of the EATCS |
1991 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. |
WG |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
On Completeness for NP via Projection Translations. |
CSL |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Complete Problems Involving Boolean Labelled Structures and Projections Translations. |
FSTTCS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
On The Graph Accessibility Problem for Directed Graphs of Bounded Degree. |
Bulletin of the EATCS |
1990 |
DBLP BibTeX RDF |
|
| 1 | Iain A. Stewart |
Comparing the expressibility of two languages formed using NP-complete graph operators. |
WG |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Using the Hamiltonian Path Operator to Capture NP. |
ICCI |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
An Algorithm for Colouring Perfect Planar Graphs. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
Colouring Perfect Planar Graphs in Parallel. |
WG |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart |
An Algorithm for Colouring Perfect Planar Graphs. |
FSTTCS |
1987 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")