The following pages link to Iain A. Stewart (Q265086):
Displaying 50 items.
- Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes (Q265087) (← links)
- Generalized hex and logical characterizations of polynomial space (Q287159) (← links)
- (Q344854) (redirect page) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- Multiswapped networks and their topological and algorithmic properties (Q394739) (← links)
- Augmented \(k\)-ary \(n\)-cubes (Q621635) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- A general technique to establish the asymptotic conditional diagnosability of interconnection networks (Q714794) (← links)
- The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies (Q941343) (← links)
- On the fixed-parameter tractability of parameterized model-checking problems (Q963328) (← links)
- One-to-many node-disjoint paths in \((n,k)\)-star graphs (Q968113) (← links)
- A class of hierarchical graphs as topologies for interconnection networks (Q982664) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- (Q1076156) (redirect page) (← links)
- The paraheight of certain skew linear groups (Q1076157) (← links)
- Hypercentrality and hypercyclicity in skew linear groups (Q1080528) (← links)
- Complete problems for symmetric logspace involving free groups (Q1183484) (← links)
- Using the Hamiltonian path operator to capture NP (Q1198664) (← links)
- On the power of built-in relations in certain classes of program schemes (Q1277684) (← links)
- Deciding whether a planar graph has a cubic subgraph is NP-complete (Q1318823) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Logical and schematic characterization of complexity classes (Q1323362) (← links)
- On locating cubic subgraphs in bounded-degree connected bipartite graphs (Q1356566) (← links)
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202) (← links)
- A note on first-order projections and games. (Q1401218) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- An algorithm for colouring perfect planar graphs (Q1825203) (← links)
- Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
- Completeness of path-problems via logical reductions (Q1898118) (← links)
- Finding regular subgraphs in both arbitrary and planar graphs (Q1923612) (← links)
- Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs (Q2009644) (← links)
- Using semidirect products of groups to build classes of interconnection networks (Q2192066) (← links)
- Variational networks of cube-connected cycles are recursive cubes of rings (Q2296278) (← links)
- On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← links)
- On the combinatorial design of data centre network topologies (Q2402367) (← links)
- The expressibility of fragments of hybrid graph logic on finite digraphs (Q2446549) (← links)
- The computational complexity of the parallel knock-out problem (Q2481963) (← links)
- An infinite hierarchy in a class of polynomial-time program schemes (Q2509042) (← links)
- (Q2757847) (← links)
- Graph Editing to a Fixed Target (Q2870027) (← links)
- On the Mathematics of Data Centre Network Topologies (Q2947887) (← links)
- ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES (Q3144931) (← links)
- On a hierarchy involving transitive closure logic and existential second-order quantification (Q3147357) (← links)
- Comparing the Expressibility of Languages Formed Using NP-Complete Operators (Q3358723) (← links)
- An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar (Q3467847) (← links)
- Program Schemes with Deep Pushdown Storage (Q3507414) (← links)
- The Computational Complexity of the Parallel Knock-Out Problem (Q3525764) (← links)
- Frameworks for Logically Classifying Polynomial-Time Optimisation Problems (Q3569736) (← links)
