The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Iain A. Stewart: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Iain A. Stewart
    Complete Problems Involving Boolean Labelled Structures and Projection Transactions. [Citation Graph (2, 0)][DBLP]
    J. Log. Comput., 1991, v:1, n:6, pp:861-882 [Journal]
  2. Iain A. Stewart
    Comparing the Expressibility of Languages Formed using NP-Complete Operators. [Citation Graph (1, 0)][DBLP]
    J. Log. Comput., 1991, v:1, n:3, pp:305-330 [Journal]
  3. Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
    On Positive P. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:162-170 [Conf]
  4. Iain A. Stewart
    Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:39-48 [Conf]
  5. Iain A. Stewart
    On Completeness for NP via Projection Translations. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:353-366 [Conf]
  6. Iain A. Stewart
    Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. [Citation Graph (0, 0)][DBLP]
    CSL, 1992, pp:410-424 [Conf]
  7. Iain A. Stewart
    Incorporating Generalized Quantifiers and the Least Fixed Point Operator. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:318-333 [Conf]
  8. Iain A. Stewart
    Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:374-388 [Conf]
  9. Iain A. Stewart
    A Perspective on Lindström Quantifiers and Oracles. [Citation Graph (0, 0)][DBLP]
    ESSLLI, 1997, pp:51-71 [Conf]
  10. Iain A. Stewart
    An Algorithm for Colouring Perfect Planar Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:58-64 [Conf]
  11. Iain A. Stewart
    Complete Problems Involving Boolean Labelled Structures and Projections Translations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:242-260 [Conf]
  12. Iain A. Stewart
    Using the Hamiltonian Path Operator to Capture NP. [Citation Graph (0, 0)][DBLP]
    ICCI, 1990, pp:134-143 [Conf]
  13. Yaagoub Ashir, Iain A. Stewart
    Embeddings of cycles, meshes and tori in faulty k-ary n-cubes. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1997, pp:429-435 [Conf]
  14. Iain A. Stewart
    Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links. [Citation Graph (0, 0)][DBLP]
    ICPADS (1), 2006, pp:308-318 [Conf]
  15. Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart
    The Computational Complexity of the Parallel Knock-Out Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:250-261 [Conf]
  16. Iain A. Stewart
    Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:470-479 [Conf]
  17. Antonio Puricella, Iain A. Stewart
    A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:306-316 [Conf]
  18. Iain A. Stewart
    Colouring Perfect Planar Graphs in Parallel. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:268-275 [Conf]
  19. Iain A. Stewart
    Comparing the expressibility of two languages formed using NP-complete graph operators. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:276-290 [Conf]
  20. Iain A. Stewart
    Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:198-208 [Conf]
  21. Iain A. Stewart
    Logical and Schematic Characterization of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1993, v:30, n:1, pp:61-87 [Journal]
  22. Iain A. Stewart
    The complexity of achievement and maintenance problems in agent-based systems. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:146, n:2, pp:175-191 [Journal]
  23. Iain A. Stewart
    Context-Sensitive Transitive Closure Operators. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:66, n:3, pp:277-301 [Journal]
  24. Florent R. Madelaine, Iain A. Stewart
    Some problems not definable using structure homomorphisms. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  25. Iain A. Stewart
    An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. [Citation Graph (0, 0)][DBLP]
    BIT, 1993, v:33, n:1, pp:57-62 [Journal]
  26. Iain A. Stewart
    Program schemes with binary write-once arrays and the complexity classes they capture [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  27. Iain A. Stewart
    Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:3, pp:223-235 [Journal]
  28. Iain A. Stewart
    On The Graph Accessibility Problem for Directed Graphs of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:42, n:, pp:190-193 [Journal]
  29. Iain A. Stewart
    Obtaining Nielsen Reduced Sets in Free Groups. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1991, v:43, n:, pp:184-188 [Journal]
  30. Iain A. Stewart
    Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:18, n:, pp:65-92 [Journal]
  31. Iain A. Stewart
    Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:18, n:, pp:93-105 [Journal]
  32. Iain A. Stewart
    Reachability in Some Classes of Acyclic Petri Nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:23, n:1, pp:91-100 [Journal]
  33. Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
    Positive Versions of Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:147, n:2, pp:145-170 [Journal]
  34. Iain A. Stewart
    Completeness of Path-Problems via Logical Reductions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:1, pp:123-134 [Journal]
  35. Richard Gault, Iain A. Stewart
    On a hierarchy involving transitive closure logic and existential second-order quantification. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2001, v:9, n:6, pp:- [Journal]
  36. Stephan Olariu, Iain A. Stewart
    A New Characterization of Unbreakable Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:193-196 [Journal]
  37. Iain A. Stewart
    On Two Approximation Algorithms for the Clique Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:117-133 [Journal]
  38. A. A. Arratia-Quesada, Iain A. Stewart
    Generalized Hex and Logical Characterizations of Polynomial Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:3, pp:147-152 [Journal]
  39. Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed
    Communication Algorithms in k-Ary n-Cube Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:1, pp:43-48 [Journal]
  40. S. R. Chauhan, Iain A. Stewart
    On the Power of Built-In Relations in Certain Classes of Program Schemes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:2, pp:77-82 [Journal]
  41. Iain A. Stewart
    An Algorithm for Colouring Perfect Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:2, pp:97-101 [Journal]
  42. Iain A. Stewart
    Complete Problems for Symmetric Logspace Involving Free Groups. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:5, pp:263-267 [Journal]
  43. Iain A. Stewart
    Using the Hamiltonian Path Operator to Capture NP. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:45, n:1, pp:127-151 [Journal]
  44. A. A. Arratia-Quesada, S. R. Chauhan, Iain A. Stewart
    Hierarchies in Classes of Program Schemes. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1999, v:9, n:6, pp:915-957 [Journal]
  45. Iain A. Stewart
    Logical Description of Monotone NP Problems. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1994, v:4, n:4, pp:337-357 [Journal]
  46. Iain A. Stewart
    Monotonicity and the Expressibility of NP Operators. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1994, v:40, n:, pp:132-140 [Journal]
  47. Iain A. Stewart
    Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1997, v:43, n:, pp:1-21 [Journal]
  48. Iain A. Stewart
    Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1997, v:43, n:, pp:158-178 [Journal]
  49. Iain A. Stewart
    On Completeness for NP via Projection Translations. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:2, pp:125-157 [Journal]
  50. Yaagoub Ashir, Iain A. Stewart
    On Embedding Cycles in k-Ary n-Cubes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:1, pp:49-55 [Journal]
  51. Florent R. Madelaine, Iain A. Stewart
    Constraint Satisfaction, Logic and Forbidden Patterns. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:132-163 [Journal]
  52. Yaagoub Ashir, Iain A. Stewart
    Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:3, pp:317-328 [Journal]
  53. A. A. Arratia-Quesada, Iain A. Stewart
    A note on first-order projections and games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2085-2093 [Journal]
  54. Tomás Feder, Florent R. Madelaine, Iain A. Stewart
    Dichotomies for classes of homomorphism problems involving unary functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:314, n:1-2, pp:1-43 [Journal]
  55. Antonio Puricella, Iain A. Stewart
    Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1897-1913 [Journal]
  56. Iain A. Stewart
    Program schemes, arrays, Lindström quantifiers and zero-one laws. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:283-310 [Journal]
  57. Iain A. Stewart
    Methods for Proving Completeness via Logical Reductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:118, n:2, pp:193-229 [Journal]
  58. Iain A. Stewart
    Complete Problems for Monotone NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:147-157 [Journal]
  59. Iain A. Stewart
    On locating cubic subgraphs in bounded-degree connected bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:319-324 [Journal]
  60. Iain A. Stewart
    Deciding whether a planar graph has a cubic subgraph is NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:349-357 [Journal]
  61. Richard Gault, Iain A. Stewart
    An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:5, pp:753-783 [Journal]

  62. Program Schemes with Deep Pushdown Storage. [Citation Graph (, )][DBLP]


  63. Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. [Citation Graph (, )][DBLP]


  64. On the power of deep pushdown stacks. [Citation Graph (, )][DBLP]


  65. One-to-many node-disjoint paths in (n, k)-star graphs. [Citation Graph (, )][DBLP]


  66. Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies. [Citation Graph (, )][DBLP]


Search in 0.252secs, Finished in 0.256secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002