Program schemes, arrays, Lindström quantifiers and zero-one lawsSTEWART, Iain A.Theoretical computer science. 2002, Vol 275, Num 1-2, pp 283-310, issn 0304-3975Article

On the fixed-parameter tractability of parameterized model-checking problemsSTEWART, Iain A.Information processing letters. 2008, Vol 106, Num 1, pp 33-36, issn 0020-0190, 4 p.Article

Program schemes, queues, the recursive spectrum and zero-one lawsSTEWART, Iain A.Lecture notes in computer science. 2001, pp 39-48, issn 0302-9743, isbn 3-540-42494-6Conference Paper

One-to-many node-disjoint paths in (n, k)-star graphsYONGHONG XIANG; STEWART, Iain A.Discrete applied mathematics. 2010, Vol 158, Num 1, pp 62-70, issn 0166-218X, 9 p.Article

CONSTRAINT SATISFACTION, LOGIC AND FORBIDDEN PATTERNSMADELAINE, Florent; STEWART, Iain A.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 132-163, issn 0097-5397, 32 p.Article

Greedy algorithms, H-colourings and a complexity-theoretic dichotomyPURICELLA, Antonio; STEWART, Iain A.Theoretical computer science. 2003, Vol 290, Num 3, pp 1897-1913, issn 0304-3975, 17 p.Article

Fault-tolerant embeddings of Hamiltonian circuits in K-ary N-cubesASHIR, Yaagoub A; STEWART, Iain A.SIAM journal on discrete mathematics (Print). 2002, Vol 15, Num 3, pp 317-328, issn 0895-4801Article

Improved upper and lower bounds on the feedback vertex numbers of grids and butterfliesMADELAINE, Florent R; STEWART, Iain A.Discrete mathematics. 2008, Vol 308, Num 18, pp 4144-4164, issn 0012-365X, 21 p.Article

A note on first-order projections and gamesARRATIA, Argimiro A; STEWART, Iain A.Theoretical computer science. 2003, Vol 290, Num 3, pp 2085-2093, issn 0304-3975, 9 p.Article

The computational complexity of the parallel knock-out problemBROERSMA, Hajo; JOHNSON, Matthew; PAULUSMA, Daniël et al.Theoretical computer science. 2008, Vol 393, Num 1-3, pp 182-195, issn 0304-3975, 14 p.Article

A generic greedy algorithm, partially-ordered graphs and NP-completenessPURICELLA, Antonio; STEWART, Iain A.Lecture notes in computer science. 2001, pp 306-316, issn 0302-9743, isbn 3-540-42707-4Conference Paper

The computational complexity of the parallel knock-out problemBROERSMA, Hajo; JOHNSON, Matthew; PAULUSMA, Daniël et al.Lecture notes in computer science. 2006, pp 250-261, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

A class of hierarchical graphs as topologies for interconnection networksLAI, Pao-Lien; HSU, Hong-Chun; TSAI, Chang-Hsiung et al.Theoretical computer science. 2010, Vol 411, Num 31-33, pp 2912-2924, issn 0304-3975, 13 p.Article