Dr Patrick Prosser

Honorary Lecturer (School of Computing Science)

email: Patrick.Prosser@glasgow.ac.uk

Room S113, Computing Science, 11 Lilybank Gardens, Glasgow G12 8QQ

Publications

List by: Type | Date

Jump to: 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001

Number of items: 54.

2021

Akgün, Özgür, Enright, Jessica ORCID: https://orcid.org/0000-0002-0266-3292, Jefferson, Christopher, McCreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Zschaler, Steffen (2021) Finding Subgraphs With Side Constraints. In: 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAOIR 2021), Vienna, Austria, 5-8 July 2021, pp. 348-364. ISBN 9783030782290 (doi: 10.1007/978-3-030-78230-6_22)

2020

Erdem, Esra, Fidan, Müge, Manlove, David ORCID: https://orcid.org/0000-0001-6754-7308 and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (2020) A general framework for stable roommates problems using answer set programming. Theory and Practice of Logic Programming, 20(6), pp. 911-925. (doi: 10.1017/S1471068420000277)

Gocht, Stephan, McBride, Ross, McCreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Nordström, Jakob, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Trimble, James (2020) Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. In: 26th International Conference on Principles and Practice of Constraint Programming, Louvain-la-Neuve, Belgium, 07-11 Sep 2020, pp. 338-357. ISBN 9783030584740 (doi: 10.1007/978-3-030-58475-7_20)

Mccreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Trimble, James (2020) The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. In: 13th International Conference on Graph Transformation (ICGT 2020), Bergen, Norway, 25-26 Jun 2020, pp. 316-324. ISBN 9783030513719 (doi: 10.1007/978-3-030-51372-6)

2019

Archibald, Blair ORCID: https://orcid.org/0000-0003-3699-6658, Dunlop, Fraser, Hoffmann, Ruth, McCreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Trimble, James (2019) Sequential and parallel solution-biased search for subgraph algorithms. In: 16th International Conference on Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR 2019), Thessaloniki, Greece, 4-7 June 2019, pp. 20-38. ISBN 9783030192112 (doi: 10.1007/978-3-030-19212-9_2)

Codish, Michael, Miller, Alice ORCID: https://orcid.org/0000-0002-0941-1717, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Stuckey, Peter J. (2019) Constraints for symmetry breaking in graph representation. Constraints, 24(1), pp. 1-24. (doi: 10.1007/s10601-018-9294-5)

McCreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Pettersson, William ORCID: https://orcid.org/0000-0003-0040-2088 and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (2019) Understanding the empirical hardness of random optimisation problems. In: 25th International Conference on Principles and Practice of Constraint Programming, Stamford, CT, USA, 30 Sep - 04 Oct 2019, pp. 333-349. (doi: 10.1007/978-3-030-30048-7_20)

2018

Gent, Ian P., Miguel, Ian, Nightingale, Peter, McCreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912, Moore, Neil C.A. and Unsworth, Chris (2018) A review of literature on parallel constraint solving. Theory and Practice of Logic Programming, 18(5-6), pp. 725-758. (doi: 10.1017/S1471068418000340)

Hoffmann, Ruth, Mccreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Ndiaye, Samba Ndojh, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912, Reilly, Craig, Solnon, Christine and Trimble, James (2018) Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. In: 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, The Netherlands, 26-29 Jun 2018, pp. 298-315. ISBN 9783319930305 (doi: 10.1007/978-3-319-93031-2_22)

Mccreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Trimble, James (2018) When subgraph isomorphism is really hard, and why this matters for graph databases. Journal of Artificial Intelligence Research, 61, pp. 723-759. (doi: 10.1613/jair.5768)

2017

McCreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912, Simpson, Kyle ORCID: https://orcid.org/0000-0001-8068-9909 and Trimble, James (2017) On Maximum Weight Clique Algorithms, and How They Are Evaluated. In: CP2017: The 23rd International Conference on Principles and Practice of Constraint Programming, Melbourne, Australia, 28 Aug - 1 Sept 2017, pp. 206-225. ISBN 9783319661575 (doi: 10.1007/978-3-319-66158-2_14)

