Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIain A. Stewart
Person information
- affiliation: Durham University, School of Engineering and Computing Sciences
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c34]Tom Friedetzky
, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan:
Payment Scheduling in the Interval Debt Model. SOFSEM 2023: 267-282- 2020
- [j76]Iain A. Stewart:
Using semidirect products of groups to build classes of interconnection networks. Discret. Appl. Math. 283: 78-97 (2020) - [j75]Iain A. Stewart:
Variational networks of cube-connected cycles are recursive cubes of rings. Inf. Process. Lett. 157: 105925 (2020) - [j74]Alejandro Erickson, Javier Navaridas, Iain A. Stewart:
Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs. J. Comput. Syst. Sci. 108: 10-28 (2020)
2010 – 2019
- 2019
- [j73]Javier Navaridas, Jose Antonio Pascual, Alejandro Erickson, Iain A. Stewart, Mikel Luján:
INRFlow: An interconnection networks research flow-level simulation framework. J. Parallel Distributed Comput. 130: 140-152 (2019) - 2018
- [j72]Iain A. Stewart, Alejandro Erickson:
The influence of datacenter usage on symmetry in datacenter network design. J. Supercomput. 74(6): 2276-2313 (2018) - 2017
- [j71]Alejandro Erickson, Iain A. Stewart, Javier Navaridas, Abbas Eslami Kiasari:
The stellar transformation: From interconnection networks to datacenter networks. Comput. Networks 113: 29-45 (2017) - [j70]Petr A. Golovach, Daniël Paulusma, Iain A. Stewart:
Graph editing to a fixed target. Discret. Appl. Math. 216: 181-190 (2017) - [j69]Alejandro Erickson, Iain A. Stewart, Jose Antonio Pascual, Javier Navaridas:
Improved routing algorithms in the dual-port datacenter networks HCN and BCN. Future Gener. Comput. Syst. 75: 58-71 (2017) - [j68]Iain A. Stewart:
On the combinatorial design of data centre network topologies. J. Comput. Syst. Sci. 89: 328-348 (2017) - [j67]Iain A. Stewart:
Sufficient conditions for Hamiltonicity in multiswapped networks. J. Parallel Distributed Comput. 101: 17-26 (2017) - [j66]Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart:
An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar. IEEE Trans. Parallel Distributed Syst. 28(3): 689-703 (2017) - 2016
- [j65]Che-Nan Kuo, Iain A. Stewart:
Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes. Theor. Comput. Sci. 627: 102-106 (2016) - [i5]Iain A. Stewart:
On the Mathematics of Data Centre Network Topologies. CoRR abs/1605.00863 (2016) - 2015
- [c33]Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart:
An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar. COCOA 2015: 209-220 - [c32]Iain A. Stewart:
On the Mathematics of Data Centre Network Topologies. FCT 2015: 283-295 - [c31]Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart:
On Routing Algorithms for the DPillar Data Centre Networks. ICA3PP (4) 2015: 329-343 - [c30]Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart:
Routing Algorithms for Recursively-Defined Data Centre Networks. TrustCom/BigDataSE/ISPA (3) 2015: 84-91 - [i4]Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart:
An efficient shortest-path routing algorithm in the data centre network {DP}illar. CoRR abs/1509.01746 (2015) - [i3]Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart:
Routing Algorithms for Recursively-Defined Data Centre Networks. CoRR abs/1509.01747 (2015) - [i2]Alejandro Erickson, Iain A. Stewart, Javier Navaridas, Abbas Eslami Kiasari:
Star-Replaced Networks: A Generalised Class of Dual-Port Server-Centric Data Centre Networks. CoRR abs/1510.02181 (2015) - 2014
- [j64]Iain A. Stewart:
Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori. IEEE Trans. Computers 63(10): 2473-2486 (2014) - [c29]Laurence Dawson, Iain A. Stewart:
Accelerating ant colony optimization-based edge detection on the GPU using CUDA. IEEE Congress on Evolutionary Computation 2014: 1736-1743 - [c28]Iain A. Stewart:
Improved Routing in the Data Centre Networks HCN and BCN. CANDAR 2014: 212-218 - 2013
- [j63]James Gate, Iain A. Stewart:
The expressibility of fragments of Hybrid Graph Logic on finite digraphs. J. Appl. Log. 11(3): 272-288 (2013) - [j62]Iain A. Stewart:
Multiswapped networks and their topological and algorithmic properties. J. Comput. Syst. Sci. 79(8): 1269-1286 (2013) - [c27]Laurence Dawson, Iain A. Stewart:
Improving Ant Colony Optimization performance on the GPU using CUDA. IEEE Congress on Evolutionary Computation 2013: 1901-1908 - [c26]Laurence Dawson, Iain A. Stewart:
Candidate Set Parallelization Strategies for Ant Colony Optimization on the GPU. ICA3PP (1) 2013: 216-225 - [c25]Petr A. Golovach, Daniël Paulusma, Iain A. Stewart:
Graph Editing to a Fixed Target. IWOCA 2013: 192-205 - 2012
- [j61]Iain A. Stewart, Daniël Paulusma, Matthew Johnson:
Editorial. J. Discrete Algorithms 12: 1 (2012) - [j60]Iain A. Stewart:
On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes. Parallel Process. Lett. 22(1) (2012) - [j59]Iain A. Stewart:
A general technique to establish the asymptotic conditional diagnosability of interconnection networks. Theor. Comput. Sci. 452: 132-147 (2012) - 2011
- [j58]Yonghong Xiang, Iain A. Stewart:
A Multipath Analysis of Biswapped Networks. Comput. J. 54(6): 920-930 (2011) - [j57]Yonghong Xiang, Iain A. Stewart:
Augmented k-ary n-cubes. Inf. Sci. 181(1): 239-256 (2011) - [j56]Yonghong Xiang, Iain A. Stewart:
Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption. IEEE Trans. Parallel Distributed Syst. 22(9): 1506-1513 (2011) - [c24]Iain A. Stewart:
Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes. COCOA 2011: 82-97 - [c23]Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine:
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. ICPADS 2011: 181-187 - 2010
- [j55]Yonghong Xiang, Iain A. Stewart:
One-to-many node-disjoint paths in (n, k)-star graphs. Discret. Appl. Math. 158(1): 62-70 (2010) - [j54]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. 411(31-33): 2912-2924 (2010) - [c22]James Gate, Iain A. Stewart:
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. CSR 2010: 120-131 - [c21]Iain A. Stewart:
A general algorithm for detecting faults under the comparison diagnosis model. IPDPS 2010: 1-9
2000 – 2009
- 2009
- [j53]Argimiro Arratia Quesada, Iain A. Stewart:
On the power of deep pushdown stacks. Acta Informatica 46(7): 509-531 (2009) - [j52]Iain A. Stewart:
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws. Fundam. Informaticae 91(2): 411-435 (2009) - [j51]Iain A. Stewart:
Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays. J. Log. Comput. 19(1): 217-242 (2009) - [j50]Iain A. Stewart, Yonghong Xiang:
Bipanconnectivity and Bipancyclicity in k-ary n-cubes. IEEE Trans. Parallel Distributed Syst. 20(1): 25-33 (2009) - [c20]Yonghong Xiang, Iain A. Stewart:
Pancyclicity and Panconnectivity in Augmented k-ary n-cubes. ICPADS 2009: 308-315 - 2008
- [j49]Florent R. Madelaine, Iain A. Stewart:
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. Discret. Math. 308(18): 4144-4164 (2008) - [j48]Iain A. Stewart:
On the fixed-parameter tractability of parameterized model-checking problems. Inf. Process. Lett. 106(1): 33-36 (2008) - [j47]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) - [j46]Iain A. Stewart, Yonghong Xiang:
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links. IEEE Trans. Parallel Distributed Syst. 19(8): 1071-1085 (2008) - [c19]Argimiro Arratia, Iain A. Stewart:
Program Schemes with Deep Pushdown Storage. CiE 2008: 11-21 - 2007
- [j45]Iain A. Stewart:
Distributed Algorithms for Building Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes with Faulty Links. J. Interconnect. Networks 8(3): 253-284 (2007) - [j44]Florent R. Madelaine, Iain A. Stewart:
Constraint Satisfaction, Logic and Forbidden Patterns. SIAM J. Comput. 37(1): 132-163 (2007) - 2006
- [j43]Richard Gault, Iain A. Stewart:
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes. Theory Comput. Syst. 39(5): 753-783 (2006) - [c18]Iain A. Stewart:
Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links. ICPADS (1) 2006: 308-318 - [c17]Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261 - 2004
- [j42]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
- [j41]Iain A. Stewart:
The complexity of achievement and maintenance problems in agent-based systems. Artif. Intell. 146(2): 175-191 (2003) - [j40]Florent R. Madelaine, Iain A. Stewart:
Some problems not definable using structure homomorphisms. Ars Comb. 67 (2003) - [j39]Antonio Puricella, Iain A. Stewart:
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. Theor. Comput. Sci. 290(3): 1897-1913 (2003) - [j38]Argimiro Arratia Quesada, Iain A. Stewart:
A note on first-order projections and games. Theor. Comput. Sci. 290(3): 2085-2093 (2003) - 2002
- [j37]Yaagoub Ashir, Iain A. Stewart:
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. SIAM J. Discret. Math. 15(3): 317-328 (2002) - [j36]Iain A. Stewart:
Program schemes, arrays, Lindström quantifiers and zero-one laws. Theor. Comput. Sci. 275(1-2): 283-310 (2002) - 2001
- [j35]Richard Gault, Iain A. Stewart:
On a hierarchy involving transitive closure logic and existential second-order quantification. Log. J. IGPL 9(6): 769-780 (2001) - [c16]Iain A. Stewart:
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws. COCOON 2001: 39-48 - [c15]Antonio Puricella, Iain A. Stewart:
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. WG 2001: 306-316 - [i1]Iain A. Stewart:
Program schemes with binary write-once arrays and the complexity classes they capture. CoRR cs.LO/0112002 (2001)
1990 – 1999
- 1999
- [j34]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) - [j33]Argimiro Arratia Quesada, S. R. Chauhan, Iain A. Stewart:
Hierarchies in Classes of Program Schemes. J. Log. Comput. 9(6): 915-957 (1999) - [c14]Iain A. Stewart:
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. CSL 1999: 374-388 - 1998
- [j32]Clemens Lautemann, Thomas Schwentick, Iain A. Stewart:
Positive Versions of Polynomial Time. Inf. Comput. 147(2): 145-170 (1998) - 1997
- [j31]Iain A. Stewart:
On locating cubic subgraphs in bounded-degree connected bipartite graphs. Discret. Math. 163(1-3): 319-324 (1997) - [j30]Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed:
Communication Algorithms in k-Ary n-Cube Interconnection Networks. Inf. Process. Lett. 61(1): 43-48 (1997) - [j29]Argimiro Arratia Quesada, Iain A. Stewart:
Generalized Hex and Logical Characterizations of Polynomial Space. Inf. Process. Lett. 63(3): 147-152 (1997) - [j28]Iain A. Stewart:
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic. Math. Log. Q. 43: 1-21 (1997) - [j27]Iain A. Stewart:
Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic. Math. Log. Q. 43: 158-178 (1997) - [j26]Yaagoub Ashir, Iain A. Stewart:
On Embedding Cycles in k-Ary n-Cubes. Parallel Process. Lett. 7(1): 49-55 (1997) - [c13]Iain A. Stewart:
A Perspective on Lindström Quantifiers and Oracles. ESSLLI 1997: 51-71 - [c12]Yaagoub Ashir, Iain A. Stewart:
Embeddings of cycles, meshes and tori in faulty k-ary n-cubes. ICPADS 1997: 429-435 - 1996
- [j25]Iain A. Stewart:
Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. Discret. Appl. Math. 68(3): 223-235 (1996) - [c11]Clemens Lautemann, Thomas Schwentick, Iain A. Stewart:
On Positive P. CCC 1996: 162-170 - 1995
- [j24]Iain A. Stewart, Ben Thompson:
On the Intersections of Longest Cycles in a Graph. Exp. Math. 4(1): 41-48 (1995) - [j23]Iain A. Stewart:
Reachability in Some Classes of Acyclic Petri Nets. Fundam. Informaticae 23(1): 91-100 (1995) - [j22]Iain A. Stewart:
Completeness of Path-Problems via Logical Reductions. Inf. Comput. 121(1): 123-134 (1995) - [j21]Iain A. Stewart:
Complete Problems for Monotone NP. Theor. Comput. Sci. 145(1&2): 147-157 (1995) - 1994
- [j20]Iain A. Stewart:
Context-Sensitive Transitive Closure Operators. Ann. Pure Appl. Log. 66(3): 277-301 (1994) - [j19]Iain A. Stewart:
Deciding whether a planar graph has a cubic subgraph is NP-complete. Discret. Math. 126(1-3): 349-357 (1994) - [j18]Iain A. Stewart:
Logical Description of Monotone NP Problems. J. Log. Comput. 4(4): 337-357 (1994) - [j17]Iain A. Stewart:
Monotonicity and the Expressibility of NP Operators. Math. Log. Q. 40: 132-140 (1994) - [j16]Iain A. Stewart:
On Completeness for NP via Projection Translations. Math. Syst. Theory 27(2): 125-157 (1994) - 1993
- [j15]Iain A. Stewart:
Logical and Schematic Characterization of Complexity Classes. Acta Informatica 30(1): 61-87 (1993) - [j14]Iain A. Stewart:
An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. BIT 33(1): 57-62 (1993) - [j13]Iain A. Stewart:
Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. Fundam. Informaticae 18: 65-92 (1993) - [j12]Iain A. Stewart:
Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines. Fundam. Informaticae 18: 93-105 (1993) - [j11]Iain A. Stewart:
On Two Approximation Algorithms for the Clique Problem. Int. J. Found. Comput. Sci. 4(2): 117-133 (1993) - [j10]Stephan Olariu, Iain A. Stewart:
A New Characterization of Unbreakable Graphs. Int. J. Found. Comput. Sci. 4(3): 193-196 (1993) - [j9]Iain A. Stewart:
Methods for Proving Completeness via Logical Reductions. Theor. Comput. Sci. 118(2): 193-229 (1993) - [c10]Iain A. Stewart:
Incorporating Generalized Quantifiers and the Least Fixed Point Operator. CSL 1993: 318-333 - 1992
- [j8]Iain A. Stewart:
Refining known Results on the generalized Word Problem for Free Groups. Int. J. Algebra Comput. 2(2): 221-236 (1992) - [j7]Iain A. Stewart:
Using the Hamiltonian Path Operator to Capture NP. J. Comput. Syst. Sci. 45(1): 127-151 (1992) - [c9]Iain A. Stewart:
Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. CSL 1992: 410-424 - [c8]Iain A. Stewart:
Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. LFCS 1992: 470-479 - 1991
- [j6]Iain A. Stewart:
Obtaining Nielsen Reduced Sets in Free Groups. Bull. EATCS 43: 184-188 (1991) - [j5]Iain A. Stewart:
Complete Problems for Symmetric Logspace Involving Free Groups. Inf. Process. Lett. 40(5): 263-267 (1991) - [j4]Iain A. Stewart:
Comparing the Expressibility of Languages Formed using NP-Complete Operators. J. Log. Comput. 1(3): 305-330 (1991) - [j3]Iain A. Stewart:
Complete Problems Involving Boolean Labelled Structures and Projection Transactions. J. Log. Comput. 1(6): 861-882 (1991) - [c7]Iain A. Stewart:
On Completeness for NP via Projection Translations. CSL 1991: 353-366 - [c6]Iain A. Stewart:
Complete Problems Involving Boolean Labelled Structures and Projections Translations. FSTTCS 1991: 242-260 - [c5]Iain A. Stewart:
Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. WG 1991: 198-208 - 1990
- [j2]Iain A. Stewart:
On The Graph Accessibility Problem for Directed Graphs of Bounded Degree. Bull. EATCS 42: 190-193 (1990) - [c4]Iain A. Stewart:
Using the Hamiltonian Path Operator to Capture NP. ICCI 1990: 134-143 - [c3]Iain A. Stewart:
Comparing the expressibility of two languages formed using NP-complete graph operators. WG 1990: 276-290
1980 – 1989
- 1989
- [j1]Iain A. Stewart:
An Algorithm for Colouring Perfect Planar Graphs. Inf. Process. Lett. 31(2): 97-101 (1989) - 1988
- [c2]Iain A. Stewart:
Colouring Perfect Planar Graphs in Parallel. WG 1988: 268-275 - 1987
- [c1]Iain A. Stewart:
An Algorithm for Colouring Perfect Planar Graphs. FSTTCS 1987: 58-64
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-28 03:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
