Iain A. Stewart

According to our database1, Iain A. Stewart
  • authored at least 109 papers between 1987 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar.
IEEE Trans. Parallel Distrib. Syst., 2017

Sufficient conditions for Hamiltonicity in multiswapped networks.
J. Parallel Distrib. Comput., 2017

On the combinatorial design of data centre network topologies.
J. Comput. Syst. Sci., 2017

Improved routing algorithms in the dual-port datacenter networks HCN and BCN.
Future Generation Comp. Syst., 2017

Graph editing to a fixed target.
Discrete Applied Mathematics, 2017

The stellar transformation: From interconnection networks to datacenter networks.
Computer Networks, 2017

2016
Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes.
Theor. Comput. Sci., 2016

On the Mathematics of Data Centre Network Topologies.
CoRR, 2016

2015
Star-Replaced Networks: A Generalised Class of Dual-Port Server-Centric Data Centre Networks.
CoRR, 2015

Routing Algorithms for Recursively-Defined Data Centre Networks.
CoRR, 2015

An efficient shortest-path routing algorithm in the data centre network {DP}illar.
CoRR, 2015

Routing Algorithms for Recursively-Defined Data Centre Networks.
Proceedings of the 2015 IEEE TrustCom/BigDataSE/ISPA, 2015

On Routing Algorithms for the DPillar Data Centre Networks.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

On the Mathematics of Data Centre Network Topologies.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori.
IEEE Trans. Computers, 2014

Improved Routing in the Data Centre Networks HCN and BCN.
Proceedings of the Second International Symposium on Computing and Networking, 2014

Accelerating ant colony optimization-based edge detection on the GPU using CUDA.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013
Multiswapped networks and their topological and algorithmic properties.
J. Comput. Syst. Sci., 2013

The expressibility of fragments of Hybrid Graph Logic on finite digraphs.
J. Applied Logic, 2013

Graph Editing to a Fixed Target.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Candidate Set Parallelization Strategies for Ant Colony Optimization on the GPU.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2013

Improving Ant Colony Optimization performance on the GPU using CUDA.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
A general technique to establish the asymptotic conditional diagnosability of interconnection networks.
Theor. Comput. Sci., 2012

On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes.
Parallel Processing Letters, 2012

Editorial.
J. Discrete Algorithms, 2012

2011
Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption.
IEEE Trans. Parallel Distrib. Syst., 2011

Augmented k-ary n-cubes.
Inf. Sci., 2011

A Multipath Analysis of Biswapped Networks.
Comput. J., 2011

Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges.
Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
A class of hierarchical graphs as topologies for interconnection networks.
Theor. Comput. Sci., 2010

One-to-many node-disjoint paths in (n, k)-star graphs.
Discrete Applied Mathematics, 2010

A general algorithm for detecting faults under the comparison diagnosis model.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Frameworks for Logically Classifying Polynomial-Time Optimisation Problems.
Proceedings of the Computer Science, 2010

2009
Bipanconnectivity and Bipancyclicity in k-ary n-cubes.
IEEE Trans. Parallel Distrib. Syst., 2009

Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays.
J. Log. Comput., 2009

Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws.
Fundam. Inform., 2009

On the power of deep pushdown stacks.
Acta Inf., 2009

Pancyclicity and Panconnectivity in Augmented k-ary n-cubes.
Proceedings of the 15th IEEE International Conference on Parallel and Distributed Systems, 2009

2008
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links.
IEEE Trans. Parallel Distrib. Syst., 2008

The computational complexity of the parallel knock-out problem.
Theor. Comput. Sci., 2008

On the fixed-parameter tractability of parameterized model-checking problems.
Inf. Process. Lett., 2008

Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies.
Discrete Mathematics, 2008

Program Schemes with Deep Pushdown Storage.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Constraint Satisfaction, Logic and Forbidden Patterns.
SIAM J. Comput., 2007

Distributed Algorithms for Building Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes with Faulty Links.
Journal of Interconnection Networks, 2007

2006
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes.
Theory Comput. Syst., 2006

The Computational Complexity of the Parallel Knock-Out Problem.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links.
Proceedings of the 12th International Conference on Parallel and Distributed Systems, 2006

2004
Dichotomies for classes of homomorphism problems involving unary functions.
Theor. Comput. Sci., 2004

2003
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
Theor. Comput. Sci., 2003

A note on first-order projections and games.
Theor. Comput. Sci., 2003

Some problems not definable using structure homomorphisms.
Ars Comb., 2003

