Patrick Prosser

According to our database, Patrick Prosser authored at least 72 papers between 1988 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Finding Subgraphs with Side Constraints.

Özgür Akgün, Jessica A. Enright, Christopher Jefferson, Ciaran McCreesh, Patrick Prosser, Steffen Zschaler

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2020

A General Framework for Stable Roommates Problems using Answer Set Programming.

Esra Erdem, Muge Fidan, David F. Manlove, Patrick Prosser

Theory Pract. Log. Program., 2020

The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants.

Ciaran McCreesh, Patrick Prosser, James Trimble

Proceedings of the Graph Transformation - 13th International Conference, 2020

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems.

Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble

Proceedings of the Principles and Practice of Constraint Programming, 2020

2019

A Constraint Model for the Tree Decomposition of a Graph.

Benjamin Bumpus, Patrick Prosser, James Trimble

CoRR, 2019

Constraints for symmetry breaking in graph representation.

Michael Codish, Alice Miller, Patrick Prosser, Peter J. Stuckey

Constraints An Int. J., 2019

Sequential and Parallel Solution-Biased Search for Subgraph Algorithms.

Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, James Trimble

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Understanding the Empirical Hardness of Random Optimisation Problems.

Ciaran McCreesh, William Pettersson, Patrick Prosser

Proceedings of the Principles and Practice of Constraint Programming, 2019

2018

A review of literature on parallel constraint solving.

Ian P. Gent, Ian Miguel, Peter Nightingale, Ciaran McCreesh, Patrick Prosser, Neil C. A. Moore, Chris Unsworth

Theory Pract. Log. Program., 2018

When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases.

Ciaran McCreesh, Patrick Prosser, Christine Solnon, James Trimble

J. Artif. Intell. Res., 2018

Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms.

Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon, James Trimble

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017

A Partitioning Algorithm for Maximum Common Subgraph Problems.

Ciaran McCreesh, Patrick Prosser, James Trimble

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Maximum Weight Clique Algorithms, and How They Are Evaluated.

Ciaran McCreesh, Patrick Prosser, Kyle A. Simpson, James Trimble

Proceedings of the Principles and Practice of Constraint Programming, 2017

2016

Finding Maximum k-Cliques Faster Using Lazy Global Domination.

Ciaran McCreesh, Patrick Prosser

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Task Variant Allocation in Distributed Robotics.

José Cano, David Robert White, Alejandro Bordallo, Ciaran McCreesh, Patrick Prosser, Jeremy Singer, Vijay Nagarajan

Proceedings of the Robotics: Science and Systems XII, University of Michigan, Ann Arbor, Michigan, USA, June 18, 2016

Heuristics and Really Hard Instances for Subgraph Isomorphism Problems.

Ciaran McCreesh, Patrick Prosser, James Trimble

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Morphing Between Stable Matching Problems.

Ciaran McCreesh, Patrick Prosser, James Trimble

Proceedings of the Principles and Practice of Constraint Programming, 2016

Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems.

Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound.

Ciaran McCreesh, Patrick Prosser

ACM Trans. Parallel Comput., 2015

A parallel branch and bound algorithm for the maximum labelled clique problem.

Ciaran McCreesh, Patrick Prosser

Optim. Lett., 2015

A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs.

Ciaran McCreesh, Patrick Prosser

Proceedings of the Principles and Practice of Constraint Programming, 2015

Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists.

Craig Macdonald, Ciaran McCreesh, Alice Miller, Patrick Prosser

Proceedings of the Principles and Practice of Constraint Programming, 2015

2014

Empirical Algorithmics: draw your own conclusions.

Frod Prefect, Patrick Prosser

CoRR, 2014

Stable Roommates and Constraint Programming.

Patrick Prosser

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem.

Ciaran McCreesh, Patrick Prosser

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Teaching Constraint Programming.

Patrick Prosser

Proceedings of the Principles and Practice of Constraint Programming, 2014

Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem.

Ciaran McCreesh, Patrick Prosser

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

An n-ary Constraint for the Stable Marriage Problem.

Chris Unsworth, Patrick Prosser

CoRR, 2013

Greedy Graph Colouring is a Misleading Heuristic.

Ciaran McCreesh, Patrick Prosser

CoRR, 2013

Multi-Threading a State-of-the-Art Maximum Clique Algorithm.

Ciaran McCreesh, Patrick Prosser

Algorithms, 2013

Breaking Symmetries in Graph Representation.

Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey

Proceedings of the IJCAI 2013, 2013

2012

Distributing an Exact Algorithm for Maximum Clique: maximising the costup

Ciaran McCreesh, Patrick Prosser

CoRR, 2012

Diamond-free Degree Sequences

Alice Miller, Patrick Prosser

CoRR, 2012

Exact Algorithms for Maximum Clique: A Computational Study.

