CIRCA Publications by Year

 
 

2010   |   2009   |   2008   |   2007   |   2006   |   2005   |   2004   |   2003   |   2002   |   2001   |   2000 

2012

  1. Albert, M., Atkinson, M., Bouvel, M., Ruskuc, N. & Vatter, V. (2012) Geometric grid classes of permutations In : Transactions of the American Mathematical Society.
  2. Beratarbide, E. & Kelsey, T. (2012) eHealth Governance in Scotland: a cross-sectoral and cross-national comparison In: eHealth: Ethical, Legal and Governance Challenges. Springer, p. 299.
  3. Balasubramaniam, D., Gent, I.P., Jefferson, C., Kotthoff, L., Miguel, I.J. & Nightingale, P. (2012)An Automated Approach to Generating Efficient Constraint Solvers, 34th International Conference on Software Engineering, Zurich, Switzerland, June 2012
  4. Cain, A. J., Ruskuc, N. & Thomas, R. (2012)Unary FA-presentable semigroups In : International Journal of Algebra and Computation.
  5. Distler, A. , Jefferson, C. A. , Kelsey, T. & Kotthoff, L. (2012) The semigroups of order 10 In: Principles and Practice of Constraint Programming: 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings. Milano, M. (ed.). Springer, p. 883-899. (Lecture Notes in Computer Science).
  6. Fleming, R. , Kelsey, T. , Anderson, R. , Wallace, H. & Nelson, S. (2012) Interpreting human follicular recruitment and antimullerian hormone concentrations throughout life In : Fertility and Sterility. 98, 5, p. 1097-1102.
  7. Gray, R. & Ruskuc, N. (2012) Maximal subgroups of free idempotent generated semigroups over the full transformation monoid In : Proceedings of the London Mathematical Society.
  8. Gray, R. & Ruskuc, N. (2012) On maximal subgroups of free idempotent generated semigroups In : Israel Journal of Mathematics.
  9. Hyde, J. T., Loughlin, N., Quick, M., Ruskuc, N. & Wallis, A. (2012) On the growth of generating sets for direct powers of semigroups In : Semigroup Forum. 84, 1, p. 116-130.
  10. Kelsey, T. W., Anderson, R. A., Wright, P., Nelson, S. M. & Wallace, W. H. B. (2012) Data-driven assessment of the human ovarian reserve In : Molecular Human Reproduction. 18, 2, p. 79-87.
  11. Kelsey, T. & Wallace, W. H. B. (2012) Ovarian volume correlates strongly with the number of non-growing follicles in the human ovary In : Obstetrics and Gynecology International. 2012
  12. Neunhoeffer, M. & Seress, A. (2012) Constructive Recognition of Classical Groups in their Natural Representation Submitted.
  13. Wallace, H. , Kelsey, T. & Anderson, R. (2012) Ovarian cryopreservation: Experimental or established and a cure for the menopause? In : Reproductive BioMedicine Online. 25, 2, p. 93-95.

2011

  1. Akgun, O., Miguel, I. J., Jefferson, C. A., Frisch, A. M. & Hnich, B. (2011)Extensible Automated Constraint Modelling Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence. AAAI Press p. 4-11.
  2. Albert, M., Linton, S. A., Ruskuc, N., Vatter, V. & Waton, S. (2011)On convex permutations In : Discrete Mathematics. 311, 8-9, p. 715-722.
  3. Atkinson, M., Ruskuc, N. & Smith, R. (2011)Substitution-closed pattern classes In : Journal of Combinatorial Theory, Series A. 118, 2, p. 317-340.
  4. Balasubramaniam, D., De Silva, L. R., Jefferson, C. A., Kotthoff, L., Miguel, I. J. & Nightingale, P. (2011)Dominion: an architecture-driven approach to generating efficient constraint solvers Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA). Los Alamiros, CA : IEEE Computer Society p. 228-231.
  5. Beratarbide, E. & Kelsey, T. (2011)eHealth Governance, A Key Factor for Better Health Care: Implementation of IT Governance to Ensure Better Care through Better eHealth Ethical Issues and Security Monitoring Trends in Global Healthcare: Technological Advancements. Brown, S. & Brown, M. (eds.). Medical Information Science Reference p. 72-92.
  6. Bovdi, V. A., Jespers, E. & Konovalov, A. (2011)Torsion units in integral group rings of Janko simple groups In : Mathematics of Computation. 80, 273, p. 593-615.
  7. Bovdi, V., Konovalov, A. & Linton, S. A. (2011)Torsion Units in Integral Group Rings of Conway Simple Groups In : International Journal of Algebra and Computation. 21, 4, p. 615.
  8. Brignall, R., Ruskuc, N. & Vatter, V. (2011)Simple extensions of combinatorial structures In : Mathematika. 57, 2, p. 193-214.
  9. Cain, A., Gray, R. & Ruskuc, N. (2011)Green index in semigroups: generators, presentations and automatic structures In : Submitted.
  10. Carvalho, C., Gray, R. & Ruskuc, N. (2011)Presentations of inverse semigroups, their kernels and extensions In : Journal of the Australian Mathematical Society. 90, 3, p. 289-316.
  11. Cichon, J., Mitchell, J. D., Morayne, M. & Peresse, Y. H. (2011)Relative ranks of Lipschitz mappings on countable discrete metric spaces In : Topology and Its Applications. 158, 3, p. 412-423.
  12. Coutts, H. J., Quick, M. & Roney-Dougal, C. M. (2011)The primitive permutation groups of degree less than 4096 In : Communications in Algebra. 39, 10, p. 3526-3546.
  13. Dolinka, I. & Ruskuc, N. (2011)Finite groups are big as semigroups In : Archiv der Mathematik. 97, 3, p. 209-217.
  14. Eick, B. & Konovalov, A. (2011)The modular isomorphism problem for the groups of order 512 Groups St. Andrews 2009 in Bath. Vol. 2. 388. Cambridge : Cambridge University Press p. 375-383. (London Math. Soc. Lecture Note Ser.)
  15. Gent, I., Jefferson, C., Kotthoff, L. & Miguel, I. Modelling Constraint Solver Architecture Design as a Constraint Problem, Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming, York, UK, April 2011
  16. Gent, I.P., Jefferson, C.A., Miguel, I.J. & Nightingale, P. (2011). Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints. Proceedings of the 22nd International Conference on Artifical Intelligence (IJCAI 2011). p. 623-628.
  17. Gent, I.P. & Kotthoff, L. (2011)Reliability of Computational Experiments on Virtualised Hardware, AAAI workshop AI for Data Center Management and Cloud Computing, San Francisco, USA, August 2011
  18. Gray, R. & Ruskuc, N. (2011)Generators and relations for subsemigroups via boundaries in Cayley graphs In : Journal of Pure and Applied Algebra. 215, 11, p. 2761-2779.
  19. Gray, R. & Ruskuc, N. (2011)On residual finiteness of monoids, their Schützenberger groups and associated actions In : Submitted.
  20. Jefferson, C., Moncur, W. & Petrie, K. E. (2011)Combination: automated generation of puzzles with constraintsProceedings of the 2011 ACM Symposium on Applied Computing. 2011. p. 907-912.
  21. Jefferson, C. & Petrie, K. (2011)Automatic Generation of Constraints for Partial Symmetry Breaking Principles and Practice of Constraint Programming – CP 2011. Lee, J. (ed.). 6876. Springer Berlin / Heidelberg p. 729-743. (Lecture Notes in Computer Science).
  22. Kelsey, T. & Kotthoff, L. (2011)Exact Closest String as a Constraint Satisfaction Problem Proceedings of the International Conference on Computational Science, ICCS 2011 . 4. Procedia Computer Science p. 1062-1071.
  23. Kelsey, T., Wright, P., Nelson, S., Anderson, R. & Wallace, H. (2011). A Validated Model of Serum Anti-Müllerian Hormone from Conception to Menopause. In PLoS One 6, 7.
  24. Komendantsky, V., Konovalov, A. & Linton, S. (2011)View of Computer Algebra Data from Coq p. 74-89.Submitted.
  25. Komendantsky, V., Konovalov, A. & Linton, S. (2011)Interfacing Coq + SSReflect with GAP 14p paper Submitted.
  26. Kotthoff, L., Gent, I. & Miguel, I. (2011) A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems, Fourth Annual Symposium on Combinatorial Search, Barcelona, Spain, July 2011
  27. Linton, S.A., Hammond, K., Konovalov, A. & Brown, C.M. (2011). Easy Composition of Symbolic Computation Software using SCSCP: A New Lingua Franca for Symbolic Computation. Journal of Symbolic Computation.
  28. Maltcev, V. & Ruskuc, N. (2011)On hopfian cofinite subsemigroups In : Submitted.
  29. McDougall-Bagnall, J. M. & Quick, M. (2011)Groups with the basis property In : Journal of Algebra. 346, 1, p. 332-339.
  30. Mitchell, J. D., Araújo, J. & Schneider, C. (2011)Groups that together with any transformation generate regular semigroups or idempotent generated semigroups Journal of Algebra : Elsevier, p. 93-106.
  31. Mitchell, J. D., Morayne, M. & Peresse, Y. H. (2011)Generating the infinite symmetric group using a closed subgroup and the least number of other elements In : Proceedings of the American Mathematical Society. 139, p. 401-405.
  32. Murray, S. H. & Roney-Dougal, C. M. (2011)Constructive homomorphisms for classical groups In : Journal of Symbolic Computation. 46, 4, p. 371-384.
  33. Nelson, S., Messow, M., McConnachie, A., Wallace, H., Kelsey, T., Fleming, R., Anderson, R. & Leader, B. (2011) External Validation of Nomogram for the Decline in Serum Anti-M¨u;llerian Hormone in Women: a Population Study of 15,834 Infertility Patients. In Reproductive BioMedicine Online 23, p.204-206.
  34. Neunhoeffer, M., Pfeiffer, M. & Ruskuc, N. (2011)Deciding Word Problems of Semigroups using Finite State Automata. Submitted.
  35. Nightingale, P. W. (2011)The Extended Global Cardinality Constraint: An Empirical Survey In : Artificial Intelligence. 175, 2, p. 586-614.
  36. Roney-Dougal, C. M., Robertson, E. F., Campbell, C. M., Quick, M., Smith, G. & Traustason, G. (2011)Groups St Andrews 2009 in Bath Cambridge University Press. 700 p. (London Mathematical Society Lecture Note Series).

