Patrick Prosser

79 papers A* 6A 24B 9Journal 30Unranked 10

Year	Rank	Type	Title / Venue / Authors
2021	B	`conf`	Finding Subgraphs with Side Constraints. CPAIOR Özgür Akgün, Jessica A. Enright, Christopher Jefferson, Ciaran McCreesh, Patrick Prosser, Steffen Zschaler
2020	J	`jnl`	A General Framework for Stable Roommates Problems using Answer Set Programming. CoRR Esra Erdem, Müge Fidan, David F. Manlove, Patrick Prosser
2020	J	`jnl`	A General Framework for Stable Roommates Problems using Answer Set Programming. Theory Pract. Log. Program. Esra Erdem, Müge Fidan, David F. Manlove, Patrick Prosser
2020	A	`conf`	Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble
2020	B	`conf`	The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. ICGT Ciaran McCreesh, Patrick Prosser, James Trimble
2019	J	`jnl`	A Constraint Model for the Tree Decomposition of a Graph. CoRR Benjamin Bumpus, Patrick Prosser, James Trimble
2019	J	`jnl`	Constraints for symmetry breaking in graph representation. Constraints An Int. J. Michael Codish, Alice Miller, Patrick Prosser, Peter J. Stuckey
2019	B	`conf`	Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. CPAIOR Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, James Trimble
2019	A	`conf`	Understanding the Empirical Hardness of Random Optimisation Problems. CP Ciaran McCreesh, William Pettersson, Patrick Prosser
2018	J	`jnl`	A Review of Literature on Parallel Constraint Solving. CoRR Ian P. Gent, Ciaran McCreesh, Ian Miguel, Neil C. A. Moore, Peter Nightingale, Patrick Prosser, Chris Unsworth
2018	J	`jnl`	A review of literature on parallel constraint solving. Theory Pract. Log. Program. Ian P. Gent, Ian Miguel, Peter Nightingale, Ciaran McCreesh, Patrick Prosser, Neil C. A. Moore, Chris Unsworth
2018	B	`conf`	Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. CPAIOR Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon, James Trimble
2018	J	`jnl`	When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. J. Artif. Intell. Res. Ciaran McCreesh, Patrick Prosser, Christine Solnon, James Trimble
2017	A*	`conf`	A Partitioning Algorithm for Maximum Common Subgraph Problems. IJCAI Ciaran McCreesh, Patrick Prosser, James Trimble
2017	A	`conf`	On Maximum Weight Clique Algorithms, and How They Are Evaluated. CP Ciaran McCreesh, Patrick Prosser, Kyle A. Simpson, James Trimble
2016	A	`conf`	Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. CP Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon
2016	B	`conf`	Finding Maximum k-Cliques Faster Using Lazy Global Domination. SOCS Ciaran McCreesh, Patrick Prosser
2016	A*	`conf`	Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. IJCAI Ciaran McCreesh, Patrick Prosser, James Trimble
2016	A	`conf`	Morphing Between Stable Matching Problems. CP Ciaran McCreesh, Patrick Prosser, James Trimble
2016	—	`conf`	Task Variant Allocation in Distributed Robotics. Robotics: Science and Systems José Cano, David Robert White, Alejandro Bordallo, Ciaran McCreesh, Patrick Prosser, Jeremy Singer, Vijay Nagarajan
2015	A	`conf`	A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs. CP Ciaran McCreesh, Patrick Prosser
2015	J	`jnl`	A parallel branch and bound algorithm for the maximum labelled clique problem. Optim. Lett. Ciaran McCreesh, Patrick Prosser
2015	A	`conf`	Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists. CP Craig Macdonald, Ciaran McCreesh, Alice Miller, Patrick Prosser
2015	J	`jnl`	The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound. ACM Trans. Parallel Comput. Ciaran McCreesh, Patrick Prosser
2014	J	`jnl`	A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem. CoRR Ciaran McCreesh, Patrick Prosser
2014	B	`conf`	An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. CPAIOR Ciaran McCreesh, Patrick Prosser
2014	J	`jnl`	Empirical Algorithmics: draw your own conclusions. CoRR Frod Prefect, Patrick Prosser
2014	J	`jnl`	Finding Maximum k-Cliques Faster using Lazy Global Domination. CoRR Ciaran McCreesh, Patrick Prosser
2014	A	`conf`	Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. CP Ciaran McCreesh, Patrick Prosser
2014	B	`conf`	Stable Roommates and Constraint Programming. CPAIOR Patrick Prosser
2014	A	`conf`	Teaching Constraint Programming. CP Patrick Prosser
2014	J	`jnl`	The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound. CoRR Ciaran McCreesh, Patrick Prosser
2014	J	`jnl`	The Ultrametric Constraint and its Application to Phylogenetics. CoRR Neil C. A. Moore, Patrick Prosser
2013	J	`jnl`	An n-ary Constraint for the Stable Marriage Problem. CoRR Chris Unsworth, Patrick Prosser
2013	A*	`conf`	Breaking Symmetries in Graph Representation. IJCAI Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey
2013	J	`jnl`	Greedy Graph Colouring is a Misleading Heuristic. CoRR Ciaran McCreesh, Patrick Prosser
2013	J	`jnl`	Multi-Threading a State-of-the-Art Maximum Clique Algorithm. Algorithms Ciaran McCreesh, Patrick Prosser
2012	J	`jnl`	Diamond-free Degree Sequences CoRR Alice Miller, Patrick Prosser
2012	J	`jnl`	Distributing an Exact Algorithm for Maximum Clique: maximising the costup CoRR Ciaran McCreesh, Patrick Prosser
2012	J	`jnl`	Exact Algorithms for Maximum Clique: A Computational Study. Algorithms Patrick Prosser
2012	J	`jnl`	Exact Algorithms for Maximum Clique: a computational study CoRR Patrick Prosser
2011	J	`jnl`	Limited discrepancy search revisited. ACM J. Exp. Algorithmics Patrick Prosser, Chris Unsworth
2008	—	`conf`	A Hardware Relaxation Paradigm for Solving NP-Hard Problems. BCS Int. Acad. Conf. Paul Cockshott, Andreas Koltes, John T. O'Donnell, Patrick Prosser, Wim Vanderbauwhede
2008	J	`jnl`	The Ultrametric Constraint and its Application to Phylogenetics. J. Artif. Intell. Res. Neil C. A. Moore, Patrick Prosser
2007	B	`conf`	A Constraint Programming Approach to the Hospitals / Residents Problem. CPAIOR David F. Manlove, Gregg O'Malley, Patrick Prosser, Chris Unsworth
2006	A	`conf`	A Connectivity Constraint Using Bridges. ECAI Patrick Prosser, Chris Unsworth
2006	J	`jnl`	A case study of mutual routing-scheduling reformulation. J. Sched. J. Christopher Beck, Patrick Prosser, Evgeny Selensky
2005	—	`conf`	A Specialised Binary Constraint for the Stable Marriage Problem. SARA Chris Unsworth, Patrick Prosser
2005	A	`conf`	Specialised Constraints for Stable Matching Problems. CP Chris Unsworth, Patrick Prosser
2004	A	`conf`	Failing First: An Update. ECAI J. Christopher Beck, Patrick Prosser, Richard J. Wallace
2004	—	`conf`	Trying Again to Fail-First. CSCLP J. Christopher Beck, Patrick Prosser, Richard J. Wallace
2004	A	`conf`	Variable Ordering Heuristics Show Promise. CP J. Christopher Beck, Patrick Prosser, Richard J. Wallace
2003	A	`conf`	Supertree Construction with Constraint Programming. CP Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei
2003	A*	`conf`	Vehicle Routing and Job Shop Scheduling: What's the Difference? ICAPS J. Christopher Beck, Patrick Prosser, Evgeny Selensky
2002	—	`conf`	A Study of Encodings of Constraint Satisfaction Problems with 0/1 Variables. International Workshop on Constraint Solving and Constraint Logic Programming Patrick Prosser, Evgeny Selensky
2002	A	`conf`	An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. ECAI Ian P. Gent, Patrick Prosser
2002	B	`conf`	Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems. ICGT J. Christopher Beck, Patrick Prosser, Evgeny Selensky
2002	—	`conf`	On the Reformulation of Vehicle Routing Problems and Scheduling Problems. SARA J. Christopher Beck, Patrick Prosser, Evgeny Selensky
2001	A	`conf`	A Constraint Programming Approach to the Stable Marriage Problem. CP Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith
2001	J	`jnl`	Random Constraint Satisfaction: Flaws and Structure. Constraints An Int. J. Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh
2000	J	`jnl`	A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints. Constraints An Int. J. Philip Kilby, Patrick Prosser, Paul Shaw
2000	A	`conf`	Singleton Consistencies. CP Patrick Prosser, Kostas Stergiou, Toby Walsh
2000	J	`jnl`	Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. J. Heuristics Bruno De Backer, Vincent Furnon, Paul Shaw, Philip Kilby, Patrick Prosser
1999	—	`conf`	Morphing: Combining Structure and Randomness. AAAI/IAAI Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh
1998	A	`conf`	Random Constraint Satisfaction: Theory Meets Practice. CP Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh
1998	A	`conf`	The Dynamics of Dynamic Variable Ordering Heuristics. CP Patrick Prosser
1997	A	`conf`	The Constrainedness of Arc Consistency. CP Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
1997	—	`conf`	The Scaling of Search Cost. AAAI/IAAI Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
1996	A	`conf`	An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem. CP Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh
1996	J	`jnl`	An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems. Artif. Intell. Patrick Prosser
1996	—	`conf`	The Constrainedness of Search. AAAI/IAAI, Vol. 1 Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
1995	—	`conf`	Forward Checking with Backmarking. Constraint Processing, Selected Papers Patrick Prosser
1995	A	`conf`	Scaling Effects in the CSP Phase Transition. CP Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh
1994	A	`conf`	Binary Constraint Satisfaction Problems: Some are Harder than Others. ECAI Patrick Prosser
1993	A*	`conf`	Domain Filtering can Degrade Intelligent Backtracking Search. IJCAI Patrick Prosser
1993	J	`jnl`	Hybrid Algorithms for the Constraint Satisfaction Problem. Comput. Intell. Patrick Prosser
1991	J	`jnl`	A distributed asynchronous system for predictive and reactive scheduling. Artif. Intell. Eng. Peter Burke, Patrick Prosser
1989	A*	`conf`	A Reactive Scheduling Agent. IJCAI Patrick Prosser
1988	A	`conf`	A Hybrid Genetic Algorithm for Pallet Loading. ECAI Patrick Prosser