Patrick Prosser

Algorithms, 2012

2011

Limited discrepancy search revisited.

Patrick Prosser, Chris Unsworth

ACM J. Exp. Algorithmics, 2011

2008

The Ultrametric Constraint and its Application to Phylogenetics.

Neil C. A. Moore, Patrick Prosser

J. Artif. Intell. Res., 2008

A Hardware Relaxation Paradigm for Solving NP-Hard Problems.

Paul Cockshott, Andreas Koltes, John T. O'Donnell, Patrick Prosser, Wim Vanderbauwhede

Proceedings of the Visions of Computer Science, 2008

2007

A Constraint Programming Approach to the Hospitals / Residents Problem.

David F. Manlove, Gregg O'Malley, Patrick Prosser, Chris Unsworth

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

2006

A case study of mutual routing-scheduling reformulation.

J. Christopher Beck, Patrick Prosser, Evgeny Selensky

J. Sched., 2006

A Connectivity Constraint Using Bridges.

Patrick Prosser, Chris Unsworth

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005

A Specialised Binary Constraint for the Stable Marriage Problem.

Chris Unsworth, Patrick Prosser

Proceedings of the Abstraction, 2005

Specialised Constraints for Stable Matching Problems.

Chris Unsworth, Patrick Prosser

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Failing First: An Update.

J. Christopher Beck, Patrick Prosser, Richard J. Wallace

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Trying Again to Fail-First.

J. Christopher Beck, Patrick Prosser, Richard J. Wallace

Proceedings of the Recent Advances in Constraints, 2004

Variable Ordering Heuristics Show Promise.

J. Christopher Beck, Patrick Prosser, Richard J. Wallace

Proceedings of the Principles and Practice of Constraint Programming, 2004

2003

Supertree Construction with Constraint Programming.

Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei

Proceedings of the Principles and Practice of Constraint Programming, 2003

Vehicle Routing and Job Shop Scheduling: What's the Difference?

J. Christopher Beck, Patrick Prosser, Evgeny Selensky

Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003

2002

On the Reformulation of Vehicle Routing Problems and Scheduling Problems.

J. Christopher Beck, Patrick Prosser, Evgeny Selensky

Proceedings of the Abstraction, 2002

Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems.

J. Christopher Beck, Patrick Prosser, Evgeny Selensky

Proceedings of the Graph Transformation, First International Conference, 2002

An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists.

Ian P. Gent, Patrick Prosser

Proceedings of the 15th European Conference on Artificial Intelligence, 2002

A Study of Encodings of Constraint Satisfaction Problems with 0/1 Variables.

Patrick Prosser, Evgeny Selensky

Proceedings of the Recent Advances in Constraints, 2002

2001

Random Constraint Satisfaction: Flaws and Structure.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh

Constraints An Int. J., 2001

A Constraint Programming Approach to the Stable Marriage Problem.

Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics.

Bruno De Backer, Vincent Furnon, Paul Shaw, Philip Kilby, Patrick Prosser

J. Heuristics, 2000

A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints.

Philip Kilby, Patrick Prosser, Paul Shaw

Constraints An Int. J., 2000

Singleton Consistencies.

Patrick Prosser, Kostas Stergiou, Toby Walsh

Proceedings of the Principles and Practice of Constraint Programming, 2000

1999

Morphing: Combining Structure and Randomness.

Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh

Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998

The Dynamics of Dynamic Variable Ordering Heuristics.

Patrick Prosser

Proceedings of the Principles and Practice of Constraint Programming, 1998

Random Constraint Satisfaction: Theory Meets Practice.

Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh

Proceedings of the Principles and Practice of Constraint Programming, 1998

1997

The Constrainedness of Arc Consistency.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

The Scaling of Search Cost.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh

Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996

An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems.

Patrick Prosser

Artif. Intell., 1996

An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

The Constrainedness of Search.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Forward Checking with Backmarking.

Patrick Prosser

Proceedings of the Constraint Processing, Selected Papers, 1995

Scaling Effects in the CSP Phase Transition.

Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh

Proceedings of the Principles and Practice of Constraint Programming, 1995

1994

Binary Constraint Satisfaction Problems: Some are Harder than Others.

Patrick Prosser

Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994

1993

Hybrid Algorithms for the Constraint Satisfaction Problem.

Patrick Prosser

Comput. Intell., 1993

Domain Filtering can Degrade Intelligent Backtracking Search.

Patrick Prosser

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1991

A distributed asynchronous system for predictive and reactive scheduling.

Peter Burke, Patrick Prosser

Artif. Intell. Eng., 1991

1989

A Reactive Scheduling Agent.

Patrick Prosser

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1988

A Hybrid Genetic Algorithm for Pallet Loading.

Patrick Prosser

Proceedings of the 8th European Conference on Artificial Intelligence, 1988