1. Published

    (Non-)existence of Polynomial Kernels for the Test Cover Problem

    Gutin, G., Muciaccia, G. & Yeo, A., 2013, In: Information Processing Letters. 113, p. 123-126

    Research output: Contribution to journalArticlepeer-review

  2. Published

    A characterization of horizontal visibility graphs and combinatorics on words

    Gutin, G., Mansour, T. & Severini, S., 2011, In: Physica A: Statistical Mechanics and its Applications . 390, p. 2421-2428

    Research output: Contribution to journalArticlepeer-review

  3. Published

    A classification of locally semicomplete digraphs

    Bang-Jensen, J., Guo, Y., Gutin, G. & Volkmann, L., 1997, In: Discrete Mathematics. 167/168, p. 101-114

    Research output: Contribution to journalArticle

  4. Published

    A complete characterization of complexity for Boolean constraint optimization problems

    Cohen, D., Cooper, M. & Jeavons, P., 2004, p. 212-226.

    Research output: Contribution to conferencePaper

  5. Published

    A Completeness Theory for Polynomial (Turing) Kernelization

    Hermelin, D., Kratsch, S., Soltys, K., Wahlström, M. & Wu, X., 2013, IPEC. Springer, Vol. LNCS 8246. p. 202 215 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  6. Published

    A construction which can be used to produce finitely presented infinite simple groups

    Scott, E., 1984, In: Journal of Algebra. 90, p. 294-322

    Research output: Contribution to journalArticlepeer-review

  7. Published

    A Cooperative Information System for the Connected Communities

    Pitt, J., Mamdani, E. & Stathis, K., 1 May 1998, Proceedings of COOP'98: Improving the Design of Cooperative Systems. Darses, F. & Zarate, P. (eds.).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  8. Published

    A dialectic architecture for computational autonomy

    Witkowski, M. & Stathis, K., 2004, Agents and computational autonomy: potential, risks, and solutions. Springer-Verlag, Vol. 2969. p. 261-273 13 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  9. Published

    A Dichotomy for Minimum Cost Graph Homomorphisms

    Gutin, G., Hell, P., Rafiey, A. & Yeo, A., May 2008, In: European Journal of Combinatorics. 29, 4, p. 900-911 12 p.

    Research output: Contribution to journalArticlepeer-review

  10. Published

    A FAST Front End Application

    Stathis, K., 1 Apr 1994, Proceedings of the 2nd International Conference on the Practical Applications of Prolog (PAP'94). Sterling, L. (ed.). p. 537-548 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  11. Published

    A Fast Glimpse of Knowledge-Based Front-Ends as Games

    Stathis, K. & Sergot, M. J., 1 Oct 1996, Proc. of 1st International Conference on Successes and Failures of Knowledge-Based Systems in Real World Applications. Batanov, D. & Brezillon, P. (eds.). Bangkok, Thailand: AIT Press, p. 19-33 15 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  12. Published

    A finitely presented simple group with unsolvable conjugacy problem

    Scott, E., 1984, In: Journal of Algebra. 90, p. 333-353

    Research output: Contribution to journalArticlepeer-review

  13. Published

    A Formal Framework of Virtual Organisations as Agent Societies

    McGinnis, J., Stathis, K. & Toni, F., 25 Jan 2010, p. 1-14. 14 p.

    Research output: Contribution to conferencePaperpeer-review

  14. Published

    A formal model of agent-oriented virtual organisations and their formation

    McGinnis, J., Stathis, K. & Toni, F., 29 Dec 2011, In: Multiagent and Grid Systems. 7, 6, p. 291-310

    Research output: Contribution to journalArticlepeer-review

  15. Published

    A formal transformation and refinement method for re-engineering concurrent programs

    Younger, E., Bennett, K. & Luo, Z., 1997, Proc of IEEE Inter. Conf. on Software Maintenance.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  16. Published

    A Framework for the Cryptographic Enforcement of Information Flow Policies

    Alderman, J., Crampton, J. & Farley, N., 7 Jun 2017, Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM, p. 143-154 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  17. Published

    A Game-based Architecture for developing Interactive Components in Computational Logic

    Stathis, K., Brogi, A. (ed.) & Hill, P. (ed.), 1 Mar 2000, In: Functional and Logic Programming, Special Issue on Logical Formalisms for Program Composition. 2000, 5

    Research output: Contribution to journalArticlepeer-review

  18. Published

    A Higher-order Calculus and Theory Abstraction

    Luo, Z., 1988, LFCS Report Series.

    Research output: Chapter in Book/Report/Conference proceedingOther contribution

  19. Published

    A Higher-order Calculus and Theory Abstraction

    Luo, Z., 1991, In: Information and Computation. 90, 1, p. 107-137 31 p.

    Research output: Contribution to journalArticlepeer-review

  20. Published

    A Lightweight Service Registry for Unstable Ad-hoc Networks

    Goncalves, P., Stathis, K. & Peach, N., 16 Nov 2011, Proceedings of the International Joint Conference on Ambient Intelligence (AmI 2011). p. 136-140 (Lecture Notes in Computer Science; vol. 7040/2011).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  21. Published

    A maximal tractable class of soft constraints

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2004, In: Journal of Artificial Intelligence Research. 22, p. 1-22

    Research output: Contribution to journalArticlepeer-review

  22. Published

    A Modular Hierarchy of Logical Frameworks

    Adams, R., 2004, Types for Proofs and Programs. Berardi, S., Coppo, M. & Damiani, F. (eds.). Springer, Vol. 3085. p. 1-16 16 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  23. Published

    A Multivariate Approach for Checking Resiliency in Access Control

    Crampton, J., Gutin, G. & Watrigant, R., 2016, Algorithmic Aspects in Information and Management: AAIM 2016. Springer-Verlag, p. 173-184 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  24. Forthcoming

    A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem

    Karapetyan, D. & Gutin, G., 2011, (Accepted/In press) In: Evolutionary Computation. in press

    Research output: Contribution to journalArticlepeer-review

  25. Forthcoming

    A new bound for 3-satisfiable MaxSat and its algorithmic application

    Gutin, G., Jones, M., Scheder, D. & Yeo, A., 2013, (Accepted/In press) In: Information and Computation. 8 p.

    Research output: Contribution to journalArticlepeer-review

  26. Published

    A new bound on the domination number of graphs with minimum degree two

    Henning, M., Schiermeyer, I. & Yeo, A., 2011, In: The Electronic Journal of Combinatorics. 18, 1

    Research output: Contribution to journalArticlepeer-review

  27. Published

    A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure

    Cohen, D. A., 2003, p. 807-811.

    Research output: Contribution to conferencePaper

  28. Published

    A New Sufficient Condition for a Digraph to be Hamiltonian

    Bang-Jensen, J., Guo, Y. & Yeo, A., 1999, In: Discrete Applied Mathematics. 95, 1-3, p. 61-72 12 p.

    Research output: Contribution to journalArticlepeer-review

  29. Published

    A new upper bound on the total domination number of a graph

    Henning, M. & Yeo, A., 2007, In: The Electronic Journal of Combinatorics. 14, 1

    Research output: Contribution to journalArticlepeer-review

  30. Published

    A Note on Alternating Cycles in Edge-coloured Graphs

    Yeo, A., 1997, In: Journal of Combinatorial Theory, Series B. 69, p. 222-225 4 p.

    Research output: Contribution to journalArticlepeer-review

  31. Published

    A note on cardinality of certain classes of unlabeled multipartite tournaments

    Gutin, G., 1998, In: Discrete Mathematics. 186, p. 277-280

    Research output: Contribution to journalArticle

  32. Published

    A Pluralist Approach to the Formalisation of Mathematics

    Adams, R. & Luo, Z., 2 Jul 2011, In: Mathematical Structures in Computer Science. 21, 4, p. 913-942 29 p.

    Research output: Contribution to journalArticlepeer-review

  33. Published

    A Polynomial Algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph

    Yeo, A., 1999, In: Journal of Algorithms. 33, 1, p. 124-139 16 p.

    Research output: Contribution to journalArticlepeer-review

  34. Published

    A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

    Bang-Jensen, J., Gutin, G. & Yeo, A., 1998, In: Journal of Graph Theory. 29, 2, p. 111-132

    Research output: Contribution to journalArticlepeer-review

  35. Published

    A polynomial kernel for Multicut In Trees

    Bousquet, N., Daligault, J., Thomasse, S. & Yeo, A., 2009, p. 183--194.

    Research output: Contribution to conferencePaper

  36. Published

    A probabilistic approach to problems parameterized above or below tight bounds

    Gutin, G., Kim, E. J., Szeider, S. & Yeo, A., Mar 2011, In: Journal of Computer and System Sciences. 77, 2, p. 422-429

    Research output: Contribution to journalArticlepeer-review

  37. Published

    A Problem of Adequacy: conservativity of calculus of constructions over higher-order logic

    Luo, Z., 1990, LFCS Report Series. LFCS, Edinburgh Univ

    Research output: Chapter in Book/Report/Conference proceedingOther contribution

  38. Published

    A problem of finding an acceptable variant in some generalized project networks

    Blokh, D., Gutin, G., Yeo, A. & Yeo, A., 2005, In: Journal of Applied Mathematics and Decision Science. 2, p. 75-81 7 p.

    Research output: Contribution to journalArticlepeer-review

  39. Published

    A Self-Healing Distributed Pervasive Health System

    Bromuri, S., Schumacher, M. & Stathis, K., 2013, In: Int. J. of Web Engineering and Technology. 8, 2, p. 177 196 p.

    Research output: Contribution to journalArticlepeer-review

  40. Published

    A Service Oriented Approach for Ubiquitous Agents in AMI Systems Using EVATAR

    Dipsis, N. & Stathis, K., 2010, p. 213. 220 p.

    Research output: Contribution to conferencePaperpeer-review

  41. Published

    A Set-theoretic Setting for Structuring Theories in Proof Development

    Luo, Z. & Burstall, R., 1992, LFCS Report Series. LFCS, Edinburgh Univ

    Research output: Chapter in Book/Report/Conference proceedingOther contribution

  42. Published

    A Structural Decomposition for Hypergraphs

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1994, Jerusalem Combinatorics ’93. Barcelo, H. & Kalai, G. (eds.). American Mathematical Society, p. 161-177 17 p. (Contemporary Mathematics; vol. 178).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  43. Published

    A Substitution Operation for Constraints

    Jeavons, P. G., Cohen, D. A. & Cooper, M. C., 1 May 1994, Principles and Practice of Constraint Programming: Second International Workshop, PPCP '94 Rosario, Orcas Island, WA, USA, May 2–4, 1994 Proceedings. Borning, A. (ed.). Vol. 874. p. 1-9

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  44. Published

    A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

    Gutin, G., Bang-Jensen, J. & Huang, J., 1996, In: Discrete Mathematics. 161, p. 1-12

    Research output: Contribution to journalArticle

  45. Published

    A Test for Tractability

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1996, p. 267-281.

    Research output: Contribution to conferencePaper

  46. Published

    A Theoretical Framework for Constraint Propagator Triggering

    Cohen, D., Petrie, K. & Jefferson, C., 12 May 2016. 9 p.

    Research output: Contribution to conferencePaperpeer-review

  47. Published

    A tour around finitely presented infinite simple groups

    Scott, E., 1989, Algorithms And Classification in Combinatorial Group Theory. Springer-Verlag, p. 83-119

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  48. Published

    A transition from total domination in graphs to transversals in hypergraphs

    Henning, M. & Yeo, A., 2007, In: Quaestiones Mathematicae. 30, p. 1-20 20 p.

    Research output: Contribution to journalArticlepeer-review

  49. Published

    A type-theoretic framework for formal reasoning with different logical foundations

    Luo, Z., 2007, Advances in Computer Science, Proc of the 11th Annual Asian Computing Science Conference. LNCS 4435. Springer

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  50. Published

    A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition.

    Cohen, D. A., Jeavons, P. & Gyssens, M., 2005, p. 72-77.

    Research output: Contribution to conferencePaper

  51. Published

    A unified theory of structural tractability for constraint satisfaction problems

    Cohen, D., Jeavons, P. & Gyssens, M., Aug 2008, In: Journal of Computer and System Sciences. 74, 5, p. 721-743 23 p.

    Research output: Contribution to journalArticlepeer-review

  52. Published

    A Unifying Framework for Tractable Constraints

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1995, p. 276-291.

    Research output: Contribution to conferencePaper

  53. Published

    A Unifying Theory of Dependent Types: the schematic approach

    Luo, Z., 1992, Proc. of Symp. on Logical Foundations of Computer Science (Logic at Tver'92), LNCS 620.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  54. Unpublished

    Above And Below Guarantee Parameterizations For Combinatorial Optimisation Problems

    Jones, M., 2013, (Unpublished) 141 p.

    Research output: ThesisDoctoral Thesis

  55. Published

    Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem

    Wahlström, M., 2013, STACS. p. 341-352 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  56. Published

    Access Control in Publicly Verifiable Outsourced Computation

    Alderman, J., Janson, C., Cid, C. & Crampton, J., 14 Apr 2015, Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security - ASIACCS 2015. ACM, p. 657-662 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  57. Published

    Access-as-you-need: A computational logic framework for accessing resources in artificial societies

    Toni, F. & Stathis, K., 2003, p. 126-140. 15 p.

    Research output: Contribution to conferencePaperpeer-review

  58. Published

    Accessing External Applications from Knowledge-Based Systems

    Cosmadopoulos, Y., Southwick, R. & Stathis, K., 1990, Proceedings of Expert Systems 90, Research and Development in Expert Systems VII. Addis, T. R. & Muir, R. M. (eds.). p. 54-65 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  59. Published

    Acyclicity in edge-colored graphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 6 Feb 2017, In: Discrete Mathematics. 340, 2, p. 1-8 8 p.

    Research output: Contribution to journalArticlepeer-review

  60. Published

    Adversarial resilience of matchings in bipartite random graphs

    Balister, P., Gerke, S. & McDowell, A., 2 Dec 2016, In: Journal of Combinatorics. 8, 1, p. 79-92 14 p.

    Research output: Contribution to journalArticlepeer-review

  61. Published

    Algebraic Proof Complexity: Progress, Frontiers and Challenges

    Pitassi, T. & Tzameret, I., 8 Jul 2016, ACM SIGLOG News. Immerman, N. (ed.). New York: ACM, Vol. 3. p. 21-43 23 p.

    Research output: Chapter in Book/Report/Conference proceedingOther contribution

  62. Published

    Algebraic Proof Complexity: Progress, Frontiers and Challenges

    Pitassi, T. & Tzameret, I., 2017, Electronic Colloquium on Computation Complexity .

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  63. Published

    Algebraic Proofs over Noncommutative Formulas

    Tzameret, I., 2011, In: Information and Computation. 209, 10, p. 1269-1292 24 p.

    Research output: Contribution to journalArticlepeer-review

  64. Published

    Algebraic Proofs over Noncommutative Formulas

    Tzameret, I., 2010, 7th Annual Conference on Theory and Applications of Models of Computation. Berlin, Vol. 6108. p. 60 71 p. (Lecture Notes in Computer Science (LNCS)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  65. Published

    Algorithm for Finding k-Vertex Out-trees and its Application to k-Internal Out-branching Problem.

    Cohen, N., Fomin, F., Gutin, G., Kim, E. J., Saurabh, S. & Yeo, A., 2010, In: Journal of Computer and System Sciences. 76, p. 650-662

    Research output: Contribution to journalArticlepeer-review

  66. Published

    Algorithms for generating convex sets in acyclic digraphs

    Balister, P., Gerke, S., Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A. & Yeo, A., Dec 2009, In: Journal of Discrete Algorithms. 7, 4, p. 509–518 10 p.

    Research output: Contribution to journalArticlepeer-review

  67. Published

    Algorithms for Workflow Satisfiability Problem with User-independent Constraints

    Gutin, G. & Karapetyan, D., Mar 2020, In: International Journal of Graph Computing. 1, 1, p. 25-38 14 p.

    Research output: Contribution to journalArticlepeer-review

  68. Published

    Algorithms with large domination ratio

    Alon, N., Gutin, G. & Krivelevich, M., 2004, In: Journal of Algorithms. 50, 1, p. 118-131

    Research output: Contribution to journalArticle

  69. Forthcoming

    All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Number of Vertices

    Gutin, G., van Iersel, L., Mnich, M. & Yeo, A., 2011, (Accepted/In press) In: Journal of Computer and System Sciences. in press

    Research output: Contribution to journalArticlepeer-review

  70. Published

    Almost all almost regular c-partite tournaments with $c geq 5$ are vertex pancyclic

    Tewes, M., Volkmann, L. & Yeo, A., 2002, In: Discrete Mathematics. 242, 1-3, p. 201-228 28 p.

    Research output: Contribution to journalArticlepeer-review

  71. Published

    Almost minimum diameter orientations of semicomplete multipartitite and extended digraphs

    Gutin, G., Koh, K. M., Tay, E. G. & Yeo, A., 2002, In: Graphs and Combinatorics. 18, 3, p. 499-506 8 p.

    Research output: Contribution to journalArticlepeer-review

  72. Published

    Alternating cycles and trails in 2-edge-coloured multigraphs

    Bang-Jensen, J. & Gutin, G., 1998, In: Discrete Mathematics. 188, 1, p. 61-72

    Research output: Contribution to journalArticle

  73. E-pub ahead of print

    Alternative parameterizations of Metric Dimension

    Gutin, G., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 25 Jan 2019, In: Theoretical Computer Science. p. 1-11 11 p.

    Research output: Contribution to journalArticlepeer-review

  74. Published

    Ambient Intelligence

    Sadri, F. & Stathis, K., 2008, Encyclopedia of Artificial Intelligence. Idea Group Inc, p. 85-91

    Research output: Chapter in Book/Report/Conference proceedingEntry for encyclopedia/dictionary

  75. Published

    Ambient intelligence using KGP agents

    Stathis, K. & Toni, F., 1 Nov 2004, p. 351--362.

    Research output: Contribution to conferencePaper

  76. Published

    Ambient Intelligence: Agents and Interaction in Connected Communities

    Stathis, K., Spence, R., de Bruijn, O. & Purcell, P., 2006, Networked Neighbourhoods: The Connected Community in Context. Purcell, P. (ed.). London: Springer, p. 279-304

    Research output: Chapter in Book/Report/Conference proceedingChapter

  77. Published

    An abstract framework for globalising interactive systems

    Stathis, K. & Sergot, M., Feb 1998, In: Interacting with Computers. 9, 4, p. 401-416 16 p.

    Research output: Contribution to journalArticlepeer-review

  78. Published

    An agent development framework based on social positions

    Lekeas, G. & Stathis, K., 2004, p. 5461-5466. 6 p.

    Research output: Contribution to conferencePaperpeer-review

  79. Published

    An Agent Development Framework based on Social Positions

    Lekeas, G. K. & Stathis, K., 1 Oct 2004, IEEE Interantional Conference on Systems, Man and Cybernetics. Thiessen, W. & Wieringa, P. (eds.).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  80. Published

    An agile approach to language modelling and development

    Johnstone, A., Mosses, P. D. & Scott, E., Mar 2010, In: Innovations in Systems and Software Engineering. 6, 1-2, p. 145-153 9 p.

    Research output: Contribution to journalArticlepeer-review

  81. Published

    An algebraic characterisation of complexity for valued constraints

    Cohen, D., Cooper, M. & Jeavons, P., 2006, p. 107-121.

    Research output: Contribution to conferencePaper

  82. Published

    An Algebraic Characterization of Tractable Constraints

    Jeavons, P. G. & Cohen, D. A., 1995, p. 633-642.

    Research output: Contribution to conferencePaper

  83. Published

    An Algebraic Theory of Complexity for Discrete Optimisation

    Cohen, D. A., Cooper, M. C., Creed, P., Jeavons, P. G. & Živný, S., 2013, In: SIAM Journal on Computing. 42, 5, p. 1915-1939 24 p.

    Research output: Contribution to journalArticlepeer-review

  84. Published

    An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection

    Cohen, D. A., Creed, P., Jeavons, P. G. & Živný, S., 2011, Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings. Springer, p. 231-242 (Lecture Notes in Computer Science; vol. 6907).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  85. Published

    An algorithm for finding connected convex subgraphs of an acyclic digraph

    Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A. & Yeo, A., 2007, p. 69-82. 14 p.

    Research output: Contribution to conferencePaperpeer-review

  86. Published

    An algorithm for finding input-output constrained convex sets in an acyclic digraph

    Gutin, G., Johnstone, A., Reddington, J., Scott, E. & Yeo, A., May 2012, In: Journal of Discrete Algorithms. 13, p. 47-58 12 p.

    Research output: Contribution to journalArticlepeer-review

  87. Published

    An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph

    Gutin, G., Johnstone, A., Reddington, J., Scott, E., Yeo, A., Broersma, H. (ed.), Erlebach, T. (ed.), Friedeizky, T. (ed.) & Paulusma, D. (ed.), 2008, In: Lecture Notes in Computer Science. 5344, p. 206-217 12 p.

    Research output: Contribution to journalArticlepeer-review

  88. Published

    An Argumentative Model for Service-oriented Agents

    Morge, M., McGinnis, J., Bromuri, S., Mancarella, P. & Stathis, K., 1 Mar 2008, Proc. of the International Symposium on Architectures for Intelligent Theory-Based Agents. Balduccini, M. & Baral, C. (eds.). p. 6 1 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  89. Unpublished

    An Extended Calculus of Constructions

    Luo, Z., 1990, (Unpublished) Univ of Edinburgh.

    Research output: ThesisDoctoral Thesis

  90. Published

    An Implementation of LF with Coercive Subtyping and Universes.

    Callaghan, P. & Luo, Z., 2001, In: Journal of Automated Reasoning. 27, 1, p. 3-27 25 p.

    Research output: Contribution to journalArticlepeer-review

  91. Published

    Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels

    Bodlaender, H. L., Thomasse, S. & Yeo, A., 2009, p. 635--646.

    Research output: Contribution to conferencePaper

  92. Published

    Anti-matroids

    Gutin, G. & Yeo, A., 2002, In: Operations Research Letters. 30, 2, p. 97-99

    Research output: Contribution to journalArticlepeer-review

  93. E-pub ahead of print

    Approximation algorithms for general cluster routing problem

    Zhang, X., Du, D., Gutin, G., Ming, Q. & Sun, J., 27 Aug 2020, Computing and Combinatorics : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings. Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (eds.). Springer, p. 472-483 12 p. (Lecture Notes in Computer Science; vol. 12273).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  94. Published

    Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

    Gutin, G. & Sun, Y., May 2020, In: Discrete Mathematics. 343, 5, p. 1-4 4 p., 111816.

    Research output: Contribution to journalArticlepeer-review

  95. Published

    Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs

    Sun, Y., Gutin, G. & Ai, J., Aug 2019, In: Discrete Mathematics. 342, 8, p. 2297-2305 9 p.

    Research output: Contribution to journalArticlepeer-review

  96. E-pub ahead of print

    Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions

    Bang-Jensen, J., Gutin, G. & Yeo, A., 13 Apr 2020, In: Journal of Graph Theory.

    Research output: Contribution to journalArticlepeer-review

  97. Published

    Are there Effective Frequency Separation Constraints for FAPs with Irregular Tx Placements?

    Bater, J. E., Jeavons, P. G., Cohen, D. A. & Dunkin, N. W., 1 Oct 1998.

    Research output: Contribution to conferencePaper

  98. Published

    Arguing over Motivations within the V3A-Architecture for Self-Adaptation

    Morge, M., Stathis, K. & Vercouter, L., 2009, ICAART 2009: Proceedings of the International Conference on Agents and Artificial Intelligence. SETUBAL: INSTICC-INST SYST TECHNOLOGIES INFORMATION CONTROL, p. 214-219 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  99. Published

    Argumentation sur les motivations propres dans l'architecture V3A pour des agents auto-adaptatifs

    Morge, M., Stathis, K. & Vercouter, L., 2008, Actes des 16ème Journées Francophones sur les Systèmes Multi-Agen ts (JFSMA). France: Cepudes

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  100. Published

    Argumentative Agents for Service-Oriented Computing

    Morge, M., McGinnis, J., Bromuri, S., Mancarella, P., Stathis, K. & Toni, F., 2013, Multiagent Systems and Applications. Ganzha, M. & Jain, L. C. (eds.). Springer-Verlag Berlin Heidelberg, p. 217-255 39 p.

    Research output: Chapter in Book/Report/Conference proceedingOther contribution

Previous 1 2 3 4 5 6 Next