2010

  1. Abdollahi, A., Faghihi, A., Linton, S. A., & O’Brien, E. A. (2010). Finite 3-groups of class 3 whose elements commute with their automorphic images. Archiv der Mathematik, 95(1), 1-7.
  2. Akgun, O., Frisch, A.M., Hnich, B., Jefferson, C., Miguel, I. Conjure Revisited: Towards Automated Constraint Modelling. Proceedings of the 9th International Workshop on Constraint Modelling and Reformulation (ModRef), 2010.
  3. Albert, M., Atkinson, M., & Linton, S. (2010). Permutations Generated by Stacks and Deques. ANNALS OF COMBINATORICS, 14(1), 316.
  4. Albert, M., Linton, S. A., & Ruskuc, N. (2010) On the permutational power of token passing networksPermutation Patterns 2007, LMS Lecture Notes, Cambridge University Press, 2010.
  5. Albert, M., Atkinson, M., Brignall, R., Ruskuc, N., Smith, R. & West, J. (2010) Growth rates for subclasses of Av(321) In Electronic Journal of Combinatorics. 17, 16 p.
  6. Araujo, J., von Bunau, P., Mitchell, J. D. & Neunhöffer, M. (2010) Computing automorphisms of semigroups. In Journal of Symbolic Computation. 45, p. 373-392. 20 p.
  7. Behrends, R., Konovalov, A., Linton, S., Lübeck, F., & Neunhöffer, M. (2010). Towards high-performance computational algebra with GAP. 58–61. Paper presented at Third international congress conference on Mathematical software (ICMS 2010), Kobe, Japan.
  8. Behrends, R., Konovalov, A., Linton, S., Lübeck, F., & Neunhöffer, M. (2010). Parallelising the computational algebra system GAP. 177–178. Paper presented at 4th International Workshop on Parallel and Symbolic Computation (PASCO 2010), Grenoble, France.
  9. Beratarbide, E. & Kelsey, T. W. (2010) eHealth Governance: A key factor for better health care Ethical Issues and Security Monitoring Trends in Global Healthcare: Technological Advancements. Brown, S. & Brown, M. (eds.). IGI Global
  10. Brown, C. M., Li, H. & Thompson, S.(2010) An Expression Processor: a Case Study in Refactoring Haskell Programs. 11th Symposium on Trends in Functional Programming, Oklahoma.
  11. Brown, C. M. & Thompson, S. (2010) Clone Detection and Elimination for Haskell. Partial Evaluation and Program Manipulation Conference, Madrid. p. 111-120.
  12. Brown, C. M. & Hammond, K. (2010) Ever Decreasing Circles: a Skeleton for Parallel Orbit Calculations in Eden11th Symposium on Trends in Functional Programming, Oklahoma.
  13. Cain, A. J., Oliver, G., Ruskuc, N. & Thomas, R. M. (Aug-2010) Automatic Presentations and Semigroup Constructions In THEORY OF COMPUTING SYSTEMS. 47, 2, p. 568-592. 25 p.
  14. Cohen, S. D. & Huczynska, S. (2010) The strong primitive normal basis theorem. In Acta Arithmetica. 143, 4, p. 299-332. 34 p.
  15. de Jesus, M. M., Maltcev, V., Mitchell, J. D. & Fernandes, V. H. (2010) Endomorphisms of the semigroup of order-preserving mappings. In SEMIGROUP FORUM. 81, p. 277-285. 9 p.
  16. Gent, I. P., Jefferson, C. A., Miguel, I. J., & Nightingale, P. W. (2010). Generating Special-purpose Stateless Propagators for Arbitrary Constraints. In Cohen, D. (Ed.), Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (pp. 206-220). (Lecture Notes in Computer Science). Springer.
  17. Gent, I. P., Jefferson, C. A., Kotthoff, L., Miguel, I. J., Moore, N. C. A., Nightingale, P. W., & Petrie, K. (2010). Learning When to Use Lazy Learning in Constraint Solving. In Proceedings of the 19th European Conference on Artificial Intelligence (pp. 873-878).
  18. I.P. Gent, I. Miguel, A. Rendl. Optimising Quantified Expressions in Constraint Models. Proceedings of the 9th International Workshop on Constraint Modelling and Reformulation (ModRef), 2010.
  19. Huczynska, S. & Brunk, F. (2010) Some Erdos-Ko-Rado theorems for injections. In European Journal of Combinatorics. 31, p. 839-860.
  20. Huczynska, S. (2010) Equidistant frequency permutation arrays and related constant composition codes. In DESIGNS CODES AND CRYPTOGRAPHY. 54, 2, p. 109-120. 12 p.
  21. Kelsey, T. & Wallace, W. H. B. (2010) Machine Science in Biomedicine: Practicalities, Pitfalls and Potentia.Proceedings of the First Workshop on Knowledge Engineering, Discovery and Dissemination in Health (KEDDH10): Proc. KEDDH10. IEEE Computer Society Press p. 117-122. 6 p.
  22. Kelsey, T. W. (2010) The dynamics of human ovarian reserve. Proceedings of the International Society for Computational Biology, Latin America Conference
  23. Kelsey, T. W., Caserta, B., Castillo, L., Wallace, W. H. B. & Coppola, F. (2010) Proliferating Cell Nuclear Antigen (PCNA) allows the automatic identification of follicles in microscopic images of human ovarian tissueIn Journal of Pathology and Laboratory Medicine International. 2010, 2, p. 99-105.
  24. Konovalov, A., & Linton, S. (2010). Parallel computations in modular group algebras. 141–149. Paper presented at 4th International Workshop on Parallel and Symbolic Computation (PASCO 2010), Grenoble, France.
  25. Kotthoff, L., Miguel, I. J., & Nightingale, P. W. (2010). Ensemble Classification for Constraint Solver Configuration. In Cohen, D. (Ed.), Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (pp. 321-329). (Lecture Notes in Computer Science). Springer.
  26. Linton, S., Hammond, K., Konovalov, A., Al Zain, A. D., Trinder, P., Horn, P., & Roozemond, D. (2010). Easy composition of symbolic computation software: a new lingua franca for symbolic computation. In Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation (pp. 339-346). (ISSAC ’10). ACM.
  27. Moore, N. C. A., Gent, I. P., & Miguel, I. J. (2010). Lazy Explanations for Constraint Propagators. In Carro, M., & Pena, R. (Eds.), Proceedings of the Twelfth International Symposium on Practical Aspects of Declarative Languages (pp. 217-233). (Lecture Notes in Computer Science). Springer.
  28. Quick, M. & Ruskuc, N. (2010) Growth of generating sets for direct powers of classical algebraic structures In Journal of the Australian Mathematical Society. 89, p. 105-126.
  29. Quick, M., Mitchell, J. D., Peresse, Y. H. & Morayne, M. (2010) Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances. In Annals of Pure and Applied Logic. 161, 12, p. 1471-1485.
  30. Roney-Dougal, C. M. & Holt, D. (2010) Constructing maximal subgroups of orthogonal groups. In The London Mathematical Society Journal of Computational Mathematics. 13, 31 p.
  31. Wallace, W. H. B. & Kelsey, T. W. (2010) Human Ovarian Reserve from Conception to the Menopause. In PLoS One. 5, 1 e8772, 5 p.

