Iain A. Stewart
Orcid: 0000000207521971Affiliations:
 Durham University, School of Engineering and Computing Sciences
According to our database^{1},
Iain A. Stewart
authored at least 106 papers
between 1988 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
2023
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023
2020
Relating the bisection width of dualport, servercentric datacenter networks and the solution of edge isoperimetric problems in graphs.
J. Comput. Syst. Sci., 2020
Inf. Process. Lett., 2020
Discret. Appl. Math., 2020
2019
J. Parallel Distributed Comput., 2019
2018
J. Supercomput., 2018
2017
IEEE Trans. Parallel Distributed Syst., 2017
J. Parallel Distributed Comput., 2017
J. Comput. Syst. Sci., 2017
Future Gener. Comput. Syst., 2017
Discret. Appl. Math., 2017
Comput. Networks, 2017
2016
Theor. Comput. Sci., 2016
2015
StarReplaced Networks: A Generalised Class of DualPort ServerCentric Data Centre Networks.
CoRR, 2015
An efficient shortestpath routing algorithm in the data centre network {DP}illar.
CoRR, 2015
Proceedings of the 2015 IEEE TrustCom/BigDataSE/ISPA, 2015
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015
Proceedings of the Fundamentals of Computation Theory  20th International Symposium, 2015
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
Interconnection Networks of Degree Three Obtained by Pruning TwoDimensional Tori.
IEEE Trans. Computers, 2014
Proceedings of the Second International Symposium on Computing and Networking, 2014
Proceedings of the IEEE Congress on Evolutionary Computation, 2014
2013
J. Comput. Syst. Sci., 2013
J. Appl. Log., 2013
Proceedings of the Algorithms and Architectures for Parallel Processing, 2013
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 kary nCubes and Hypercubes.
Parallel Process. Lett., 2012
J. Discrete Algorithms, 2012
2011
Bipancyclicity in kAry nCubes with Faulty Edges under a Conditional Fault Assumption.
IEEE Trans. Parallel Distributed Syst., 2011
Inf. Sci., 2011
Comput. J., 2011
Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011
Proceedings of the Combinatorial Optimization and Applications, 2011
2010
Theor. Comput. Sci., 2010
Discret. Appl. Math., 2010
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010
Proceedings of the Computer Science, 2010
2009
IEEE Trans. Parallel Distributed Syst., 2009
Logical and Complexitytheoretic Aspects of Models of Computation with Restricted Access to Arrays.
J. Log. Comput., 2009
Fundam. Informaticae, 2009
Acta Informatica, 2009
Proceedings of the 15th IEEE International Conference on Parallel and Distributed Systems, 2009
2008
IEEE Trans. Parallel Distributed Syst., 2008
Theor. Comput. Sci., 2008
Inf. Process. Lett., 2008
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies.
Discret. Math., 2008
Proceedings of the Logic and Theory of Algorithms, 2008
2007
SIAM J. Comput., 2007
Distributed Algorithms for Building Hamiltonian Cycles in kAry nCubes and Hypercubes with Faulty Links.
J. Interconnect. Networks, 2007
2006
Theory Comput. Syst., 2006
2004
Theor. Comput. Sci., 2004
2003
Theor. Comput. Sci., 2003
Theor. Comput. Sci., 2003
Using Program Schemes to Capture PolynomialTime Logically on Certain Classes of Structures.
LMS J. Comput. Math., 2003
Some problems not definable using structure homomorphisms.
Ars Comb., 2003
Artif. Intell., 2003
2002
Theor. Comput. Sci., 2002
SIAM J. Discret. Math., 2002
2001
On a hierarchy involving transitive closure logic and existential secondorder quantification.
Log. J. IGPL, 2001
Program schemes with binary writeonce arrays and the complexity classes they capture
CoRR, 2001
Proceedings of the GraphTheoretic Concepts in Computer Science, 2001
1999
J. Log. Comput., 1999
Inf. Process. Lett., 1999
1998
Inf. Comput., 1998
1997
Parallel Process. Lett., 1997
Logics with ZeroOne Laws that Are Not Fragments of BoundedVariable Infinitary Logic.
Math. Log. Q., 1997
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic SecondOrder Logic.
Math. Log. Q., 1997
Inf. Process. Lett., 1997
Inf. Process. Lett., 1997
Discret. Math., 1997
Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997
Proceedings of the Generalized Quantifiers and Computation, 1997
1996
Discret. Appl. Math., 1996
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996
1995
Inf. Comput., August, 1995
Theor. Comput. Sci., 1995
Fundam. Informaticae, 1995
Exp. Math., 1995
1994
Math. Syst. Theory, 1994
Math. Log. Q., 1994
J. Log. Comput., 1994
Discret. Math., 1994
Ann. Pure Appl. Log., 1994
1993
Theor. Comput. Sci., 1993
Int. J. Found. Comput. Sci., 1993
Int. J. Found. Comput. Sci., 1993
Logical Characterizations of Bounded Query Classes II: PolynomialTime Oracle Machines.
Fundam. Informaticae, 1993
Fundam. Informaticae, 1993
BIT, 1993
Acta Informatica, 1993
Proceedings of the Computer Science Logic, 7th Workshop, 1993
1992
J. Comput. Syst. Sci., 1992
Int. J. Algebra Comput., 1992
Logical Characterization of Bounded Query Classes II: PolynomialTime 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
J. Log. Comput., 1991
Inf. Process. Lett., 1991
Obtaining Nielsen Reduced Sets in Free Groups.
Bull. EATCS, 1991
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
1990
On The Graph Accessibility Problem for Directed Graphs of Bounded Degree.
Bull. EATCS, 1990
Comparing the expressibility of two languages formed using NPcomplete graph operators.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1990
1989
Inf. Process. Lett., 1989
1988
Proceedings of the GraphTheoretic Concepts in Computer Science, 1988