McCreesh, Ciaran ORCID: https://orcid.org/0000-0002-6106-4871, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Trimble, James (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, pp. 712-719. ISBN 9780999241103 (doi: 10.24963/ijcai.2017/99)

2016

McCreesh, Ciaran, Ndiaye, Samba Ndojh, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Solnon, Christine (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, Ciaran, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Trimble, James (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, José ORCID: https://orcid.org/0000-0002-2243-389X, White, David R., Bordallo, Alejandro, McCreesh, Ciaran, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912, Singer, Jeremy ORCID: https://orcid.org/0000-0001-9462-6802 and Nagarajan, Vijay (2016) Task Variant Allocation in Distributed Robotics. In: Robotics Science and Systems 2016, Ann Arbor, MI, USA, 18-22 June 2016, ISBN 9780992374723 (doi: 10.15607/RSS.2016.XII.045)

McCreesh, Ciaran, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Trimble, James (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, Craig ORCID: https://orcid.org/0000-0003-3143-279X, McCreesh, Ciaran, Miller, Alice ORCID: https://orcid.org/0000-0002-0941-1717 and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (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, Ciaran and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (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, Ciaran and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (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, Ciaran and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (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, Ciaran and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (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, Ciaran and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (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, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (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, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (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. ORCID: https://orcid.org/0000-0002-4667-9229, Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 and Rogers, S. ORCID: https://orcid.org/0000-0003-3578-4477 (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. ORCID: https://orcid.org/0000-0002-0941-1717, Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 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. ORCID: https://orcid.org/0000-0003-4460-6912 (2013) Multi-threading a state-of-the-art maximum clique algorithm. Algorithms, 6(4), pp. 618-635. (doi: 10.3390/a6040618)

2012

McCreesh, Ciaran and Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (2012) Distributing an Exact Algorithm for Maximum Clique: Maximising the Costup. Technical Report. School of Computing Science, University of Glasgow.

Miller, A. ORCID: https://orcid.org/0000-0002-0941-1717 and Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 (2012) Diamond-free degree sequences. Acta Universitatis Sapientiae, Informatica, 4(2), pp. 189-200.

Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 (2012) Exact algorithms for maximum clique: a computational study. Algorithms, 5(4), pp. 545-587. (doi: 10.3390/a5040545)

Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 (2012) Exact Algorithms for Maximum Clique: A Computational Study. Technical Report. School of Computing Science, University of Glasgow.

2011

Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 and Unsworth, C. (2011) Limited discrepancy search revisited. Journal of Experimental Algorithmics, 16, Article 1.6. (doi: 10.1145/1963190.2019581)

2010

Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 (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. ORCID: https://orcid.org/0000-0003-4460-6912 (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. ORCID: https://orcid.org/0000-0003-4460-6912 and Vanderbauwhede, W. ORCID: https://orcid.org/0000-0001-6768-0037 (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.F., 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, JC, 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. ORCID: https://orcid.org/0000-0003-4460-6912 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

Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 and Unsworth, C. (2006) Rooted Tree and Spanning Tree Constraints. Other. Dept of Computing Science, University of Glasgow.

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

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)

Manlove, David F. ORCID: https://orcid.org/0000-0001-6754-7308, O'Malley, Gregg, Prosser, Patrick ORCID: https://orcid.org/0000-0003-4460-6912 and Unsworth, Chris (2005) A Constraint Programming Approach to the Hospitals / Residents Problem. In: Fourth Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Sitges, Spain, 01-05 Oct 2005, pp. 28-43.

Miller, A. ORCID: https://orcid.org/0000-0002-0941-1717, Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 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. ORCID: https://orcid.org/0000-0003-4460-6912 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. ORCID: https://orcid.org/0000-0003-4460-6912 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. ORCID: https://orcid.org/0000-0002-0941-1717 and Prosser, P. ORCID: https://orcid.org/0000-0003-4460-6912 (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.