2009

  1. Ahmadidelir, K.; Campbell, C. M.; Doostie, H. Two classes of finite semigroups and monoids involving Lucas numbers. Semigroup Forum 78 (2009), no. 2, 200-209.
  2. Albert, M. H.; Linton, S. A. Growing at a perfect speed. Combin. Probab. Comput. 18 (2009), no. 3, 301-308,
  3. Abdallah Al Zain, Kevin Hammond, Jost Berthold, Philip W. Trinder, Greg Michaelson, Mustafa Aswad. Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures. DAMP 2009: 25-36
  4. Abyd Al Zain, Valerie Gibson, Greg Michaelson, Kevin Hammond, Steffen Jost, Hans-Wolfgang Loidl. Towards Hume SIMD Vectorisation In EUSIPCO09 — European Signal Processing Conference, Glasgow, Scotland, August 24–28, 2009.
  5. João Araújo, P.V. Bünau, Max Neunhoeffer and James D.Mitchell. Computing automorphisms of semigroups. Journal of Symbolic Computation 20 October 2009
  6. Jost Berthold, Simon Marlow, Kevin Hammond, Abdallah Al Zain. Comparing and Optimising Parallel Haskell Implementations for Multicore Machines. ICPP Workshops 2009: 386-393
  7. Saleem Bhatti, Edwin Brady, Kevin Hammond, James McKinna. Domain Specific Languages (DSLs) for Network Protocols ICDCS Workshops 2009: 208-213
  8. Bovdi, V.; Grishkov, A.; Konovalov, A. Kimmerle conjecture for the Held and O’Nan sporadic simple groups. Sci. Math. Jpn. 69 (2009), no. 3, 353-361.
  9. Bovdi, V. A.; Konovalov, A. B. Integral group ring of Rudvalis simple group. Ukraïn. Mat. Zh. 61 (2009), no. 1, 3–13; translation in Ukrainian Math. J. 61 (2009), no. 1, 1-13,
  10. J.N.Bray, D.F.Holt and Colva M. Roney-Dougal. Certain classical groups are not well-defined, Journal of Group Theory, 12 (2009) 171-180.
  11. S Brett, N Bee, W H B Wallace, M Rajkhowa, T W Kelsey Individual ovarian volumes obtained from 2D and 3D ultrasound lack precision; Reproductive Biomedicine Online; 18(3):348-35
  12. A.J. Cain, G. Oliver, N. Ruskuc and R.M. Thomas, Automatic presentations for semigroups, Inform. and Comput. 207 (2009), 1156-1168
  13. Campbell, C. M.; Campbell, P. P. The Fibonacci lengths of binary polyhedral groups and related groups. Proceedings of the Eleventh International Conference on Fibonacci Numbers and their Applications. Congr. Numer. 194 (2009), 95-102.
  14. J. Carlson, M. Neunhoeffer and Colva M. Roney-Dougal. A polynomial-time reduction algorithm for groups of semilinear or subfield class, J. Algebra. 322, (2009), 613-637.
  15. Andreas Distler and Tom Kelsey, The Monoids of Orders Eight, Nine and Ten, Annals of Mathematics and Artificial Intelligence: Volume 56, Issue 1 (2009)
  16. E. Dombi and N. Ruskuc, On generators and presentations of semidirect products in inverse semigroups, Bull. Austral. Math. Soc. 79 (2009), 353-365.
  17. I. P. Gent, S. Huczynska, P. McKay, I. Miguel, P. Nightingale. Modelling Equidistant Frequency Permutation Arrays in Constraints. Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA), 2009
  18. R. Gray and N. Ruskuc, On residual finiteness of direct products of algebraic systems, Monathsh. Math. 158 (2009), 63-69.
  19. R. Gray, k-CS-transitive Infinite Graphs Journal of Combinatorial Theory, Series B, Vol. 99, 2009, pp. 378–398.
  20. R. Gray and J. K. Truss, Cycle-free Partial Orders and Ends of Graphs, Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 146, 2009, pp. 535–550.
  21. A. Grayland, C. Jefferson, I. Miguel, C. Roney-Dougal. Minimal Ordering Constraints for some Families of Variable Symmetries. Annals of Mathematics and Artificial Intelligence 57(1), 75-102, 2009.
  22. A. Grayland, I. Miguel, C.M. Roney-Dougal. Snake Lex: An Alternative to Double Lex. Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, 391-399, 2009
  23. A. Grayland, I. Miguel, C. M. Roney-Dougal. In search of a better method to break row and column symmetriesProceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA), 2009.
  24. A. Grayland, I. Miguel, C. M. Roney-Dougal. Confluence of reduction rules for lexicographic ordering constraints. Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA), 2009.
  25. Gudmund Grov, Greg Michaelson, Steffen Jost, Christoph Hermann, Hans-Wolfgang Loidl. An application of Hume analysis to imperative programs In SETP09: Intl. Conf. on Software Engineering Theory and Practice, Orlando, FL, USA, July 13–16, 2009.
  26. S.Huczynska, J.D.Mitchell and Colva M. Roney-Dougal (eds). Surveys in Combinatorics, 2009, LMS Lecture Note Series, 365, Cambridge University Press 2009.
  27. S.Huczynska, G.L.Mullen and J.Yucas, The extent to which subsets are additively closed, Journal of Combinatorial Theory, Series A, 116 (2009), 831–843.
  28. S. Huczynska, P. McKay, I. Miguel, P. Nightingale. Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics. Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, 50-64, 2009
  29. Christopher Jefferson, Serdar Kadioglu, Karen E. Petrie, Meinolf Sellmann, Stanislav Zivný. Same-Relation Constraints. CP 2009: 470-485
  30. Steffen Jost, Hans-Wolfgang Loidl, Norman Scaife, Kevin Hammond, Greg Michaelson, Martin Hofmann.Worst-Case Execution Time Analysis through Types In ECRTS’09: EUROMICRO Conference on Real-Time Systems, Dublin, Ireland, July 1-3, 2009.
  31. Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, Norman Scaife, Martin Hofmann. “Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis. FM 2009: 354-369
  32. T W Kelsey. Radioterapia, factores ambientales y fallo ovárico prematuro, Capítulo 7 de Preservación de la fertilidad en la paciente oncológica; Justo Callejo Olmos (ed); Editorial Glosa, Barcelona
  33. Z. Kiziltan, A.M. Frisch, B. Hnich, I. Miguel, T. Walsh. Filtering Algorithms for the Multiset Ordering Constraints. Artificial Intelligence 173(2), 299-328, 2009.
  34. A.Konovalov , S.Freundt, P.Horn, S.Lesseni, S.Linton and D.Roozemond. OpenMath in SCIEnce: Evolving of Symbolic Computation Interaction. OpenMath workshop 2009.
  35. Hans-Wolfgang Loidl, Steffen Jost. Improvements to a Resource Analysis for Hume In FOPARA’09: International Workshop on Foundational and Practical Aspects of Resource Analysis. Eindhoven, The Netherlands, 3 November, 2009. LNCS 6324, Springer.
  36. Hans-Wolfgang Loidl, Kenneth MacKenzie, Steffen Jost, Lennart Beringer. A Proof-carrying-code Infrastructure for Resources. In LADC09 — Fourth Latin American Symposium on Dependable Computing, Joao Pessoa, Paraiba, Brazil, September 1–4, 2009.
  37. V. Maltcev, J.D. Mitchell and N. Ruskuc, The Bergman property for semigroups, J. Lond. Math. Soc. 80 (2009) 212-232;
  38. Peter Nightingale, Non-binary Quantified CSP: Algorithms and Modelling, Constraints, Volume 14, pages 539-581, 2009.
  39. A. Rendl, I. Miguel, I. P. Gent, C. Jefferson. Automatically Enhancing Constraint Model Instances during Tailoring. Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA), 120-127, AAAI Press, 2009.
  40. A. Rendl, I. Miguel, I. P. Gent, P. Gregory. Common Subexpressions in Constraint Models of Planning Problems. Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA), 128-135, AAAI Press, 2009.
  41. A. Rendl, I. Miguel, I.P. Gent. The Cost of Flattening with Common Subexpression Elimination. Proceedings of the Eighth International Workshop on Constraint Modelling and Reformulation, 117-131, 2009.
  42. Phil Trinder, Murray Cole, Hans-Wolfgang Loidl, Greg Michaelson. Characterising Effective Resource Analyses for Parallel and Distributed Coordination In FOPARA’09: International Workshop on Foundational and Practical Aspects of Resource Analysis. Eindhoven, The Netherlands, 3 November, 2009. LNCS 6324, Springer.
  43. 2009; C Xiong, T W Kelsey, S A Linton, U Leonhardt. Towards the calculation of Casimir forces for inhomogeneous planar media, Proceedings of the 8th Asian Symposium on Computer Mathematics (ASCM); ; Math-for-Industry MI Lecture Note Series Vol.22:222-230

