Iain Stewart

Publications

  • Submitted for publication
    1. A. Erickson, J. Navaridas and I.A. Stewart, Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge-isoperimetric problems in graphs.
    2. A. Erickson and I.A. Stewart, The influence of data center usage on symmetry in data center network design.
    3. A. Erickson, J. Navaridas, J.A. Pascual and I.A. Stewart, Routing algorithms for recursively-defined datacenter networks.
      • Full version of 93.
  • Published
    1. I.A. Stewart, On the combinatorial design of data centre network topologies, Journal of Computer and System Sciences, 89 (2017) 328-348.
      DOI: 10.1016/j.jcss.2017.05.015     gold open access
      • Extended abstract: On the mathematics of data centre network topologies, in: Proceedings of 20th International Symposium on Fundamentals of Computation Theory, FCT'15 (A. Kosowski, I. Walukiewicz, eds.), Gdansk, Poland, August 17-19 2015, Lecture Notes in Computer Science Volume 9210, Springer, 2015, 283-295.
        DOI: 10.1007/978-3-319-22177-9_22
    2. A. Erickson, I.A. Stewart, J.A.Pascual and J. Navaridas, Improved routing algorithms in the dual-port datacenter networks HCN and BCN, Future Generation Computer Systems, 75 (2017) 58-71.
      DOI: 10.1016/j.future.2017.05.004     gold open access
      • Extended abstract: I.A. Stewart, Improved routing in the data centre networks HCN and BCN, in: Proceedings of 2nd International Symposium on Computing and Networking - Across Practical Development and Theoretical Research, CANDAR'14, Mt. Fuji, Shizuoka, Japan, December 10-12 2014, IEEE Computer Society Press, 2014, 212-218.
        DOI: 10.1109/CANDAR.2014.16
    3. A. Erickson, A. Kiasari, J. Navaridas and I.A. Stewart, An optimal single-path routing algorithm in the datacenter network DPillar, IEEE Transactions on Parallel and Distributed Systems, 28(3) (2017) 689-703.
      DOI: 10.1109/TPDS.2016.2591011
      • Extended abstract: A. Erickson, A. Kiasari, J. Navaridas and I.A. Stewart, An efficient shortest path routing algorithm in the data centre network DPillar, in: Proceedings of 9th Annual International Conference on Combinatorial Optimization and Applications, COCOA'15 (Z. Lu, D. Kim, W. Wu, W. Li, D.-Z. Du, eds.), Houston, USA, December 18-20 2015, Lecture Notes in Computer Science Volume 9486, Springer, 2015, 209-220.
        DOI: 10.1007/978-3-319-26626-8_16
    4. A. Erickson, I.A. Stewart, J. Navaridas and A.E. Kiasari, The stellar transformation: from interconnection networks to datacenter networks, Computer Networks, 113 (2017) 29-45.
      DOI: 10.1016/j.comnet.2016.12.001     gold open access
    5. P. Golovach, D. Paulusma and I.A. Stewart, Graph editing to a fixed target, Discrete Applied Mathematics, 216 (1) (2017) 181-190.
      DOI: 10.1016/j.dam.2014.07.008
      • Extended abstract: P. Golovach, D. Paulusma and I.A. Stewart, Graph editing to a fixed target, in: Proceedings of International Workshop on Combinatorial Algorithms, IWOCA'13 (T. Lecroq, L. Mouchard, eds.), Rouen, France, July 10-12 2013, Lecture Notes in Computer Science Volume 8288, Springer, 2013, 192-205.
        DOI: 10.1007/978-3-642-45278-9_17
    6. I.A. Stewart, Sufficient conditions for Hamiltonicity in multiswapped networks, Journal of Parallel and Distributed Computing, 101 (2017) 17-26.
      DOI: 10.1016/j.jpdc.2016.10.015     gold open access
    7. C.-N. Kuo and I.A. Stewart, Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes, Theoretical Computer Science, 627 (2016) 102-106.
      DOI: 10.1016/j.tcs.2016.02.029
    8. A. Erickson, A. Kiasari, J. Navaridas and I.A. Stewart, Routing algorithms for recursively-defined data centre networks, in: Proceedings of 13th IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA'15, Helsinki, Finland, August 20-22 2015, IEEE Computer Society Press, 2015, 84-91.
      DOI: 10.1109/Trustcom.2015.616
    9. A. Kiasari, J. Navaridas and I.A. Stewart, Routing packets on DPillar data centre networks, in: Proceedings of 15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP'15, Zhangjiajie, China, November 18-20 2015, Lecture Notes in Computer Science Volume 9531, Springer, 2015, 329-343.
      DOI: 10.1007/978-3-319-27140-8_23
    10. L. Dawson and I.A. Stewart, Accelerating Ant Colony Optimization-based edge detection on the GPU using CUDA, in: Proceedings of IEEE Congress on Evolutionary Computation, IEEE-CEC'14, Beijing, China, July 6-11 2014, IEEE Computer Society Press, 2014, 1736-1743.
      DOI: 10.1109/CEC.2014.6900638
    11. I.A. Stewart, Interconnection networks of degree three obtained by pruning two-dimensional tori, IEEE Transactions on Computers, 63 (10) (2014) 2473-2486.
      DOI: 10.1109/TC.2013.139
    12. L. Dawson and I.A. Stewart, Candidate set parallelization strategies for Ant Colony Optimization on the GPU, in: Proceedings of 13th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP'13 (J. Kołodziej, B. Di Martino, D. Talia, K. Xiong, eds.), Sorrento, Italy, December 18-21 2013, Lecture Notes in Computer Science Volume 8285, Springer, 2013, 216-225.
      DOI: 10.1007/978-3-319-03859-9_18
    13. L. Dawson and I.A. Stewart, Improving Ant Colony Optimization performance on the GPU using CUDA, in: Proceedings of IEEE Congress on Evolutionary Computation, IEEE-CEC'13, Cancun, Mexico, June 20-23 2013, IEEE Computer Society Press, 2013, 1901-1908.
      DOI: 10.1109/CEC.2013.6557791
    14. J. Gate and I.A. Stewart, The expressibility of fragments of Hybrid Graph Logic on finite digraphs, Journal of Applied Logic 11 (3) (2013) 272-288.
      DOI: 10.1016/j.jal.2013.05.002
    15. I.A. Stewart, Multiswapped networks and their topological and algorithmic properties, Journal of Computer and System Sciences 79 (8) (2013) 1269-1286.
      DOI: 10.1016/j.jcss.2013.06.002
    16. I.A. Stewart, A general technique to establish the asymptotic conditional diagnosability of interconnection networks, Theoretical Computer Science 452 (2012) 132-147.
      DOI: 10.1016/j.tcs.2012.05.015
    17. I.A. Stewart, On the computational complexity of routing in faulty k-ary n-cubes and hypercubes, Parallel Processing Letters, 22 (1) (2012) 1250003 (13 Pages).
      DOI: 10.1142/S012962641250003X
    18. J. Zhao, Y. Xiang, L. Dawson and I.A. Stewart, Color image edge detection based on quantity of color information and its implementation on the GPU, in: Proceedings of 23rd IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS'11 (T.F. Gonzalez, ed.), Dallas, USA, December 14-16 2011, Acta Press, 2011, 116-123.
      DOI: 10.2316/P.2011.757-077
    19. Y. Xiang, I.A. Stewart and F.R. Madelaine, Node-to-node disjoint paths in k-ary n-cubes with faulty edges, in: Proceedings of 17th International Conference on Parallel and Distributed Systems, ICPADS'11, Tainan, Taiwan, December 7-9 2011, IEEE Computer Society Press, 2011, 181-187.
      DOI: 10.1109/ICPADS.2011.85
    20. Y. Xiang and I.A. Stewart, Bipancyclicity in k-ary n-cubes with faulty edges under a conditional fault assumption, IEEE Transactions on Parallel and Distributed Systems 22 (9) (2011) 1506-1513.
      DOI: 10.1109/TPDS.2011.22
    21. Y. Xiang and I.A. Stewart, A multipath analysis of biswapped networks, The Computer Journal 54 (6) (2011) 920-930.
      DOI: 10.1093/comjnl/BXQ083
    22. I.A. Stewart, Hamiltonian cycles through prescribed edges in k-ary n-cubes, in: Proceedings of 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA'11 (W. Wang, X. Zhu, D.-Z. Du, eds.), Zhangjiajie, China, August 4-6 2011, Lecture Notes in Computer Science Volume 6831, Springer, 2011, 82-97.
      DOI: 10.1007/978-3-642-22616-8_8
    23. Y. Xiang and I.A. Stewart, Augmented k-ary n-cubes, Information Sciences 181 (1) (2011) 239-256.
      DOI: 10.1016/j.ins.2010.09.005
    24. J. Gate and I.A. Stewart, Frameworks for logically classifying polynomial-time optimisation problems, in: Proceedings of 5th International Computer Science Symposium in Russia, CSR'10 (F. Ablayev, E.W. Mayr, eds.), Kazan, Russia, June 16-20 2010, Lecture Notes in Computer Science Volume 6072, Springer, 2010, 120-131.
      DOI: 10.1007/978-3-642-13182-0_12
    25. I.A. Stewart, A general algorithm for detecting faults under the comparison diagnosis model, in: Proceedings of 24th IEEE International Parallel and Distributed Processing Symposium, IPDPS'10, Atlanta, USA, April 19-23 2010, IEEE Computer Society Press, 2010, 1-9.
      DOI: 10.1109/IPDPS.2010.5470369
    26. P.-L. Lai, H.-C. Hsu, C.-H. Tsai and I.A. Stewart, A class of hierarchical graphs as topologies for interconnection networks, Theoretical Computer Science 41 (31-33) (2010) 2912-2924.
      DOI: 10.1016/j.tcs.2010.04.022
    27. Y. Xiang and I.A. Stewart, One-to-many node-disjoint paths in (n,k)-star graphs, Discrete Applied Mathematics 158 (1) (2010) 62-70.
      DOI: 10.1016/j.dam.2009.08.013
    28. Y. Xiang and I.A. Stewart, Pancyclicity and panconnectivity in augmented k-ary n-cubes, in: Proceedings of 15th International Conference on Parallel and Distributed Systems, ICPADS'09, Shenzhen, China, December 8-11 2009, IEEE Computer Society Press, 2009, 308-315.
      DOI: 10.1109/ICPADS.2009.45
    29. Y. Xiang and I.A. Stewart, Pancyclicity in faulty k-ary 2-cubes, in: Proceedings of 21st IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS'09 (T.F. Gonzalez, ed.), Cambridge, USA, November 2-4 2009, Acta Press, 2009, 77-84.
      Acta Press web-site: ISBN 978-0-88986-838-0
    30. A. Arratia-Quesada and I.A. Stewart, On the power of deep pushdown stacks, Acta Informatica 46 (7) (2009) 509-531.
      • Extended abstract: A. Arratia-Quesada and I.A. Stewart, On the power of deep pushdown stacks, in: Proceedings of Computation and Logic in the Real World, Fourth Conference on Computability in Europe, CiE'2008 (A. Beckmann, C. Dimitracopoulos, B. Löwe, eds.), Athens, Greece, June 15-20 2008, Lecture Notes in Computer Science Volume 5028, Springer, 2008, 11-21.
        DOI: 10.1007/s00236-009-0103-x
    31. I.A. Stewart, Program schemes, queues, the recursive spectrum and zero-one laws, Fundamenta Informaticae 91 (2) (2009) 411-435.
      • Extended abstract: I.A. Stewart, Program schemes, queues, the recursive spectrum and zero-one laws, in: Proceedings of 7th Annual International Computing and Combinatorics Conference, COCOON'2001 (J. Wang, ed.), Guilin, China, August 20-23 2001, Lecture Notes in Computer Science Volume 2108, Springer-Verlag, 2001, 39-48.
        DOI: 10.3233/FI-2009-0050
    32. I.A. Stewart, Logical and complexity-theoretic aspects of models of computation with restricted access to arrays, Journal of Logic and Computation 19 (1) (2009) 217-242.
      • Extended abstract in: I.A. Stewart, Logical and complexity-theoretic aspects of models of computation with restricted access to arrays, in: Proceedings of Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE'2007 (S.B. Cooper, T.F. Kent, B. Löwe, A. Sorbi, eds.), Siena, Italy, June 18-23 2007, 324-331).
        DOI: 10.1093/logcom/exn025
    33. I.A. Stewart and Y. Xiang, Bipanconnectivity and bipancyclicity in k-ary n-cubes, IEEE Transactions on Parallel and Distributed Systems 20 (1) (2009) 25-33.
      DOI: 10.1109/TPDS.2008.45
    34. I.A. Stewart and Y. Xiang, Embedding long paths in k-ary n-cubes with faulty nodes and links, IEEE Transactions on Parallel and Distributed Systems 19 (8) (2008) 1071-1085
      DOI: 10.1109/TPDS.2007.70787
    35. F.R. Madelaine and I.A. Stewart, Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies, Discrete Mathematics 308 (18) (2008) 4144-4164
      DOI: 10.1016/j.disc.2007.08.007
    36. H. Broersma, M. Johnson, D. Paulusma and I.A. Stewart, The computational complexity of the parallel knock-out problem, Theoretical Computer Science 393 (1-3) (2008) 182-195.
      • Extended abstract: H. Broersma, M. Johnson, D. Paulusma and I.A. Stewart, The computational complexity of the parallel knock-out problem, in: Proceedings of 7th Latin American Symposium on Theoretical Informatics, LATIN'2006 (J.R. Correa, A. Hevia, M. Kiwi, eds.), Valdivia, Chile, March 20-24 2006, Lecture Notes in Computer Science Volume 3887, Springer, 2006, 250-261).
        DOI: 10.1016/j.tcs.2007.11.021
    37. I.A. Stewart, On the fixed-parameter tractability of parameterized model-checking problems, Information Processing Letters 106 (1) (2008) 33-36.
      DOI: 10.1016/j.ipl.2007.09.009
    38. I.A. Stewart, Distributed algorithms for building Hamiltonian cycles in k-ary n-cubes and hypercubes with faulty links, Journal of Interconnection Networks 8 (3) (2007) 253-284.
      • Extended abstract: I.A. Stewart, Distributed algorithms for building Hamiltonian cycles in k-ary n-cubes and hypercubes with faulty links, in: Proceedings of 12th International Conference on Parallel and Distributed Systems, ICPADS'06, Minneapolis, USA, 12-15 July 2006, IEEE Computer Society Press, 2006, 308-318).
        DOI: 10.1142/S0219265907002016
    39. F.R. Madelaine and I.A. Stewart, Constraint satisfaction, logic and forbidden patterns, SIAM Journal of Computing 37 (1) (2007) 132-163.
      DOI: 10.1137/050634840
    40. R.L. Gault and I.A. Stewart, An infinite hierarchy in a class of polynomial-time program schemes, Theory of Computing Systems 39 (5) (2006) 753-783.
      DOI: 10.1007/s00224-005-1230-6
    41. T. Feder, F.R. Madelaine and I.A. Stewart, Dichotomies for classes of homomorphism problems involving unary functions, Theoretical Computer Science 314 (1-2) (2004) 1-43.
      DOI: 10.1016/j.tcs.2003.12.015
    42. F.R. Madelaine and I.A. Stewart, Some problems not definable using structure homomorphisms, Ars Combinatoria 67 (2003) 153-159.
    43. I.A. Stewart, The complexity of achievement and maintenance problems in agent-based systems, Artificial Intelligence 146 (2) (2003) 175-191.
      DOI: 10.1016/S0004-3702(03)00014-6
    44. I.A. Stewart, Using program schemes to logically capture polynomial-time on certain classes of structures, London Mathematical Society Journal of Computation and Mathematics 6 (2003) 40-67.
      DOI: 10.1112/S1461157000000371
    45. A. Puricella and I.A. Stewart, Greedy algorithms, H-colourings and a complexity-theoretic dichotomy, Theoretical Computer Science 290 (3) (2003) 1897-1913.
      DOI: 10.1016/S0304-3975(02)00329-8
    46. A.A. Arratia and I.A. Stewart, A note on first-order projections and games, Theoretical Computer Science 290 (3) (2003) 2085-2093.
      DOI: 10.1016/S0304-3975(02)00491-7
    47. Y.A. Ashir and I.A. Stewart, Fault-tolerant embeddings of Hamiltonian circuits in k-ary n-cubes, SIAM Journal of Discrete Mathematics 15 (3) (2002) 317-328.
      DOI: 10.1137/S0895480196311183
    48. I.A. Stewart, Program schemes, arrays, Lindström quantifiers and zero-one laws, Theoretical Computer Science 275 (1-2) (2002) 283-310,
      • Extended abstract: I.A. Stewart, Program schemes, arrays, Lindström quantifiers and zero-one laws, in: Proceedings of 8th Annual Conference of the European Association for Computer Science Logic, CSL'1999 (J. Flum, M. Rodriguez-Artalejo, eds.), Madrid, Spain, September 20-25 1999, Lecture Notes in Computer Science Volume 1683, Springer, 1999, 374-388).
        DOI: 10.1016/S0304-3975(01)00183-9
    49. R.L. Gault and I.A. Stewart, On a hierarchy involving transitive closure logic and existential second-order quantification, Logic Journal of the IGPL 9 (6) (2001) 769-780.
      DOI: 10.1093/jigpal/9.6.769
    50. A. Puricella and I.A. Stewart, A generic greedy algorithm, partially-ordered graphs and NP-completeness, in: Proceedings of 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'01 (A. Brandstaedt, V.B. Le, eds.), Boltenhagen, Germany, June 14-16 2001, Lecture Notes in Computer Science Volume 2204, Springer, 2001, 306-316.
      DOI: 10.1007/3-540-45477-2_28
    51. I.A. Stewart, A perspective on Lindström quantifiers and oracles, in: Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language and Information Workshop (J. Väänänen, ed.), Aix-en-Provence, France, August 11-22 1997, Lecture Notes in Computer Science Volume 1754, Springer, 2000, 51-71.
      DOI: 10.1007/3-540-46583-9_3
    52. S.R. Chauhan and I.A. Stewart, On the power of built-in relations in certain classes of program schemes, Information Processing Letters 69 (2) (1999) 77-82.
      DOI: 10.1016/S0020-0190(98)00196-3
    53. A.A. Arratia-Quesada, S.R. Chauhan and I.A. Stewart, Hierarchies in classes of program schemes, Journal of Logic and Computation 9 (6) (1999) 915-957.
      DOI: 10.1093/logcom/9.6.915
    54. I.A. Stewart and R.M. Thomas, Formal languages and the word problem in groups, in: Groups St. Andrews 1997 in Bath, II (C.M. Campbell, E.F. Robertson, N. Ruskuc, G. Smith, eds.), London Mathematical Society Lecture Notes Series Volume 261, Cambridge University Press, 1999, 689-700.
      DOI: 10.2277/0521655765
    55. C. Lautemann, T. Schwentick and I.A. Stewart, Positive versions of polynomial time, Information and Computation 147 (2) (1998) 145-170.
      • Extended abstract: C. Lautemann, T. Schwentick and I.A. Stewart, Positive versions of polynomial time, On positive P, in: Proceedings of 11th Annual IEEE Conference on Computational Complexity, CCC'96, Philadelphia, USA, May 24-27 1996, IEEE Computer Society Press, 1996, 162-170).
        DOI: 10.1006/inco.1998.2742
    56. I.A. Stewart, On locating cubic subgraphs in bounded-degree connected bipartite graphs, Discrete Mathematics 163 (1997) 319-324.
      DOI: 10.1016/0012-365X(95)00324-P
    57. A.A. Arratia-Quesada and I.A. Stewart, Generalized Hex and logical characterizations of polynomial space, Information Processing Letters 63 (1997) 147-152.
      DOI: 10.1016/S0020-0190(97)00116-6
    58. Y.A. Ashir, I.A. Stewart and A. Ahmed, Communication algorithms in k-ary n-cube interconnection networks, Information Processing Letters 61 (1997) 43-48.
      DOI: 10.1016/S0020-0190(96)00188-3
    59. I.A. Stewart, Logics with zero-one laws that are not fragments of bounded-variable infinitary logic, Mathematical Logic Quarterly 43 (1997) 158-178.
      DOI: 10.1002/malq.19970430203
    60. I.A. Stewart, Regular subgraphs in graphs and rooted graphs, and definability in monadic second-order logic, Mathematical Logic Quarterly 43 (1997) 1-21.
      DOI: 10.1002/malq.19970430102
    61. Y.A. Ashir and I.A. Stewart, On embedding cycles in k-ary n-cubes, Parallel Processing Letters 7 (1997) 49-55.
      DOI: 10.1142/S0129626497000073
    62. Y.A. Ashir and I.A. Stewart, Embeddings of cycles, meshes and tori in faulty k-ary n-cubes, in: Proceedings of International Conference on Parallel and Distributed Systems, ICPADS'97, Seoul, Korea, 11-13 December 1997, IEEE Computer Society Press, 1997, 429-435.
      DOI: 10.1109/ICPADS.1997.652583
    63. I.A. Stewart, Finding regular subgraphs in both arbitrary and planar graphs, Discrete Applied Mathematics 68 (1996) 223-235.
      DOI: 10.1016/0166-218X(95)00061-U
    64. I.A. Stewart, The role of monotonicity in finite model theory, in: Collegium Logicum - Annals of the Kurt Gödel Society Volume 2, Springer, 1996, 101-117.
      DOI: 10.1007/978-3-7091-9461-4_7
    65. I.A. Stewart, The demise of the Turing machine in complexity theory, in: Machines and Thought: The Legacy of Alan Turing (P. Millican, A. Clark, eds.) Oxford University Press, 1996, 221-232. (Oxford University Press Web-site: ISBN 978-0-19-823876-8)
    66. I.A. Stewart and B.C. Thompson, On the intersections of longest cycles in a graph, Experimental Mathematics 4 (1995) 41-48.
      Open access from Experimental Mathematics web-site: postscript 698Kb
    67. I.A. Stewart, Reachability in some classes of acyclic Petri nets, Fundamenta Informaticae 23 (1995) 91-100.
      DOI: 10.3233/FI-1995-2314
    68. I.A. Stewart, Completeness for path-problems via logical reductions, Information and Computation 121 (1995) 123-134.
      DOI: 10.1006/inco.1995.1127
    69. I.A. Stewart, Complete problems for monotone NP, Theoretical Computer Science 145 (1995) 147-157.
      DOI: 10.1016/0304-3975(94)00175-I
    70. I.A. Stewart, Two problems analogous to connectivity and reachability, University of Wales Swansea Technical Report CSR 2-95 (1995).
    71. I.A. Stewart, Context-sensitive transitive closure operators, Annals of Pure and Applied Logic 66 (1994) 277-301.
      DOI: 10.1016/0168-0072(94)90036-1
    72. I.A. Stewart, Deciding whether a planar graph has a cubic subgraph is NP-complete, Discrete Mathematics 126 (1994) 349-357.
      DOI: 10.1016/0012-365X(94)90277-1
    73. I.A. Stewart, Logical descriptions of monotone NP problems, Journal of Logic and Computation 4 (1994) 337-357.
      DOI: 10.1093/logcom/4.4.337
    74. I.A. Stewart, Monotonicity and the expressibility of NP operators, Mathematical Logic Quarterly 40 (1994) 132-140.
      DOI: 10.1002/malq.19940400118
    75. I.A. Stewart, On completeness for NP via projection translations, Mathematical Systems Theory 27 (1994) 125-157
      DOI: 10.1007/BF01195200
      • Extended abstract: I.A. Stewart, On completeness for NP via projection translations, in: Proceedings of Computer Science Logic, CSL'91 (E. Börger, G. Jäger, H. Kleine Büning, M.M. Richter, eds.), Berne, Switzerland, October 7-11 1991, Lecture Notes in Computer Science Volume 626, Springer, 1992, 353-366).
    76. I.A. Stewart, Incorporating generalized quantifiers and the least fixed point operator, in: Proceedings of Computer Science Logic, CSL'93 (E. Börger, Y. Gurevich, K. Meinke, eds.), Swansea, September 13-17 1993, Lecture Notes in Computer Science Volume 832, Springer, 1994, 318-333.
      DOI: 10.1007/BFb0049340
    77. I.A. Stewart, Logical and schematic characterization of complexity classes, Acta Informatica 30 (1993) 61-87.
      DOI: 10.1007/BF01200263
    78. I.A. Stewart, On parallelizing a greedy heuristic for finding small dominating sets, BIT 33 (1993) 57-62.
      DOI: 10.1007/BF01990343
    79. I.A. Stewart, Logical characterizations of bounded query classes II: polynomial-time oracle machines, Fundamenta Informaticae 18 (1993) 93-105.
      • Extended abstract: I.A. Stewart, Logical characterizations of bounded query classes II: polynomial-time oracle machines, in: Proceedings of Computer Science Logic, CSL'92 (E. Börger, G. Jäger, H. Kleine Büning, S. Martini, M. M. Richter, eds.), San Miniato, Italy, September 28-October 2 1992, Lecture Notes in Computer Science Volume 702, Springer, 1993, 410-424.
    80. I.A. Stewart, Logical characterizations of bounded query classes I: logspace oracle machines, Fundamenta Informaticae 18 (1993) 65-92.
      • Extended abstract: I.A. Stewart, Logical characterizations of bounded query classes I: logspace oracle machines, in: Proceedings of Logic at Tver (Logical Foundations of Computer Science Symposium) (A. Nerode, M. Taitslin, eds.), Tver, Russia, July 20-24 1992, Lecture Notes in Computer Science Volume 620, Springer, 1992, 470-479.
    81. I.A. Stewart, On two approximation algorithms for the clique problem, International Journal of Foundations of Computer Science 4 (1993) 117-133.
      DOI: 10.1142/S0129054193000080
    82. S. Olariu and I.A. Stewart, A new characterization of unbreakable graphs, International Journal of Foundations of Computer Science 4 (1993) 193-196.
      DOI: 10.1142/S0129054193000134
    83. I.A. Stewart, Methods for proving completeness via logical translations, Theoretical Computer Science 118 (1993) 193-229.
      DOI: 10.1016/0304-3975(93)90109-7
    84. I.A. Stewart, Algorithms for graphs, in: Concise Encyclopaedia of Software Engineering (D. Morris, B. Tamm, eds.), Pergamon Press, Oxford, 1993, 5-9. (Elsevier web-site: ISBN 978-0-08-036214-4
    85. I.A. Stewart, Complete problems for symmetric logspace involving free groups, Information Processing Letters 40 (1991) 263-267.
      DOI: 10.1016/0020-0190(91)90121-W
    86. I.A. Stewart, Refining known results on the generalized word problem for free groups, International Journal of Algebra and Computation 2 (1992) 221-236.
      DOI: 10.1142/S0218196792000141
    87. I.A. Stewart, Using the Hamiltonian path operator to capture NP, Journal of Computer and System Sciences 45 (1992) 127-151
      DOI: 10.1016/0022-0000(92)90043-I)
      • Extended abstract: I.A. Stewart, Using the Hamiltonian path operator to capture NP, in: Proceedings of 2nd International Conference on Computing and Information, ICCI'90 (S. Akl, F. Fiala, W. Koczkodaj, eds.), Niagara Falls, Canada, May 23-26 1990, Lecture Notes in Computer Science Volume 468, Springer, 1990, 134-143.
    88. I.A. Stewart, Comparing the expressibility of languages formed using NP-complete operators, Journal of Logic and Computation 1 (1991) 305-330
      DOI: 10.1093/logcom/1.3.305
      • Extended abstract: I.A. Stewart, Comparing the expressibility of languages formed using NP-complete operators, in: Proceedings of 16th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'90 (R. Möhring, ed.), Berlin, Germany, June 20-22 1990, Lecture Notes in Computer Science Volume 484, Springer, 1991, 276-290.
    89. I.A. Stewart, Complete problems involving Boolean labelled structures and projection translations, Journal of Logic and Computation 1 (1991) 861-882
      DOI: 10.1093/logcom/1.6.861
      • Extended abstract: I.A. Stewart, Complete problems involving Boolean labelled structures and projection translations, in: Proceedings of 11th Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS 1991 (K.V. Nori, ed.), New Delhi, India, December 17-19 1991, Lecture Notes in Computer Science Volume 560, Springer, 1991, 242-260.
    90. I.A. Stewart, Complete problems for logspace involving lexicographic first paths in graphs, in: Proceedings of 17th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'91 (G. Schmidt, R. Berghammer, eds.), Fischbachau, Germany, June 17-19 1991, Lecture Notes in Computer Science Volume 570, Springer, 1991, 198-208.
      DOI: 10.1007/3-540-55121-2_19
    91. I.A. Stewart, On the expressibility of extensions of first-order logic, University of Newcastle upon Tyne Technical Report 342 (1991).
      University of Newcastle upon Tyne web-site: pdf 15.2Mb
    92. I.A. Stewart, Uniform sequences of branching programs, University of Newcastle upon Tyne Technical Report 334 (1991).
      University of Newcastle upon Tyne web-site: pdf 18.4Mb
    93. I.A. Stewart, Obtaining Nielsen reduced sets in free groups, in: Bulletin of the European Association for Theoretical Computer Science 43 (1990) 184-188.
      University of Newcastle upon Tyne web-site: pdf 7.4Mb
    94. I.A. Stewart, On the graph accessibility problem for directed graphs of bounded degree, in: Bulletin of the European Association for Theoretical Computer Science 42 (1990) 190-193.
    95. I.A. Stewart, An algorithm for colouring perfect planar graphs, Information Processing Letters 31 (1989) 97-101
      DOI: 10.1016/0020-0190(89)90075-6
      • Extended abstract: I.A. Stewart, An algorithm for colouring perfect planar graphs, in: Proceedings of 7th Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS'87 (K.V. Nori, ed.), Pune, Indai, December 17-19 1987, Lecture Notes in Computer Science Volume 287, Springer, 1987, 58-64.
    96. I.A. Stewart, Colouring perfect planar graphs in parallel, in: Proceedings of 14th Int. Workshop on Graph-Theoretic Concepts in Computer Science, WG'88 (J. van Leeuwen, ed.), Amsterdam, The Netherlands, June 15-17 1988, Lecture Notes in Computer Science Volume 344, Springer, 1988, 268-275.
      DOI: 10.1007/3-540-50728-0_50
    97. I.A. Stewart, Expressibility, complexity, and comparative schematology, University of Newcastle upon Tyne Technical Report 273 (1988).
      University of Newcastle upon Tyne web-site: pdf 17.4Mb
    98. I.A. Stewart, Hypercentrality and hypercyclicity in skew linear groups, Archiv der Mathematik 49 (1987) 277-280.
      DOI: 10.1007/BF01210709
    99. I.A. Stewart, The paraheight of certain skew linear groups, Archiv der Mathematik 48 (1987) 208-212.
      DOI: 10.1007/BF01195353
    100. I.A. Stewart, Supersolubility in certain skew linear groups, Journal of the London Mathematical Society 35 (1987) 91-97.
      DOI: 10.1112/jlms/s2-35.1.91

(updated 2nd April 2017)