The complexity of achievement and maintenance problems in agent-based systems.
Artif. Intell., 2003

2002
Program schemes, arrays, Lindström quantifiers and zero-one laws.
Theor. Comput. Sci., 2002

Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes.
SIAM J. Discrete Math., 2002

2001
On a hierarchy involving transitive closure logic and existential second-order quantification.
Logic Journal of the IGPL, 2001

Program schemes with binary write-once arrays and the complexity classes they capture
CoRR, 2001

A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

1999
Hierarchies in Classes of Program Schemes.
J. Log. Comput., 1999

On the Power of Built-In Relations in Certain Classes of Program Schemes.
Inf. Process. Lett., 1999

Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
Positive Versions of Polynomial Time.
Inf. Comput., 1998

1997
On Embedding Cycles in k-Ary n-Cubes.
Parallel Processing Letters, 1997

Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic.
Math. Log. Q., 1997

Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic.
Math. Log. Q., 1997

Communication Algorithms in k-Ary n-Cube Interconnection Networks.
Inf. Process. Lett., 1997

Generalized Hex and Logical Characterizations of Polynomial Space.
Inf. Process. Lett., 1997

On locating cubic subgraphs in bounded-degree connected bipartite graphs.
Discrete Mathematics, 1997

Embeddings of cycles, meshes and tori in faulty k-ary n-cubes.
Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

A Perspective on Lindström Quantifiers and Oracles.
Proceedings of the Generalized Quantifiers and Computation, 1997

1996
Finding Regular Subgraphs in Both Arbitrary and Planar Graphs.
Discrete Applied Mathematics, 1996

On Positive P.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
Completeness of Path-Problems via Logical Reductions
Inf. Comput., August, 1995

Complete Problems for Monotone NP.
Theor. Comput. Sci., 1995

Reachability in Some Classes of Acyclic Petri Nets.
Fundam. Inform., 1995

On the Intersections of Longest Cycles in a Graph.
Experimental Mathematics, 1995

1994
On Completeness for NP via Projection Translations.
Mathematical Systems Theory, 1994

Monotonicity and the Expressibility of NP Operators.
Math. Log. Q., 1994

Logical Description of Monotone NP Problems.
J. Log. Comput., 1994

Deciding whether a planar graph has a cubic subgraph is NP-complete.
Discrete Mathematics, 1994

Context-Sensitive Transitive Closure Operators.
Ann. Pure Appl. Logic, 1994

1993
Methods for Proving Completeness via Logical Reductions.
Theor. Comput. Sci., 1993

On Two Approximation Algorithms for the Clique Problem.
Int. J. Found. Comput. Sci., 1993

A New Characterization of Unbreakable Graphs.
Int. J. Found. Comput. Sci., 1993

Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines.
Fundam. Inform., 1993

Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines.
Fundam. Inform., 1993

An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets.
BIT, 1993

Logical and Schematic Characterization of Complexity Classes.
Acta Inf., 1993

Incorporating Generalized Quantifiers and the Least Fixed Point Operator.
Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992
Using the Hamiltonian Path Operator to Capture NP.
J. Comput. Syst. Sci., 1992

Refining known Results on the generalized Word Problem for Free Groups.
IJAC, 1992

Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines.
Proceedings of the Logical Foundations of Computer Science, 1992

Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991
Complete Problems Involving Boolean Labelled Structures and Projection Transactions.
J. Log. Comput., 1991

Comparing the Expressibility of Languages Formed using NP-Complete Operators.
J. Log. Comput., 1991

Complete Problems for Symmetric Logspace Involving Free Groups.
Inf. Process. Lett., 1991

Obtaining Nielsen Reduced Sets in Free Groups.
Bulletin of the EATCS, 1991

Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs.
Proceedings of the 17th International Workshop, 1991

Complete Problems Involving Boolean Labelled Structures and Projections Translations.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

On Completeness for NP via Projection Translations.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990
On The Graph Accessibility Problem for Directed Graphs of Bounded Degree.
Bulletin of the EATCS, 1990

Comparing the expressibility of two languages formed using NP-complete graph operators.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

Using the Hamiltonian Path Operator to Capture NP.
Proceedings of the Advances in Computing and Information, 1990

1989
An Algorithm for Colouring Perfect Planar Graphs.
Inf. Process. Lett., 1989

1988
Colouring Perfect Planar Graphs in Parallel.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

1987
An Algorithm for Colouring Perfect Planar Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987


  Loading...