2008

  1. A. Al Zain, J. Berthold, K. Hammond and P.W. Trinder Orchestrating Production Computer Algebra Components into Portable Parallel Programs To appear in Proc. Open Source Grid and Cluster Conference, May 2008.
  2. A. Al Zain, J. Berthold, P.W. Trinder, K. Hammond and R. Loogen Parallel Functional Middleware for Computational Algebra Systems. Intl. Symp. on Trends in Functional Programming (TFP 2008), The Netherlands, May 2008.
  3. A.D. Al Zain, P. W. Trinder, K. Hammond, A. Konovalov, S. Linton and J. Berthold Parallelism without Pain: Orchestrating Computational Algebra Components into a High-Performance Parallel System In Parallel and Distributed Processing with Applications 2008 (ISPA’08) – International Symposium on pp99-112
  4. Abdallah Al Zain, Phil Trinder, Greg Michaelson, Kavin Hammon, Steve Linton SCIEnce: Using High-Level Parallel Technology for Grid Enabled Symbolic Computation UK e-Science 2008 All Hands meeting, Edinburgh 8-10 September 2008
  5. Al Zain, A.D. Trinder, P.W. Hammond, K. Konovalov, A. Linton, S. Berthold, J. Parallelism without Pain: Orchestrating Computational Algebra Components into a High-Performance Parallel System International Symposium on Parallel and Distributed Processing with Applications, 2008. ISPA ’08. Sydney, NSW. pp99-112
  6. V. A. Bovdi, A. B. Konovalov and S. Linton Torsion Units in Integral Group Ring of the Mattieu Simple Group M22 London Mathematical Society Journal of Computation and Mathematics vol 11 2008 pp28-39
  7. Victor Bovdi and Alexander Konovalov Integral Group Ring of the Mathieu Simple Group M23Communications in Algebra, Volume 36, Issue 7, July 2008, pages 2670 – 2680.
  8. Victor Bovdi, Alexander Konovalov and Eduardo do N. Marcos Integral group ring of the Suzuki sporadic simple group Publ. Math. Debrecen 72/3-4 (2008), 487-503.
  9. R. Brignall, S. Huczynska and V. Vatter Simple permutations and algebraic generating functions Journal of Combinatorial Theory, Series A, 115 (2008), no.3, 423–441.
  10. R. Brignall, S. Huczynska and V. Vatter Decomposing simple permutations, with enumerative consequencesCombinatorica 28 (2008), no. 4, 385–400.
  11. R. Brignall, N. Ruskuc and V. Vatter Simple permutations: decidability and unavoidable structures Theoret. Comput. Sci. 391 (2008), 150-163.
  12. A.J. Cain, G. Oliver, N. Ruskuc and R.M. Thomas Automatic presentations for cancellative semigroups in Language and Automata Theory and Applications, Lecture Notes in Computer Science 5196, Springer, Berlin, 2008.
  13. A.J. Cain, N. Ruskuc and E.F. Robertson Cancellative and Malcev presentations for finite Rees index subsemigroups and extensions J. Australian Math. Soc. 84 (2008), 39-61.
  14. Alan J. Cain, Edmund F. Robertson and Nik Ruskuc Cancellative and Malcev presentations for finite Rees index subsemigroups and extensions J. Aust. Math. Soc. 84 (2008), 39-61.
  15. Alexandru Cârstea, Georgiana Macariu, Dana Petcu and Alexander Konovalov Pattern Based Composition of Web Services for Symbolic Computations Lecture Notes in Computer Science, Volume 5101/2008 (Computational Science – ICCS 2008, 8th International Conference, Kraków, Poland, June 23-25, 2008, Proceedings, Part I), pages 126-135.
  16. A.Carstea, M.Frincu, A.Konovalov, G.Macariu, D.Petcu On Service-oriented Symbolic Computing Parallel Processing and Applied Mathematics, Proceedings of PPAM 2007 (http://www.ppam.pl/) LNCS 4967, Springer, 2008, p.843-851.
  17. U.B. Darji and J.D. Mitchell Highly transitive subgroups of the symmetric group on the natural numbers Colloq. Math. 112 (2008) 163-173.
  18. L. Descalco, N. Ruskuc Properties of the subsemigroups of the bicyclic monoid Czech. Math. J. 58(133) (2008), 311-330.
  19. 2008; A Distler, T W Kelsey The Monoids of Order Eight and Nine Lecture Notes in Artificial Intelligence; S Autexier, J Campbell, J Rubio, V Sorge, M Suzuki, F Wiedijk (ed); Springer-Verlag, Berlin; 5144:61-76
  20. M. Droste, R. Gray and J.K. Truss Construction of Some Uncountable 2-arc-transitive Bipartite Graphs, Order 25 (2008) 349-357.
  21. J. Farrell, R. S. Perry, A. Rost, J. F. Mercure, N. Kikugawa, S. A. Grigera & A. P. Mackenzie Effect of electron doping the metamagnet LaySr3 yRu2O7 Phys. Rev. B 78, 180409(R) (2008).
  22. Sebastian Freundt, Peter Horn, Alexander Konovalov, Steve Linton and Dan Roozemond Symbolic Computation Software Composability in Intelligent Computer Mathematics, Lecture Notes in Computer Science, Volume 5144, 2008, Springer Berlin, Heidelberg, p.285-295
  23. A.M. Frisch, I. Miguel (eds). Special Issue on Abstraction and Automation in Constraint Modelling. Constraints 13 (3), 2008.
  24. A.M. Frisch, W. Harvey, C. Jefferson, B. Martinez-Hernandez, I. Miguel ,I.Essence: A Constraint Language for Specifying Combinatorial Problems, Constraints 13(3), 2008.
  25. Ian P. Gent and Ian Miguel and Peter Nightingale Generalised Arc Consistency for the AllDifferent Constraint: An Empirical Survey Artificial Intelligence, Volume 172 number 18 pages 1973-2000.
  26. Ian P. Gent, Peter Nightingale, Andrew Rowley and Kostas Stergiou Solving Quantified Constraint Satisfaction Problems Artificial Intelligence, Volume 172 (2008) pages 738-771.
  27. I.P. Gent, I. Miguel, A. Rendl. Common Subexpression Elimination in Automated Constraint ModellingProceedings of the International Workshop on Modeling and Solving Problems with Constraints, 2008.
  28. R. Gray and J.D. Mitchell Largest Subsemigroups of the Full Transformation Semigroup, Discrete Math. 308 (2008), 4801-4810.
  29. R. Gray and N. Ruskuc Green Index and Finiteness Conditions for Semigroups J. Algebra 320 (2008), 3145-3164.
  30. R. Gray and J.K. Truss Construction of Some Countable One-arc Transitive Bipartite Graphs Discrete Math. 308 (2008), 6392-6405.
  31. A. Grayland , I. Miguel and C. M. Roney-Dougal. Confluence of reduction rules for lexicographic ordering constraints Eighth International Workshop on Symmetry and Constraint Satisfaction Problems, 2008.
  32. George Havas, Edmund F. Robertson and Dale C. Sutherland Behind and beyond a theorem on groups related to trivalent graphs J. Aust. Math. Soc. 85 (2008), 323-332.
  33. P. E. Holmes, S. A. Linton, E. A. O’Brien, A. J. E. Ryba and R. A. Wilson Constructive membership in black-box groups Journal of Group Theory (2008) 1-17, de Gruyter ed.
  34. S. Huczynska and N. Ruskuc Pattern classes of permutations via bijections between linearly ordered setsEuropean Journal of Combinatorics 29 (2008), no. 1, 118–139.
  35. V. Janjic and K. Hammond Prescient Scheduling of Parallel Functional Programs on the Grid Intl. Symp. on Trends in Functional Programming (TFP 2008), The Netherlands, May 2008.
  36. V. Janjic, K. Hammond and Y. Yang Using Application Information to Drive Adaptive Grid Middleware Scheduling Decisions Intl. Workshop. on Middleware-Application Interaction (MAI 2008), Norway, June 2008.
  37. U. Leonhardt and T. Tyc, Superantenna made of transformation media New J. Phys. 10, 115026 (2008).
  38. U. Leonhardt and D. R. Smith Focus on Cloaking and Transformation Optics Editorial, New J. Phys. 10, 115019 (2008).
  39. M Livie, S Brett, T W Kelsey, K Whalley, R Hume, A Burchell, M Rajkhowa A report on a two year experience in the recruitment of embryo donors for human stem cell derivation Human Reproduction; Oxford University Press, Oxford, UK; 23(1):166-167, 2008.
  40. H.-W. Loidl, P.W. Trinder, Hammond, A. Al Zain and C. Baker-Finch Semi-Explicit Parallel Programming in a Purely Functional Style: GpH Chapter in Process Algebra for Parallel and Distributed Processing, Alexander M, Gardner W (Eds), Chapman Hall (2008).
  41. Max Neunhoeffer and Sarah Scherotzke Formulas for primitive Idempotents in Frobenius Algebras and an Application to Decomposition Maps Representation Theory 12 (2008), p. 170-185.
  42. Max Neunhoeffer and Cheryl E. Praeger Computing Minimal Polynomials of Matrices LMS Journal of Computation and Mathematics. 11 (2008), p. 252-279; 2008.
  43. T. Ochiai, U. Leonhardt, and J. C. Nacher A novel design of dielectric perfect invisibility devices J. Math. Phys. 49, 032903 (2008).
  44. T. G. Philbin and U. Leonhardt Alternative calculation of the Casimir forces between birefringent plates Phys. Rev. A 78, 042107 (2008).
  45. T. G. Philbin, C. Kuklewicz, S. Robertson, S. Hill, F. Konig, and U. Leonhardt Fiber-Optical Analog of the Event Horizon Science 319, 1367-1370 (2008)
  46. M Rajkowa, S Brett, T W Kelsey, C Lipina, L Logie, D J Cuthbertson, J Petrie, C Sutherland Altered Extracellular Regulated Kinase Signaling in skeletal muscle in women with Polycystic Ovary Syndrome Human Reproduction; Oxford University Press, Oxford, UK; 23(1), 2008:181-182
  47. G. Rousseaux, C. Mathis, P. Maissa, T. G. Philbin, and U. Leonhardt Observation of negative-frequency waves in a water tank: a classical analogue to the Hawking effect? New J. Phys. 10, 053015 (2008).
  48. N. Ru, R. A. Borzi, A. Rost, A. P. Mackenzie, J. Laverock, S. B. Dugdale, & I. R. Fisher De Haas van Alphen oscillations in the charge-density wave compound lanthanum tritelluride (LaTe3) Phys. Rev. B 78 045123 (2008).
  49. A. Tamai, M.P. Allan, J.F. Mercure, W. Meevasana, R. Dunkel, D.H. Lu, R.S. Perry, A.P. Mackenzie, D.J. Singh, Z.-X. Shen, and F. Baumberger Fermi surface and van Hove singularities in the itinerant metamagnet Sr3Ru2O7Phys. Rev. Lett. 101, 026407 (2008).
  50. T. Tyc and U. Leonhardt Transmutation of Singularities in Optical Instruments New J. Phys. 10, 115038 (2008).
  51. B. Vignolle, A. Carrington, R. A. Cooper, M. M. J. French, A. P. Mackenzie, C. Jaudet, D. Vignolles, Cyril Proust & N. E. Hussey Quantum oscillations in an overdoped high temperature superconductor Nature 455, 952 (2008).

2007

  1. M. H. Albert, S. A. Linton and N. Ruskuc. On the permutational power of token passing networks Theoretical Computer Science (to appear), 2007.
  2. B. Assmann and B. Eick Testing polycyclicity of finitely generated rational matrix groups Mathematics of Computation 76, 1669-1682, 2007.
  3. R. A. Borzi, S. A. Grigera, J. Farrell, R.S. Perry, S. Lister, S. L. Lee, D. A. Tennant, Y. Maeno and A. P. Mackenzie Formation of a Nematic Fluid at High Fields in Sr3Ru2O7 Science 315, 214, 2007.
  4. J. D. Bradley and P. E. Holmes Improved bounds for the spread of sporadic groups The London Mathematical Society Journal of Computation and Mathematics 10, 132-140, 2007.
  5. R. Brignall, S. Huczynska and V. Vatter Simple permutations and algebraic generating functions Journal of Combinatorial Theory Series A (to appear), 2007.
  6. R. Brignall, N. Ruskuc and V. Vatter Simple permutations: decidability and unavoidable structures Theoretical Computer Science (to appear), 2007.
  7. J. R. Britnell, A. Evseev, R. M. Guralnick, P. E. Holmes and A. Maroti. Sets of elements that pairwise generate a linear group Journal of Combinatorial Theory Series A (to appear), 2007.
  8. F. Brunk, and N. Ruskuc  Largest Intersecting Families of Almost Linear Posets submitted.
  9. A. J. Cain. Malcev presentations for subsemigroups of groups – a survey In C. M. Campbell, M. R. Quick, E. F. Robertson, G. C. Smith (eds), Groups St Andrews 2005 Volume I, no. 339 in London Mathematical Society Lecture Notes Series, Cambridge University Press, 256-268, 2007.
  10. A. J. Cain. Malcev presentations for subsemigroups of direct products of coherent groups Journal of Pure and Applied Algebra (to appear), 2007.
  11. A.J. Cain, E.F. Robertson, N. Ruskuc Cancellative and Malcev presentations for finite Rees index subsemigroups and extensions Journal of the Australian Mathematical Society (to appear), 2007.
  12. C. M. Campbell, M. R. Quick, E. F. Robertson and G. C. Smith (eds.) Groups St Andrews 2005, Volume ILondon Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge 2007.
  13. C. M. Campbell, M. R. Quick, E. F. Robertson and G. C. Smith (eds.) Groups St Andrews 2005, Volume IILondon Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge 2007.
  14. C. A. Carvalho, N. Ruskuc Finite presentability of Bruck-Reilly extensions of semilattices Communications in Algebra (to appear), 2007.
  15. C. A. Carvalho, N. Ruskuc On finite presentability of Bruck-Reilly extensions of a monoid endomorphism and its powers Algebra Colloquium (to appear), 2007.
  16. C. A. Carvalho and N. Ruskuc. A finitely presented monoid with a non-finitely generated group of units Archiv der Mathematik (to appear), 2007.
  17. L. Descalco and N. Ruskuc Properties of the subsemigroups of the bicyclic monoid Czechoslovak Mathematical Journal (to appear), 2007.
  18. Falconer, K.J. and O’Connor, J.J. Symmetry and enumeration of self-similar fractals Bull. London Math. Soc., 39 (2007), 272-282.
  19. A.M. Frisch, M. Grum, C. Jefferson, B. Martinez-Hernandez, I. Miguel The Design of Essence: A Constraint Language for Specifying Combinatorial Problems Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, 80-87, 2007.
  20. P. Gallagher, N. Ruskuc. On finite generation and presentability of Schutzenberger products Journal of the Australian Mathematical Society (to appear), 2007.
  21. I. P. Gent, C. Jefferson, I. Miguel, P. Nightingale. Data Structures for Generalised Arc Consistency for Extensional Constraints Proceedings of the Twenty Second Conference on Artificial Intelligence, 191-197, 2007.
  22. I. P. Gent, T. W. Kelsey, S. A. Linton, J. Pearson, C. M. Roney-Dougal. Groupoids and Conditional SymmetryProceedings of the 13th International Conference on Principles and Practice of Constraint Programming, 2007.
  23. I. P. Gent, P. Nightingale, A. Rowley, K. Stergiou. Solving Quantified Constraint Satisfaction Problems Artificial Intelligence (to appear), 2007.
  24. I. P. Gent, I. Miguel, A. Rendl. Tailoring Solver-independent Constraint Models: A Case Study with Essence’ and Minion Proceedings of the Seventh International Symposium on Abstraction, Reformulation and Approximation (SARA), 184-199, 2007.
  25. I. P. Gent, C. Jefferson, T. Kelsey, I. Lynce, I. Miguel, P. Nightingale, B. M. Smith. Search in the Patience Game “Black Hole” AI Communications 20(3), 2007.
  26. Gray, R., Ruskuc, N. Generators and relations for subsemigroups via boundaries in Cayley graphs submitted.
  27. A. Grayland, I. Miguel, C. Roney-Dougal. Minimal Ordering Constraints for some Families of Variable Symmetries Proceedings of the 7th International Workshop on Symmetry and Constraint Satisfaction Problems (to appear), 2007.
  28. K. Hammond, A. Al Zain, P. Trinder, S. A. Linton, M. Costanti. SymGrid-Par: Designing a Framework for Executing Computational Algebra Systems on Computational Grids International Conference on Computational Science, 2007.
  29. S. Huczynska, N. Ruskuc. Pattern classes of permutations via bijections between linearly ordered sets European Journal of Combinatorics (to appear), 2007.
  30. C. Jefferson, T. W. Kelsey, S. A. Linton, K. Petrie. GAPLex: Generalised Static Symmetry Breaking In F. Benhamou, N. Jussien, B. O’Sullivan (eds), Trends in Constraint Programming, ISTE, 191-205, 2007.
  31. T. W. Kelsey. Los efectos de la radioterapia sobre el ovario y el utero. La opinion de los expertos Actualidades y controversias en ginecologia 36(8), 20-23, 2007.
  32. T. W. Kelsey. The Automated Calculation of Human Ovarian Reserve 9th Argentine Symposium on Artificial Intelligence, 151-162, 2007.
  33. T. W. Kelsey, S. Brett, W. H. B. Wallace, M. Rajkhowa. Does 3D ultrasound measurement improve the assessment of ovarian volume? Proceedings of the 23rd Annual Meeting of the European Society of Human Reproduction and Embryology. Human Reproduction 22(1), 23-25, 2007.
  34. U. Leonhardt. Invisibility Cup. Nature Photonics 1, 207-208, 2007.
  35. U. Leonhardt, T. G. Philbin. Quantum optics of spatial transformation media Journal of Optics A 9, S289-S293, 2007.
  36. U. Leonhardt, T. G. Philbin. Quantum levitation by left-handed metamaterials New Journal of Physics 9, 254, 2007.
  37. S. A. Linton, B. Assmann. Using the Mal’cev Correspondence for Collection in Polycyclic Groups Journal of Algebra 316(2), 828-848, 2007.
  38. J. D. Mitchell, Y. Peresse, M. R. Quick. Sequences of Functions as Compositions Quarterly Journal of Mathematics 58(1), 71-79, 2007.
  39. Murray, S.H. and Roney-Dougal, C.M. The spinor norm and homomorphism algorithms for classical groupsSubmitted.
  40. M. R. Quick. Maximal Complements in Finite Groups Communications in Algebra 35(4), 1263-1273, 2007.
  41. M. R. Quick. Groups with Virtually Abelian Proper Quotients Journal of the London Mathematical Society 75(3), 597-609, 2007.
  42. V. Vatter. Enumeration schemes for restricted permutations Combinatorics, Probability and Computing (to appear), 2007.
  43. V. Vatter. Reconstructing compositions Discrete Mathematics (to appear), 2007.

2006

  1. Nik Ruškuc, A.J. Cain and E.F. Robertson, Subsemigroups of virtually free groups: finite Malcev presentations and testing for freeness, Math. Proc. Cambridge Philos. Soc. 141 (2006), 57-66.
  2. Nik Rušskuc, A.J. Cain and E.F. Robertson, Subsemigroups of groups: presentations, Malcev presentations, and automatic structures, J. Group Theory 9 (2006), 397-426.
  3. Nik Ruškuc, P.M. Higgins, J.D. Mitchell and M. Morayne, On rank properties of endomorphisms of countably infinite partially ordered sets, Bull. London Math. Soc. 38 (2006), 177-191.
  4. Miguel, S. Prestwich. Proceedings of the Fifth International Workshop on Constraint Modelling and Reformulation, Nantes, France, 2006.
  5. K.N. Brown, I. Miguel. Uncertainty and Change. in F. Rossi, P. van Beek, T. Walsh (eds), The Handbook of Constraint Programming, 2006.
  6. A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh. Propagation Algorithms for Lexicographic Ordering Constraints. Artificial Intelligence 170(10), 803-834, 2006.
  7. Colin Campbell, P. P. Campbell The Fibonacci lengths of binary polyhedral groups and related groups, Applications of Fibonacci Numbers 10 , Kluwer, (Dordrecht, 2006), 83-91.
  8. Martyn Quick, “Probabilistic generation of wreath products of non-abelian finite simple groups, II,” Internat. J. Algebra Comput. 16 (2006), no. 3, 493-503.
  9. S. Huczynska and V. Vatter “Grid classes and the Fibonacci dicotomy for restricted permutations”, The Electronic Journal of Combinatorics 13 (2006), no.1.
  10. S.Huczynska and G.L.Mullen “Frequency permutation arrays”, Journal of Combinatorial Designs 14 (2006), 463–478.
  11. V. Vatter, Bruce Sagan The Möbius function of a composition poset  Journal of Algebraic Combinatorics, 24 (006), 117.136.
  12. V. Vatter Finitely labeled generating trees and restricted permutations Journal of Symbolic Computation, 41(2006), 559.572.
  13. V. Vatter, Bruce Sagan Maximal and maximum independent sets in graphs with at most r cycles  Journal of Graph Theory, 53 (2006), 283.314.
  14. V.Vatter, Goh Chee Ying, Koh Khee Meng, and Bruce Sagan Maximal independent sets in graphs with at most r cycles Journal of Graph Theory, 53 (2006), 270.282.
  15. Brignall, R., Wreath products of permutation classes.
  16. Brignall, R., Ruškuc, N., and Vatter, V., Simple permutations: decidability and unavoidable substructures.
  17. A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh. Propagation Algorithms for Lexicographic Ordering Constraints. Artificial Intelligence 170(10), 803-834, 2006.
  18. C. Jefferson, A. Miguel, I. Miguel, A. Tarim. Modelling and Solving English Peg Solitaire. Computers and Operations Research 33(10), pages 2935-2959, 2006.
  19. J. Charnley, S. Colton, I. Miguel. Automatic Generation of Implied Constraints. Proceedings of the Seventeenth European Conference on Artificial Intelligence, 73-77, 2006.
  20. I.P. Gent, C. Jefferson, I. Miguel. Minion: A Fast, Scalable Constraint Solver. Proceedings of the Seventeenth European Conference on Artificial Intelligence, 98-102, 2006. This was judged by the chairs to be one of the ten best papers submitted to the conference. Click for more information on the Minion Constraint Solver.
  21. I.P. Gent, C. Jefferson, I. Miguel. Watched Literals for Constraint Propagation in Minion. Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming, 182-197, 2006.
  22. Karen Petrie, Tom Kelsey, Steve Linton, Chris Jefferson GAPlex Generalised Static Symmetry Breaking Proceedings of the Sixth International Workshop on Symmetry in Constraint Satisfaction Problems 2006

2005

  1. Albert, M H, Linton S A and Ruskuc, N: The Insertion Encoding of Permutations, Electron. J. Combinat. 12, R47.
  2. Araujo, J and Mitchell, J D: ‘An elementary proof that every singular nxn matrix is a product of idempotents’, Amer. Math. Monthly 112 (2005) 641-645.
  3. Bartlett, M, Frisch, A M , Hamadi, Y, Miguel, I, Tarim, S A and Unsworth C: The Temporal Knapsack Problem and Its Solution. Proceedings of the 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), 34-48, 2005.
  4. Campbell, C M and Campbell, P P: The Fibonacci length of certain centro-polyhedral groups, J. Appl. Math. Comput. 19, 231 – 240.
  5. Descalco, L and Ruskuc, N: Subsemigroups of the bicyclic monoid, Internat. J. Algebra Comput. 15, 37-57.
  6. Dombi, E R, Gilbert, N D and Ruskuc, N: Finite presentability of HNN extensions of inverse semigroups, Internat. J. Algebra Comput. 15, 423-436.
  7. Frisch, A M, Hnich, B, Miguel, I, Smith, B M and Walsh, T: Transforming and Refining Abstract Constraint Specifications. Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation (SARA)LNAI 3607, 76-91, 2005
  8. Frisch, A M, Jefferson, C, Martinez-Hernandez, B and Miguel, I: The Rules of Constraint Modelling. Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 109-116, 2005.
  9. Frisch, A M, Grum, M, Jefferson, C, Martinez-Hernandez, B and Miguel, I: The Essence of ESSENCE: A Constraint Language for Specifying Combinatorial Problems. Proceedings of the 4th International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, 73-88, 2005
  10. Frisch, A M, Jefferson, C, Martinez-Hernandez, B and Miguel, I: The Rules of Constraint Modelling: An Overview. Proceedings of the 12th Workshop on Automnated Reasoning, 2005
  11. Gallagher, P and Ruskuc, N: Finitary power semigroups of infinite groups are not finitely generated, Bull. London Math. Soc. 37, 386-390.
  12. Gallagher, P and Ruskuc, N: Generation of diagonal acts of some semigroups of transformations and relations, Bull. Austral. Math. Soc. 72, 139-146.
  13. Gent, I P, Kelsey, T, Linton, S A, McDonald, I, Miguel, I and Smith, B M: Conditional Symmetry Breaking. Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), 256-270, Springer Verlag. 2005
  14. Gent, I P, Kelsey, T, Linton, S A, Roney-Dougal, C M: Symmetry and Consistency.Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP 2005) 271-285. Springer Verlag. 2005
  15. Gent, I P, Nightingale, P, and Stergiou, K: QCSP-Solve: A solver for quantified constraint satisfaction problems.Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 138-143, 2005.
  16. Gent, I P and Rowley, A G D: Local and global complete solution learning methods for QBF. Lecture Notes in Computer Science 3569, 91-106. Springer, 2005.
  17. Gottliebsen, H, Kelsey, T, Martin, U: Hidden Verification for Computational Mathematics  Journal of Symbolic Computation, pp 539-567. 2005.
  18. Havas, G and Robertson, E F: The F^{a,b,c} Conjecture, I, Irish Math. Soc. Bulletin 56 75-80, 2005.
  19. Kahrobaei, D: A Simple Proof of a Theorem of Karrass and Solitar Contemporary Mathematics372 107-108, 2005
  20. Kahrobaei, D, Bhutani, K and Khan, B: A Graphic Generalization of Arithmetic Electronic Journal of Combinatorial Number Theory. 2005
  21. Miguel, I and Shen, Q: Exhibiting the Behaviour of Time-Delayed Systems via an Extension to Qualitative Simulation IEEE Transactions on Systems, Man and Cybernetics (Part A) 35(2), 298-305, 2005
  22. O’Connor, J J and Robertson, E F: The MacTutor History of Mathematics Archive. http://www-history.mcs.st-and.ac.uk/history/
  23. Roney-Dougal, C M: The primitive groups of degree less than 2500., J.Algebra. 292, 154-183.
  24. Roney-Dougal, C and Holt, D: Constructing maximal subgroups of classical groups. LMS Journal of Computational Mathematics8, (2005) 46-79.
  25. Tarim, S A and Miguel, I: A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse. Proceedings of the CSCLP 2005: Joint Annual Workshop on ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, 148-162, 2005
  26. Wallace, W H, Thomson, A B, Saran, F and Kelsey, T W: Predicting Age of Ovarian Failure After Radiation to a Field that Includes the Ovaries.  International Journal of Radiation Oncology*Biology*Physics 62, 3, pp 738-744. 2005.


