GAC on Conjunctions of Constraints. - George Katsirelos; Fahiem Bacchus (CP, 2001)

Unrestricted Nogood Recording in CSP Search. - George Katsirelos; Fahiem Bacchus (CP, 2003)

Generalized NoGoods in CSPs. - George Katsirelos; Fahiem Bacchus (AAAI, 2005)

A Compression Algorithm for Large Arity Extensional Constraints. - George Katsirelos; Toby Walsh (CP, 2007)

The Weighted CfgConstraint. - George Katsirelos; Nina Narodytska; Toby Walsh (CPAIOR, 2008)

Combining Symmetry Breaking and Global Constraints. - George Katsirelos; Nina Narodytska; Toby Walsh (CSCLP, 2008)

Restricted Global Grammar Constraints. - George Katsirelos; Sebastian Maneth; Nina Narodytska; Toby Walsh (CP, 2009)

Reformulating Global Grammar Constraints. - George Katsirelos; Nina Narodytska; Toby Walsh (CPAIOR, 2009)

Decompositions of All Different, Global Cardinality and Related Constraints. - Christian Bessiere; George Katsirelos; Nina Narodytska; Claude-Guy Quimper; Toby Walsh (IJCAI, 2009)

Circuit Complexity and Decompositions of Global Constraints. - Christian Bessiere; George Katsirelos; Nina Narodytska; Toby Walsh (IJCAI, 2009)

The Weighted CFG Constraint - George Katsirelos; Nina Narodytska; Toby Walsh (CoRR, 2009)

Breaking Generator Symmetry - George Katsirelos; Nina Narodytska; Toby Walsh (CoRR, 2009)

Nogood Processing in CSPs. - George Katsirelos (2009)

A Restriction of Extended Resolution for Clause Learning SAT Solvers. - Gilles Audemard; George Katsirelos; Laurent Simon 001 (AAAI, 2010)

Propagating Conjunctions of AllDifferent Constraints. - Christian Bessiere; George Katsirelos; Nina Narodytska; Claude-Guy Quimper; Toby Walsh (AAAI, 2010)

Decomposition of the NValue Constraint. - Christian Bessiere; George Katsirelos; Nina Narodytska; Claude-Guy Quimper; Toby Walsh (CP, 2010)

On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry. - George Katsirelos; Nina Narodytska; Toby Walsh (CP, 2010)

Symmetries of Symmetry Breaking Constraints. - George Katsirelos; Toby Walsh (ECAI, 2010)

An Empirical Study of Borda Manipulation - Jessica Davies 001; George Katsirelos; Nina Narodytska; Toby Walsh (CoRR, 2010)

Complexity of and Algorithms for Borda Manipulation. - Jessica Davies 001; George Katsirelos; Nina Narodytska; Toby Walsh (AAAI, 2011)

The weighted Grammar constraint. - George Katsirelos; Nina Narodytska; Toby Walsh (Ann. Oper. Res., 2011)

The Complexity of Integer Bound Propagation. - Lucas Bordeaux; George Katsirelos; Nina Narodytska; Moshe Y. Vardi (J. Artif. Intell. Res., 2011)

Computational Protein Design as a Cost Function Network Optimization Problem. - David Allouche; Seydou Traoré; Isabelle André; Simon de Givry; George Katsirelos; Sophie Barbe; Thomas Schiex (CP, 2012)

The SeqBin Constraint Revisited. - George Katsirelos; Nina Narodytska; Toby Walsh (CP, 2012)

Eigenvector Centrality in Industrial SAT Instances. - George Katsirelos; Laurent Simon 001 (CP, 2012)

Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation). - George Katsirelos; Laurent Simon 001 (SAT, 2012)

Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers. - George Katsirelos; Ashish Sabharwal; Horst Samulowitz; Laurent Simon 001 (AAAI, 2013)

Constraint Acquisition via Partial Queries. - Christian Bessiere; Remi Coletta; Emmanuel Hebrard; George Katsirelos; Nadjib Lazaar; Nina Narodytska; Claude-Guy Quimper; Toby Walsh (IJCAI, 2013)

Detecting and Exploiting Subproblem Tractability. - Christian Bessiere; Clément Carbonnel; Emmanuel Hebrard; George Katsirelos; Toby Walsh (IJCAI, 2013)

A new framework for computational protein design through cost function network optimization. - Seydou Traoré; David Allouche; Isabelle André; Simon de Givry; George Katsirelos; Thomas Schiex; Sophie Barbe (Bioinform., 2013)

Relaxation Search: A Simple Way of Managing Optional Clauses. - Fahiem Bacchus; Jessica Davies 001; Maria Tsimpoukelli; George Katsirelos (AAAI, 2014)

The Balance Constraint Family. - Christian Bessiere; Emmanuel Hebrard; George Katsirelos; Zeynep Kiziltan; Émilie Picard-Cantin; Claude-Guy Quimper; Toby Walsh (CP, 2014)

Reasoning about Constraint Models. - Christian Bessiere; Emmanuel Hebrard; George Katsirelos; Zeynep Kiziltan; Nina Narodytska; Toby Walsh (PRICAI, 2014)

Computational protein design as an optimization problem. - David Allouche; Isabelle André; Sophie Barbe; Jessica Davies 001; Simon de Givry; George Katsirelos; Barry O'Sullivan; Steven D. Prestwich; Thomas Schiex; Seydou Traoré (Artif. Intell., 2014)

Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules. - Jessica Davies 001; George Katsirelos; Nina Narodytska; Toby Walsh; Lirong Xia (Artif. Intell., 2014)

Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets. - Fahiem Bacchus; George Katsirelos (CAV (2), 2015)

Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP. - David Allouche; Simon de Givry; George Katsirelos; Thomas Schiex; Matthias Zytnicki (CP, 2015)

