Guillaume Escamocher

Luis Quesada

Constraints An Int. J., 2023

Partial Compilation of SAT Using Selective Backbones.

[BibT_eX]

[DOI]

Andrea Balogh

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

Regular pattern-free coloring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Generation and Prediction of Difficult Model Counting Instances.

[BibT_eX]

[DOI]

CoRR, 2022

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences.

[BibT_eX]

[DOI]

Constraints An Int. J., 2022

2021

Leprechauns on the chessboard.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Generating Difficult CNF Instances in Unexplored Constrainedness Regions.

[BibT_eX]

[DOI]

Steven David Prestwich

ACM J. Exp. Algorithmics, 2020

Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2020

2019

Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior.

[BibT_eX]

[DOI]

CoRR, 2019

Generating Difficult SAT Instances by Preventing Triangles.

[BibT_eX]

[DOI]

Steven David Prestwich

CoRR, 2019

2018

Pushing the frontier of minimality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Constrainedness in Stable Matching.

[BibT_eX]

[DOI]

Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

Three-Dimensional Matching Instances Are Rich in Stable Matchings.

[BibT_eX]

[DOI]

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

From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP.

[BibT_eX]

[DOI]

Mohamed Siala

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

2016

Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems.

[BibT_eX]

[DOI]

Artif. Intell., 2016

2015

Variable and value elimination in binary constraint satisfaction via forbidden patterns.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Broken Triangles Revisited.

[BibT_eX]

[DOI]

Aymeric Duchein

Proceedings of the Principles and Practice of Constraint Programming, 2015

On the Minimal Constraint Satisfaction Problem: Complexity and Generation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2013

Variable Elimination in Binary CSP via Forbidden Patterns.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

2012

A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP.

[BibT_eX]

[DOI]

Stanislav Zivný

Proceedings of the Principles and Practice of Constraint Programming, 2012

A Dichotomy for 2-Constraint Forbidden CSP Patterns.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2009

Existence and computation of equilibria of first-price auctions with integral valuations and bids.

[BibT_eX]

[DOI]