2004

  1. Banks, D, Linton, S A, Stockmeyer, P: Counting Cases in Substitope Algorithms IEEE Transactions on Visualization and Computer Graphics 10, 4, pp 371-384. 2004.
  2. Boulton, R J, Gottliebsen, H, Hardy, R, Kelsey, T W, and Martin, U: Design Verification for Control Engineering.  Lecture Notes in Computer Science 2999, Proc. 4th International Conference on Integrated Formal Methods (IFM 2004), Canterbury, UK, pp 21-35. Springer, 2004.
  3. Brooksbank, P, Qin, H, Robertson, E F and Seresse, A: On Dowling geometries of Infinite groups. Journal of Combinatorial Theory Series A108, 155-158
  4. Campbell, C M and Campbell, P P: On the minimal length of semigroup presentations, Novi Sad Journal of Mathematics 34, 17-26.
  5. Campbell, C M, Campbell, P P, Doostie, H and Robertson, E F: Fibonacci lengths for certain metacyclic groups, Algebra Colloquium 11, 215-222.
  6. Campbell, C M, Campbell, P P, Doostie, H and Robertson, E F: On the Fibonacci length of powers of dihedral groups, Applications of Fibonacci Numbers 9, 69-85, (ed F T Howard), Kluwer, Dordrecht.
  7. Campbell, C M, Havas, G, Ramsay, C and Robertson, E F: Nice efficient presentations for all small simple groups and their covers, LMS Journal of Computational Mathematics 7, 266-283.
  8. Delgado, M, Linton, S A, Morais, J: Automata.  gap-system.org. 2004.
  9. Frisch, A M, Jefferson, C and Miguel, I: Symmetry breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern. Proceedings of the 16th European Conference on Artificial Intelligence, pages 171-175, 2004.
  10. Frisch, A M, Jefferson, C, Martinez-Hernandez, B and Miguel I: Generating Effective Constraint Programs: An Application of Automated Reasoning. Proceedings of the 11th Workshop on Automated Reasoning, 2004.
  11. Frisch, A M, Jefferson, C, Martinez-Hernandez, B and Miguel I: The Rules of Modelling: Towards Automatic Generation of Constraint Programs. Proceedings of the 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, 2004.
  12. Gent, I P and Rowley, A G D: Encoding Connect-4 using Quantified Boolean Formulae.Proc.of the 2nd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Kinsale, Ireland, Frisch, AM (ed), pp 78-93. 2004.
  13. Gent, I P, McDonald, I, Miguel, I and Smith, B M: Approaches to Conditional Symmetry Breaking. Proceedings of the 4th International Workshop on Symmetry and Constraint Satisfaction Problems, 2004.
  14. Gent, I P, Nightingale, P and Rowley, A G D: Encoding Quantified CSPs as Quantified Boolean Formulae. Proc. 16th European Conference on Artificial Intelligence (ECAI 2004), Valencia, Spain. 2004.
  15. Gent, I P and Nightingale, P: A New Encoding of AllDifferent into SAT.  Proc. 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, CP2004, Toronto, Canada, Frisch, AM, Miguel, I (eds). 2004
  16. Hnich, B, Kiziltan, Z, Miguel, I and Walsh, T: Hybrid Modelling for Robust Solving. Annals of Operations Research 130 (1-4), pages 19-39, 2004.
  17. Kelsey, T, Linton, S A, Roney-Dougal, C M: New Developments in Symmetry Breaking in Search Using Computational Group Theory. Proc. 7th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2004). Springer LNAI. 2004.
  18. Linton, S A: Finding the Smallest Image of a Set. Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC 2004), Santander, Spain. 2004.
  19. Miguel, I: Dynamic Flexible Constraint Satisfaction and its Application to AI Planning. Springer Distinguished Dissertations Series, 2004.
  20. O’Connor, J J and Robertson, E F: Isaac Barrow and William Ernest Johnson Biographical Dictionary of British Economists, (ed D Rutherford), Thoemmes Continuum.
  21. O’Connor, J J and Robertson, E F: Obituary: David Allan Spence, Australian Mathematical Society Gazette31(1), 58-59.
  22. Quick, M: Probabilistic generation of wreath products of non-abelian finite simple groups, Communications in Algebra 32, 4753-4768.
  23. Roney-Dougal, C M, Gent, I P, Kelsey, T W, and Linton, S A: Tractable Symmetry Breaking using Restricted Search Trees. Proc. 16th European Conference on Artificial Intelligence (ECAI 2004), Valencia, Spain. 2004.
  24. Smith, B M, Petrie, K E and Gent I P: Models and Symmetry Breaking for Peaceable Armies of Queens. Proc. International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’04), Nice, France. 2004.
  25. Tarim, S A and Miguel, I: Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem. Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR)LNCS 3011, 2004.
  26. Wallace, W H B, Kelsey, T W: Ovarian Reserve and Reproductive Age may be Determined from Measurement of Ovarian Volume by Transvaginal Sonography. Human Reproduction 19, 7, pp 1-6. 2004.