Reasoning about Connectivity Constraints. - Christian Bessiere; Emmanuel Hebrard; George Katsirelos; Toby Walsh (IJCAI, 2015)

Finding a Collection of MUSes Incrementally. - Fahiem Bacchus; George Katsirelos (CPAIOR, 2016)

Ranking Constraints. - Christian Bessiere; Emmanuel Hebrard; George Katsirelos; Zeynep Kiziltan; Toby Walsh (IJCAI, 2016)

Multi-language evaluation of exact solvers in graphical model discrete optimization. - Barry Hurley 001; Barry O'Sullivan; David Allouche; George Katsirelos; Thomas Schiex; Matthias Zytnicki; Simon de Givry (Constraints An Int. J., 2016)

New Approaches to Constraint Acquisition. - Christian Bessiere; Abderrazak Daoudi; Emmanuel Hebrard; George Katsirelos; Nadjib Lazaar; Younes Mechqrane; Nina Narodytska; Claude-Guy Quimper; Toby Walsh (Data Mining and Constraint Programming, 2016)

Clique Cuts in Weighted Constraint Satisfaction. - Simon de Givry; George Katsirelos (CP, 2017)

Conflict Directed Clause Learning for Maximum Weighted Clique Problem. - Emmanuel Hebrard; George Katsirelos (IJCAI, 2018)

A Hybrid Approach for Exact Coloring of Massive Graphs. - Emmanuel Hebrard; George Katsirelos (CPAIOR, 2019)

Guaranteed Diversity & Quality for the Weighted CSP. - Manon Ruffini; Jelena Vucinic; Simon de Givry; George Katsirelos; Sophie Barbe; Thomas Schiex (ICTAI, 2019)

Clause Learning and New Bounds for Graph Coloring. - Emmanuel Hebrard; George Katsirelos (IJCAI, 2019)

Chain Length and CSPs Learnable with Few Queries. - Christian Bessiere; Clément Carbonnel; George Katsirelos (AAAI, 2020)

Relaxation-Aware Heuristics for Exact Optimization in Graphical Models. - Fulya Trösser; Simon de Givry; George Katsirelos (CPAIOR, 2020)

Partial Queries for Constraint Acquisition. - Christian Bessiere; Clément Carbonnel; Anton Dries; Emmanuel Hebrard; George Katsirelos; Nadjib Lazaar; Nina Narodytska; Claude-Guy Quimper; Kostas Stergiou 001; Dimosthenis C. Tsouros; Toby Walsh (CoRR, 2020)

Constraint and Satisfiability Reasoning for Graph Coloring. - Emmanuel Hebrard; George Katsirelos (J. Artif. Intell. Res., 2020)

Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming. - Fulya Trösser; Simon de Givry; George Katsirelos (IJCAI, 2021)

Guaranteed Diversity and Optimality in Cost Function Network Based Computational Protein Design Methods. - Manon Ruffini; Jelena Vucinic; Simon de Givry; George Katsirelos; Sophie Barbe; Thomas Schiex (Algorithms, 2021)

Efficient semidefinite bounds for multi-label discrete graphical models. - Valentin Durante; George Katsirelos; Thomas Schiex (CoRR, 2021)

Parallel Hybrid Best-First Search. - Abdelkader Beldjilali; Pierre Montalbano; David Allouche; George Katsirelos; Simon de Givry (CP, 2022)

Structured Set Variable Domains in Bayesian Network Structure Learning. - Fulya Trösser; Simon de Givry; George Katsirelos (CP, 2022)

Multiple-choice Knapsack Constraint in Graphical Models. - Pierre Montalbano; Simon de Givry; George Katsirelos (CPAIOR, 2022)

Efficient Low Rank Convex Bounds for Pairwise Discrete Graphical Models. - Valentin Durante; George Katsirelos; Thomas Schiex (ICML, 2022)

Learning the structure of Bayesian Networks using constraint programming. - Fulya Trösser; Simon de Givry; George Katsirelos (ISAIM, 2022)

Gene regulatory network inference methodology for genomic and transcriptomic data acquired in genetically related heterozygote individuals. - Lise Pomiès; Céline Brouard; Harold Duruflé; Élise Maigné; Clément Carré; Louise Gody; Fulya Trösser; George Katsirelos; Brigitte Mangin; Nicolas B. Langlade; Simon de Givry (Bioinform., 2022)

Virtual Pairwise Consistency in Cost Function Networks. - Pierre Montalbano; David Allouche; Simon de Givry; George Katsirelos; Tomás Werner (CPAIOR, 2023)

An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming. - George Katsirelos (SAT, 2023)

Learning constraints through partial queries. - Christian Bessiere; Clément Carbonnel; Anton Dries; Emmanuel Hebrard; George Katsirelos; Nadjib Lazaar; Nina Narodytska; Claude-Guy Quimper; Kostas Stergiou 001; Dimosthenis C. Tsouros; Toby Walsh (Artif. Intell., 2023)

Corrigendum to "Learning constraints through partial queries" [Artificial Intelligence 319 (2023) 103896]. - Christian Bessiere; Clément Carbonnel; Anton Dries; Emmanuel Hebrard; George Katsirelos; Nadjib Lazaar; Nina Narodytska; Claude-Guy Quimper; Kostas Stergiou 001; Dimosthenis C. Tsouros; Toby Walsh (Artif. Intell., 2024)

Explaining Complex ML Models to Domain Experts Using LLM & Visualization: An Exploration in the French Breadmaking Industry. - Briggs Twitchell; George Katsirelos; Anastasia Bezerianos; Nadia Boukhelifa (CHI Extended Abstracts, 2025)

Core-Guided Linear Programming-Based Maximum Satisfiability. - George Katsirelos (SAT, 2025)