Dr Patrick Prosser

  • Senior Lecturer (Computing Science)

telephone: 01413304934
email: Patrick.Prosser@glasgow.ac.uk

Research interests

Personal site: http://www.dcs.gla.ac.uk/~pat/

Biography:
Patrick Prosser is a Senior Lecturer, and has degrees in Computer Science from Strathclyde University. Patrick has worked at the National Engineering Laboratory, Burroughs, Alcan Plate, and Britoil (formally BNOC). As an academic he has worked with BT, Alcan, YARD, ILOG, Pirelli, Tollpost Globe and SINTEF. Patrick is a member of the Formal Analysis, Theory and Algorithms research group and in 2011 received the ACP award for research excellence in constraint programming http://4c.ucc.ie/a4cp/

Research Interests:
- Constraint Programming
- Combinatorial Search
- Optimisation Problem
- Heuristics
- Algorithms and Complexity

Supervision

Publications

List by: Type | Date

Jump to: 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001
Number of items: 42.

2017

McCreesh, C., Prosser, P. and Trimble, J. (2017) A Partitioning Algorithm for Maximum Common Subgraph Problems. In: 26th International Joint Conference on Artificial Intelligence (IJCAI'17), Melbourne, Australia, 19-25 Aug 2017, (Accepted for Publication)

2016

McCreesh, C., Ndiaye, S. N., Prosser, P. and Solnon, C. (2016) Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. In: CP2016: The 22nd International Conference on Principles and Practice of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 350-368. ISBN 9783319449524 (doi:10.1007/978-3-319-44953-1_23)

McCreesh, C., Prosser, P. and Trimble, J. (2016) Morphing Between Stable Matching Problems. In: CP 2016: 22nd International Conference on Principles and Practices of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 832-840. ISBN 9783319449524 (doi:10.1007/978-3-319-44953-1_52)

Cano, J., White, D. R., Bordallo, A., McCreesh, C., Prosser, P., Singer, J. and Nagarajan, V. (2016) Task Variant Allocation in Distributed Robotics. In: Robotics Science and Systems 2016, Ann Arbor, MI, USA, 18-22 June 2016, (doi:10.15607/RSS.2016.XII.045)

McCreesh, C., Prosser, P. and Trimble, J. (2016) Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. In: 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York, NY, USA, 9-15 July 2016, pp. 631-638. ISBN 9781577357704

2015

Macdonald, C., McCreesh, C., Miller, A. and Prosser, P. (2015) Constructing sailing match race schedules: round-robin pairing lists. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 671-686. ISBN 9783319232188 (doi:10.1007/978-3-319-23219-5_46)

McCreesh, C. and Prosser, P. (2015) A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 295-312. ISBN 9783319232188 (doi:10.1007/978-3-319-23219-5_21)

McCreesh, C. and Prosser, P. (2015) A parallel branch and bound algorithm for the maximum labelled clique problem. Optimization Letters, 9(5), pp. 949-960. (doi:10.1007/s11590-014-0837-4)

McCreesh, C. and Prosser, P. (2015) The shape of the search tree for the maximum clique problem, and the implications for parallel branch and bound. ACM Transactions on Parallel Computing, 2(1), 8. (doi:10.1145/2742359)

2014

McCreesh, C. and Prosser, P. (2014) Exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem. In: 11th International Conference, CPAIOR 2014, Cork, Ireland, 19-23 May 2014, pp. 226-234. ISBN 9783319070452 (doi:10.1007/978-3-319-07046-9_16)

McCreesh, C. and Prosser, P. (2014) Reducing the branching in a branch and bound algorithm for the maximum clique problem. In: 20th International Conference, CP 2014, Lyon, France, 8-12 Sep 2014, pp. 549-563. ISBN 9783319104270 (doi:10.1007/978-3-319-10428-7_40)

Prosser, P. (2014) Stable roommates and constraint programming. In: 11th International Conference, CPAIOR 2014, Cork, Ireland, 19-23 May 2014, pp. 15-28. ISBN 9783319070452 (doi:10.1007/978-3-319-07046-9_2)

Prosser, P. (2014) Teaching constraint programming. In: 20th International Conference, CP 2014, Lyon, France, 8-12 Sep 2014, p. 3. ISBN 9783319104270 (doi:10.1007/978-3-319-10428-7_2)

2013

Mancy, R., Prosser, P. and Rogers, S. (2013) Discrete and continuous time simulations of spatial ecological processes predict different final population sizes and interspecific competition outcomes. Ecological Modelling, 259, pp. 50-61. (doi:10.1016/j.ecolmodel.2013.03.013)

Codish, M., Miller, A. , Prosser, P. and Stuckey, A. (2013) Breaking symmetries in graph representation. In: International Joint Conference on Artificial Intelligence, Beijing, China, 3-9 Aug 2013,

McCreesh, C. and Prosser, P. (2013) Multi-threading a state-of-the-art maximum clique algorithm. Algorithms, 6(4), pp. 618-635. (doi:10.3390/a6040618)

2012

McCreesh, C. and Prosser, P. (2012) Distributing an Exact Algorithm for Maximum Clique: Maximising the Costup. Technical Report. School of Computing Science, University of Glasgow.

Miller, A. and Prosser, P. (2012) Diamond-free degree sequences. Acta Universitatis Sapientiae, Informatica, 4(2), pp. 189-200.

Prosser, P. (2012) Exact algorithms for maximum clique: a computational study. Algorithms, 5(4), pp. 545-587. (doi:10.3390/a5040545)

Prosser, P. (2012) Exact Algorithms for Maximum Clique: A Computational Study. Technical Report. School of Computing Science, University of Glasgow.

2011

Prosser, P. and Unsworth, C. (2011) Limited discrepancy search revisited. Journal of Experimental Algorithmics, 16, Article 1.6. (doi:10.1145/1963190.2019581)

2010

Prosser, P. (2010) Triangle packing with constraint programming. In: 9th International Workshop on Constraint Modelling and Reformulation (ModRef 2010), St. Andrews. U.K, 06 - 10 Sep 2010, pp. 88-102.

2008

Moore, N.C.A. and Prosser, P. (2008) The ultrametric constraint and its application to phylogenetics. Journal of Artificial Intelligence Research, 32, pp. 901-938. (doi:10.1613/jair.2580)

Cockshott, P., Koltes, A., O'Donnell, J., Prosser, P. and Vanderbauwhede, W. (2008) A hardware relaxation paradigm for solving NP-hard problems. In: Abramsky, S., Gelenbe, E. and Sassone, V. (eds.) Visions of Computer Science: BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008. BCS: Swindon, UK, pp. 75-86.

2007

Manlove, D.M., O'Malley, G., Prosser, P. and Unsworth, C. (2007) A constraint programming approach to the hospitals/residents problem. In: Proceedings of CP-AI-OR '07: the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Brussels, Belgium, 23-26 May, 2007, pp. 155-170. (doi:10.1007/978-3-540-72397-4_12)

2006

Beck, J., Prosser, P. and Selensky, E. (2006) A case study of mutual routing-scheduling reformulation. Journal of Scheduling, 9, pp. 469-491. (doi:10.1007/s10951-006-8596-4)

Prosser, P. (2006) A case study of mutual scheduling-routing reformulation. Journal of Scheduling (volume 9), pp. 469-491.

Prosser, P. and Unsworth, C. (2006) Rooted Tree and Spanning Tree Constraints. Other. Dept of Computing Science, University of Glasgow.

Prosser, P. and Unsworth, C. (2006) A connectivity constraint using bridges. In: Brewka, G. (ed.) ECAI 2006: 17th European Conference on Artificial Intelligence, August 29-September 1, 2006, Riva del Garda, Italy. Series: Frontiers in artificial intelligence and applications (141). IOS Press: Amsterdam, The Netherlands, pp. 707-708. ISBN 9781586036423

2005

Unsworth, C. and Prosser, P. (2005) A specialised binary constraint for the stable marriage problem. Lecture Notes in Computer Science, 3607, pp. 218-233. (doi:10.1007/11527862_16)

Beck, J.C., Prosser, P. and Wallace, R.J. (2005) Trying again to fail-first. Lecture Notes in Computer Science, 3419, pp. 41-55. (doi:10.1007/11402763_4)

Miller, A., Prosser, P. and Unsworth, C. (2005) A constraint model and a reduction operator for the minimising open stacks problem. In: Constraint Modelling Challenge 2005, in Conjunction with The Fifth Workshop on Modelling and Solving Problems with Constraints Held at IJCAI 2005, Edinburgh, Scotland, 31 Jul 2005. School of Computer Science, University of St. Andrews: St. Andrews, UK, pp. 44-50.

Unsworth, C. and Prosser, P. (2005) Specialised constraints for stable matching problems. Principles and Practice of Constraint Programming: Cp 2005, Proceedings, 3709, p. 869.

2004

Beck, J.C., Prosser, P. and Wallace, R.J. (2004) Failing first: an update. In: Lopez de Mantaras, R. and Saitta, L. (eds.) ECAI 2004: Proceedings of the 16th European Conference on Artificial Intelligence. Series: Frontiers in artificial intelligence and applications (110). IOS Press: Amsterdam, The Netherlands, pp. 959-960. ISBN 9781586034528

Beck, J.C., Prosser, P. and Wallace, R.J. (2004) Trying again to fail-first. In: CSCLP 2004: Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, Lausanne, Switzerland, 23-25 June 2004, pp. 41-55.

Beck, J.C., Prosser, P. and Wallace, R.J. (2004) Variable ordering heuristics show promise. Principles and Practice of Constraint Programming: Cp 2004, Proceedings, 3258, pp. 711-715.

Gregory, P., Miller, A. and Prosser, P. (2004) Solving the rehearsal problem with planning and with model checking. In: Workshop on Modelling and Solving Problems with Constraints, Valencia, Spain, 22 Aug 2004, pp. 157-171.

2003

Prosser, P. and Selensky, E. (2003) A study of encodings of constraint satisfaction problems with 0/1 variables. Lecture Notes in Computer Science, 2627, pp. 337-381.

Gent, I.P., Prosser, P., Smith, B.M. and Wei, W. (2003) Supertree construction with constraint programming. Principles and Practice of Constraint Programming: Cp 2003, Proceedings, 2833, pp. 837-841.

2002

Beck, J.C., Prosser, P. and Selensky, E. (2002) Graph transformations for the vehicle routing and job shop scheduling problems. Lecture Notes in Computer Science, 2502, pp. 60-74.

Beck, J.C., Prosser, P. and Selensky, E. (2002) On the reformulation of vehicle routing problems and scheduling problems. Lecture Notes in Computer Science, 2371, pp. 282-289.

2001

Prosser, P. (2001) Random constraint satisfaction: flaws and structure. Constraints, 6(4), pp. 345-372. (doi:10.1023/A:1011454308633)

This list was generated on Sun Jun 25 21:46:28 2017 BST.
Number of items: 42.

Articles

McCreesh, C. and Prosser, P. (2015) A parallel branch and bound algorithm for the maximum labelled clique problem. Optimization Letters, 9(5), pp. 949-960. (doi:10.1007/s11590-014-0837-4)

McCreesh, C. and Prosser, P. (2015) The shape of the search tree for the maximum clique problem, and the implications for parallel branch and bound. ACM Transactions on Parallel Computing, 2(1), 8. (doi:10.1145/2742359)

Mancy, R., Prosser, P. and Rogers, S. (2013) Discrete and continuous time simulations of spatial ecological processes predict different final population sizes and interspecific competition outcomes. Ecological Modelling, 259, pp. 50-61. (doi:10.1016/j.ecolmodel.2013.03.013)

McCreesh, C. and Prosser, P. (2013) Multi-threading a state-of-the-art maximum clique algorithm. Algorithms, 6(4), pp. 618-635. (doi:10.3390/a6040618)

Miller, A. and Prosser, P. (2012) Diamond-free degree sequences. Acta Universitatis Sapientiae, Informatica, 4(2), pp. 189-200.

Prosser, P. (2012) Exact algorithms for maximum clique: a computational study. Algorithms, 5(4), pp. 545-587. (doi:10.3390/a5040545)

Prosser, P. and Unsworth, C. (2011) Limited discrepancy search revisited. Journal of Experimental Algorithmics, 16, Article 1.6. (doi:10.1145/1963190.2019581)

Moore, N.C.A. and Prosser, P. (2008) The ultrametric constraint and its application to phylogenetics. Journal of Artificial Intelligence Research, 32, pp. 901-938. (doi:10.1613/jair.2580)

Beck, J., Prosser, P. and Selensky, E. (2006) A case study of mutual routing-scheduling reformulation. Journal of Scheduling, 9, pp. 469-491. (doi:10.1007/s10951-006-8596-4)

Prosser, P. (2006) A case study of mutual scheduling-routing reformulation. Journal of Scheduling (volume 9), pp. 469-491.

Unsworth, C. and Prosser, P. (2005) A specialised binary constraint for the stable marriage problem. Lecture Notes in Computer Science, 3607, pp. 218-233. (doi:10.1007/11527862_16)

Beck, J.C., Prosser, P. and Wallace, R.J. (2005) Trying again to fail-first. Lecture Notes in Computer Science, 3419, pp. 41-55. (doi:10.1007/11402763_4)

Unsworth, C. and Prosser, P. (2005) Specialised constraints for stable matching problems. Principles and Practice of Constraint Programming: Cp 2005, Proceedings, 3709, p. 869.

Beck, J.C., Prosser, P. and Wallace, R.J. (2004) Variable ordering heuristics show promise. Principles and Practice of Constraint Programming: Cp 2004, Proceedings, 3258, pp. 711-715.

Prosser, P. and Selensky, E. (2003) A study of encodings of constraint satisfaction problems with 0/1 variables. Lecture Notes in Computer Science, 2627, pp. 337-381.

Gent, I.P., Prosser, P., Smith, B.M. and Wei, W. (2003) Supertree construction with constraint programming. Principles and Practice of Constraint Programming: Cp 2003, Proceedings, 2833, pp. 837-841.

Beck, J.C., Prosser, P. and Selensky, E. (2002) Graph transformations for the vehicle routing and job shop scheduling problems. Lecture Notes in Computer Science, 2502, pp. 60-74.

Beck, J.C., Prosser, P. and Selensky, E. (2002) On the reformulation of vehicle routing problems and scheduling problems. Lecture Notes in Computer Science, 2371, pp. 282-289.

Prosser, P. (2001) Random constraint satisfaction: flaws and structure. Constraints, 6(4), pp. 345-372. (doi:10.1023/A:1011454308633)

Book Sections

Cockshott, P., Koltes, A., O'Donnell, J., Prosser, P. and Vanderbauwhede, W. (2008) A hardware relaxation paradigm for solving NP-hard problems. In: Abramsky, S., Gelenbe, E. and Sassone, V. (eds.) Visions of Computer Science: BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008. BCS: Swindon, UK, pp. 75-86.

Prosser, P. and Unsworth, C. (2006) A connectivity constraint using bridges. In: Brewka, G. (ed.) ECAI 2006: 17th European Conference on Artificial Intelligence, August 29-September 1, 2006, Riva del Garda, Italy. Series: Frontiers in artificial intelligence and applications (141). IOS Press: Amsterdam, The Netherlands, pp. 707-708. ISBN 9781586036423

Miller, A., Prosser, P. and Unsworth, C. (2005) A constraint model and a reduction operator for the minimising open stacks problem. In: Constraint Modelling Challenge 2005, in Conjunction with The Fifth Workshop on Modelling and Solving Problems with Constraints Held at IJCAI 2005, Edinburgh, Scotland, 31 Jul 2005. School of Computer Science, University of St. Andrews: St. Andrews, UK, pp. 44-50.

Beck, J.C., Prosser, P. and Wallace, R.J. (2004) Failing first: an update. In: Lopez de Mantaras, R. and Saitta, L. (eds.) ECAI 2004: Proceedings of the 16th European Conference on Artificial Intelligence. Series: Frontiers in artificial intelligence and applications (110). IOS Press: Amsterdam, The Netherlands, pp. 959-960. ISBN 9781586034528

Research Reports or Papers

McCreesh, C. and Prosser, P. (2012) Distributing an Exact Algorithm for Maximum Clique: Maximising the Costup. Technical Report. School of Computing Science, University of Glasgow.

Prosser, P. (2012) Exact Algorithms for Maximum Clique: A Computational Study. Technical Report. School of Computing Science, University of Glasgow.

Prosser, P. and Unsworth, C. (2006) Rooted Tree and Spanning Tree Constraints. Other. Dept of Computing Science, University of Glasgow.

Conference Proceedings

McCreesh, C., Prosser, P. and Trimble, J. (2017) A Partitioning Algorithm for Maximum Common Subgraph Problems. In: 26th International Joint Conference on Artificial Intelligence (IJCAI'17), Melbourne, Australia, 19-25 Aug 2017, (Accepted for Publication)

McCreesh, C., Ndiaye, S. N., Prosser, P. and Solnon, C. (2016) Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. In: CP2016: The 22nd International Conference on Principles and Practice of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 350-368. ISBN 9783319449524 (doi:10.1007/978-3-319-44953-1_23)

McCreesh, C., Prosser, P. and Trimble, J. (2016) Morphing Between Stable Matching Problems. In: CP 2016: 22nd International Conference on Principles and Practices of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 832-840. ISBN 9783319449524 (doi:10.1007/978-3-319-44953-1_52)

Cano, J., White, D. R., Bordallo, A., McCreesh, C., Prosser, P., Singer, J. and Nagarajan, V. (2016) Task Variant Allocation in Distributed Robotics. In: Robotics Science and Systems 2016, Ann Arbor, MI, USA, 18-22 June 2016, (doi:10.15607/RSS.2016.XII.045)

McCreesh, C., Prosser, P. and Trimble, J. (2016) Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. In: 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York, NY, USA, 9-15 July 2016, pp. 631-638. ISBN 9781577357704

Macdonald, C., McCreesh, C., Miller, A. and Prosser, P. (2015) Constructing sailing match race schedules: round-robin pairing lists. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 671-686. ISBN 9783319232188 (doi:10.1007/978-3-319-23219-5_46)

McCreesh, C. and Prosser, P. (2015) A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 295-312. ISBN 9783319232188 (doi:10.1007/978-3-319-23219-5_21)

McCreesh, C. and Prosser, P. (2014) Exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem. In: 11th International Conference, CPAIOR 2014, Cork, Ireland, 19-23 May 2014, pp. 226-234. ISBN 9783319070452 (doi:10.1007/978-3-319-07046-9_16)

McCreesh, C. and Prosser, P. (2014) Reducing the branching in a branch and bound algorithm for the maximum clique problem. In: 20th International Conference, CP 2014, Lyon, France, 8-12 Sep 2014, pp. 549-563. ISBN 9783319104270 (doi:10.1007/978-3-319-10428-7_40)

Prosser, P. (2014) Stable roommates and constraint programming. In: 11th International Conference, CPAIOR 2014, Cork, Ireland, 19-23 May 2014, pp. 15-28. ISBN 9783319070452 (doi:10.1007/978-3-319-07046-9_2)

Prosser, P. (2014) Teaching constraint programming. In: 20th International Conference, CP 2014, Lyon, France, 8-12 Sep 2014, p. 3. ISBN 9783319104270 (doi:10.1007/978-3-319-10428-7_2)

Codish, M., Miller, A. , Prosser, P. and Stuckey, A. (2013) Breaking symmetries in graph representation. In: International Joint Conference on Artificial Intelligence, Beijing, China, 3-9 Aug 2013,

Prosser, P. (2010) Triangle packing with constraint programming. In: 9th International Workshop on Constraint Modelling and Reformulation (ModRef 2010), St. Andrews. U.K, 06 - 10 Sep 2010, pp. 88-102.

Manlove, D.M., O'Malley, G., Prosser, P. and Unsworth, C. (2007) A constraint programming approach to the hospitals/residents problem. In: Proceedings of CP-AI-OR '07: the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Brussels, Belgium, 23-26 May, 2007, pp. 155-170. (doi:10.1007/978-3-540-72397-4_12)

Beck, J.C., Prosser, P. and Wallace, R.J. (2004) Trying again to fail-first. In: CSCLP 2004: Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, Lausanne, Switzerland, 23-25 June 2004, pp. 41-55.

Gregory, P., Miller, A. and Prosser, P. (2004) Solving the rehearsal problem with planning and with model checking. In: Workshop on Modelling and Solving Problems with Constraints, Valencia, Spain, 22 Aug 2004, pp. 157-171.

This list was generated on Sun Jun 25 21:46:28 2017 BST.