2003

  1. Albert, M H, Atkinson, M D and Ruskuc, N: Regular closed sets of permutations, Theoret. Comput. Sci. 306(2003), no. 1-3, 85-100.
  2. Aroujo, J, Mitchell, J D and Silva, N: On embedding countable sets of endomorphisms, Algebra Universalis  50(1) (2003), 61-67.
  3. Banks, D and Linton, S A: Counting Cases in Marching Cubes: Toward a Generic Algorithm for Producing Substitopes, Best Paper at IEEE Visualization 2003, proceedings released on DVD by the IEEE, 2003.
  4. Campbell, C M, Campbell, P P, Hopson, B T K and Robertson, E F: On the efficiency of direct powers of PGL(2,p), Recent advances in group theory and low-dimensional topology (Pusan, 2000), 27-34, Res. Exp. Math. 27, Heldermann, Lemgo, 2003.
  5. Campbell, C M, Havas, G, Hulpke, A and Robertson, E F: Efficient simple groups, Comm. Algebra 31 (2003), no. 10, 5191-5197.
  6. Campbell, C M, Robertson, E F and Smith, G C (editors), Groups St Andrews 2001 in Oxford, Volume 1, London Mathematical Society 304, Cambridge University Press, Cambridge (2003).
  7. Campbell, C M, Robertson, E F and Smith, G C (editors), Groups St Andrews 2001 in Oxford, Volume 2, London Mathematical Society 305, Cambridge University Press, Cambridge (2003).
  8. Cohen, S D and Huczynska, S: Primitive free quartics with specified norm and trace, Acta Arith. 109 (2003), no. 4, 359-385.
  9. Cohen, S D and Huczynska, S: The primitive normal basis theorem – without a computer, J. London Math. Soc.(2) 67 (2003), no. 1, 41-56.
  10. Elder, M J: The loop shortening property and almost convexity. Geom. Dedicata 102 (2003), 1-18.
  11. Elder, M J: Patterns theory and geodesic automatic structure for a class of groups,  Internat. J. Algebra Comput.13 (2003), no. 2, 203-230.
  12. Elder, M J, McCammond, J and Meier, J: Combinatorial conditions that imply word-hyperbolicity for 3-manifolds, Topology 42 (2003), no. 6, 1241-1259.
  13. Gent, I P, Harvey, W, Kelsey, T W and Linton, S A: Generic SBDD Using Computational Group Theory, In Principles and Practice of Constraint Programming – CP 2003, volume 2833 in Lecture Notes in Computer Science, pages 333-347, Springer-Verlag, 2003.
  14. Havas, G and Robertson, E F: Irreducible cyclic presentations of the trivial group, Experimental Mathematics 12(2003), no. 4, 478-490.
  15. Higgins, P M, Howie, J M, Mitchell, J D and Ruskuc, N: Countable versus uncountable ranks in infinite semigroups of transformations and relations, Proc. Edinb. Math. Soc. (2) 46 (2003), no. 3, 531-544.
  16. Higgins, P M, Howie, J M and Ruskuc, N: Set products in transformation semigroups, Proc. Roy. Soc. Edinburgh, Section A 133 (2003), 1121-1135.
  17. Higgins, P M, Mitchell, J D and Ruskuc, N: Generating the full transformation semigroup using order preserving mappings, Glasg. Math. J. 45 (2003), no. 3, 557-566.
  18. Holmes, P E, Linton, S A and Murray, S H: Product replacement in the Monster, Experiment. Math. 12 (2003), no. 1, 123-126.
  19. Huczynska, S and Cohen, S D: Primitive free cubics with specified norm and trace, Trans. Amer. Math. Soc. 355(2003), no. 8, 3099-3116
  20. Hulpke, A and Linton, S A: Total Ordering on Subgroups and Cosets, In Proceedings of International Symposium on Symbolic and Algebraic Computation, 2003, pages 156 – 160, ACM Press, Philadelphia, 2003.
  21. O’Connor J J and Robertson, E F: The life of Johann Benedict Listing, Strabismus 11 (4) (2003), 247-250.
  22. Parker, C W and Quick, M: Maximal complements in wreath products, J. Algebra 266 (2003), 320-337.
  23. Quick, M: Finitely based varieties of pointed-groups, Arch. Math. 81 (2003), 614-620.
  24. Robertson, E F, Ruskuc, N and Thomson, M R: Finite generation and presentability of wreath products of monoids, J. Algebra 266 (2003), no. 2, 382-392.
  25. Roney-Dougal, C M: Affine groups with two self-paired orbitals, Comm. Algebra 31 (2003), no. 9, 4359-4370.
  26. Roney-Dougal, C M and Unger, W R: The affine primitive permutation groups of degree less than 1000, J. Symbolic Comput. 35 (2003), no. 4, 421-439.


2002

  1. Campbell, C M, Havas, G, Hulpke A and Robertson E F: The simple group L3(5) is efficient, Comm. Alg. 30(2002), 971-975.
  2. Campbell, C M, Mitchell J D and Ruskuc, N: Comparing semigroup and monoid presentations for finite monoids, Monatshefte für Mathematik 134 (2002), 287-293.
  3. Campbell, C M, Robertson, E F, Ruskuc, N and Thomas, R M: Automatic completely-simple semigroups, Acta Math. Hungar. 96 (2002), 201-215.
  4. Campbell, C M, Mitchell J D and Ruskuc, N: On defining groups efficiently without using inverses, Math. Proc. Cambridge Philos. Soc. 133 (2002), 31-36.
  5. Campbell, C M, Havas, G, Hulpke, A and Robertson, E F: Efficient simple groups, Comm. Algebra 30 (2002), 4613-4619.
  6. Descalco, L and Ruskuc, N: On automatic Rees matrix semigroups, Comm. Algebra 30 (2002), 1207-1226.
  7. Hoffmann, M, Thomas, R M and Ruskuc, N: Automatic semigroups with subsemigroups of finite Rees index, Internat. J. Algebra Comput. 12 (2002), 463-476.
  8. Linton, S A, Pfeiffer, G, Robertson, E F and Ruskuc, N: Computing transformation semigroups, J. Symbolic Comput. 33 (2002), 145-162.
  9. Linton, S A and Sebastiani, R (Eds): Special Issue on the Integration of Automated Reasoning and Computer Algebra Systems Journal of Symbolic Computation (4) 34 (October 2002).
  10. Robertson, E F, Ruskuc, N and Thomson, M R: On finite generation and other finiteness conditions for wreath products of semigroups, Comm. Algebra 30 (2002), 3851-3873.


2001

  1. Araujo, I M and Ruskuc, N: Finite presentability of Bruck-Reilly extensions of groups, J. Algebra242 (2001), 20-30.
  2. Araujo, I M, Branco, M J J, Fernandes, V H, Gomes, G M S and Ruskuc, N: On generators and relations for unions of semigroups, Semigroup Forum63 (2001), 49-62.
  3. Campbell, C M, Robertson, E F, Ruskuc, N and Thomas, R M: Automatic semigroups, Theoret. Comput. Sci.250 (2001), 365-391.
  4. Crvenkovic, S, Dolinka, I and Ruskuc N: Finite semigroups with few term operations, J. Pure Appl. Algebra,157 (2001), 205-214.
  5. Crvenkovic, S, Dolinka, I and Ruskuc N: The Berman conjecture is true for finite surjective semigroups and their inflations, Semigroup Forum62 (2001), 103-114.
  6. Otto, F and Ruskuc, N: Confluent monadic string-rewriting systems and automatic structures, J. Autom. Lang. Combinat., 6 (2001), 375-388.
  7. Robertson, E F, Ruskuc, N and Thomson, M R: On diagonal acts of monoids, Bull. Austral. Math. Soc. 63 (1) (2001), 167-175.


2000

  1. Araujo, I M and Ruskuc, N: On finite presentability of direct products of semigroups, Algebra Colloquium, 7(2000), 83-91.
  2. Arthur, R E and Ruskuc, N: Presentations for two extensions of the monoid of order-preserving mappings on a finite chain, Southeast Asian Bulletin of Mathematics24 (2000), 1-7.
  3. Atkinson, M D, Gilbert, N, Howie, J, Linton, S A and Robertson, E F: Computational and geometric aspects of modern algebra, Cambridge University Press, Cambridge, 2000.
  4. Ayik, H, Campbell, C M, O’Connor, J J and Ruskuc, N: On the efficiency of wreath products of groups, Proc. Groups Korea ’98 (eds.Y G Baik, D L Johnson and A C Kim. Walter de Gruyter, Berlin New York 2000), 39-51.
  5. Ayik, H, Campbell, C M, O’Connor, J J and Ruskuc, N: On the efficiency of finite simple semigroups, Turkish J. Math. 24 (2000), 129-146.
  6. Ayik, H, Campbell, C M, O’Connor, J J and Ruskuc, N: The semigroup efficiency of direct powers of groups, Proc. Internat. Conf. on Semigroups, Braga, Portugal 18-23 June 1999 (eds, Paula Smith, Emilia Giraldes and Paula Martins, World Scientific, Singapore 2000), 19-25.
  7. Ayik, H, Campbell, C M, O’Connor, J J. and Ruskuc, N: Minimal presentations and efficiency of semigroups, Semigroup Forum 60 (2000), 231-242.
  8. Campbell, C M, Robertson, E F, Ruskuc, N and Thomas, R M: Direct products of automatic semigroups, J. Austral. Math. Soc. Ser. A  69 (2000), 19-24.
  9. Crvenkovic, S, Dolinka, I and Ruskuc, N: Notes on the number of operations of finite semigroups, Acta Scientiarum Mathematicarum (Szeged)66 (2000), 23-31.
  10. Doostie, H and Campbell, C M: Fibonacci length of automorphism groups involving Tribonacci numbers, Vietnam J. Math. 28 (2000), 57-66.
  11. Ruskuc, N: On finite presentability of monoids and their Schutzenberger groups, Pacific Journal of Mathematics,195 (2000), 487-509.
  12. Ruskuc, N: Presentations for monoids, their maximal subgroups, and Schutzenberger groups, Algorithmic Problems in Groups and Semigroups (eds. J.-C. Birget et al.), Birkhauser, Boston (2000), 235-249.