A Hybrid Approach for SAT. - Djamal Habet; Chu Min Li 001; Laure Devendeville; Michel Vasquez (CP, 2002)

Consistency checking within local search applied to the frequency assignment with polarization problem. - Michel Vasquez; Audrey Dupont; Djamal Habet (RAIRO Oper. Res., 2003)

Complete and Incomplete Algorithms for the Queen Graph Coloring Problem. - Michel Vasquez; Djamal Habet (ECAI, 2004)

Solving the Selecting and Scheduling Satellite Photographs Problem with a Consistent Neighborhood Heuristic. - Djamal Habet; Michel Vasquez (ICTAI, 2004)

Algorithmes complet et incomplet pour la coloration des graphes de reines. - Michel Vasquez; Djamal Habet (JFPLC, 2004)

Consistent Neighborhood for the Satisfiability Problem. - Djamal Habet; Lionel Paris; Belaid Benhamou (ICTAI (2), 2007)

Improving Local Search for Satisfiability Problem by Integrating Structural Properties. - Djamal Habet; Michel Vasquez (RIVF, 2007)

Enhancing the Robustness/Efficiency of Local Search Algorithms for SAT. - Djamal Habet (ICTAI (1), 2008)

A Tree Decomposition Based Approach to Solve Structured SAT Instances. - Djamal Habet; Lionel Paris; Cyril Terrioux (ICTAI, 2009)

Tabu Search to Solve Real-Life Combinatorial Optimization Problems: A Case of Study. - Djamal Habet (Foundations of Computational Intelligence (3), 2009)

Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report. - Djamal Habet; Philippe Jégou (Abstraction, Reformulation, and Approximation, 2010)

Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite. - Djamal Habet; Michel Vasquez; Yannick Vimont (Comput. Optim. Appl., 2010)

Inference Rules in Local Search for Max-SAT. - André Abramé; Djamal Habet (ICTAI, 2012)

Local Search Based on Conflict Analysis for the Satisfiability Problem. - Djamal Habet; Donia Toumi (ICTAI, 2012)

Empirical Study of the Behavior of Conflict Analysis in CDCL Solvers. - Djamal Habet; Donia Toumi (CP, 2013)

Efficient Application of Max-SAT Resolution on Inconsistent Subsets. - André Abramé; Djamal Habet (CP, 2014)

Local Max-Resolution in Branch and Bound Solvers for Max-SAT. - André Abramé; Djamal Habet (ICTAI, 2014)

Maintaining and Handling All Unit Propagation Reasons in Exact Max-SAT Solvers. - André Abramé; Djamal Habet (SOCS, 2014)

On the Extension of Learning for Max-SAT. - André Abramé; Djamal Habet (STAIRS, 2014)

A Two-Levels Local Search Algorithm for Random SAT Instances with Long Clauses. - André Abramé; Djamal Habet; Donia Toumi (STAIRS, 2014)

Ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver. - André Abramé; Djamal Habet (J. Satisf. Boolean Model. Comput., 2014)

Local Search Algorithm for the Partial Minimum Satisfiability Problem. - André Abramé; Djamal Habet (ICTAI, 2015)

On the Resiliency of Unit Propagation to Max-Resolution. - André Abramé; Djamal Habet (IJCAI, 2015)

Learning Nobetter Clauses in Max-SAT Branch and Bound Solvers. - André Abramé; Djamal Habet (ICTAI, 2016)

Improving configuration checking for satisfiable random k-SAT instances. - André Abramé; Djamal Habet; Donia Toumi (Ann. Math. Artif. Intell., 2017)

Conflict History Based Branching Heuristic for CSP Solving. - Djamal Habet; Cyril Terrioux (CIMA@ICTAI, 2018)

Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience. - Mohamed Sami Cherif; Djamal Habet (CP, 2019)

Conflict history based search for constraint satisfaction problem. - Djamal Habet; Cyril Terrioux (SAC, 2019)

On the Refinement of Conflict History Search Through Multi-Armed Bandit. - Mohamed Sami Cherif; Djamal Habet; Cyril Terrioux (ICTAI, 2020)

Towards Bridging the Gap Between SAT and Max-SAT Refutations. - Matthieu Py; Mohamed Sami Cherif; Djamal Habet (ICTAI, 2020)

Understanding the power of Max-SAT resolution through UP-resilience. - Mohamed Sami Cherif; Djamal Habet; André Abramé (Artif. Intell., 2020)

Combining VSIDS and CHB Using Restarts in SAT. - Mohamed Sami Cherif; Djamal Habet; Cyril Terrioux (CP, 2021)

Combining Clause Learning and Branch and Bound for MaxSAT. - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (CP, 2021)

Computing Max-SAT Refutations using SAT Oracles. - Matthieu Py; Mohamed Sami Cherif; Djamal Habet (ICTAI, 2021)

Inferring Clauses and Formulas in Max-SAT. - Matthieu Py; Mohamed Sami Cherif; Djamal Habet (ICTAI, 2021)

A Proof Builder for Max-SAT. - Matthieu Py; Mohamed Sami Cherif; Djamal Habet (SAT, 2021)

Conflict history based heuristic for constraint satisfaction problem solving. - Djamal Habet; Cyril Terrioux (J. Heuristics, 2021)

A Tableau Calculus for MaxSAT Based on Resolution. - Shoulin Li; Jordi Coll; Djamal Habet; Chu-Min Li 001; Felip Manyà (CCIA, 2022)

From Crossing-Free Resolution to Max-SAT Resolution. - Mohamed Sami Cherif; Djamal Habet; Matthieu Py (CP, 2022)

Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (IJCAI, 2022)

Boosting branch-and-bound MaxSAT solvers with clause learning. - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (AI Commun., 2022)

Proofs and Certificates for Max-SAT. - Matthieu Py; Mohamed Sami Cherif; Djamal Habet (J. Artif. Intell. Res., 2022)

A CP Approach for the Liner Shipping Network Design Problem. - Yousra El Ghazi; Djamal Habet; Cyril Terrioux (CP, 2023)

A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. - Shuolin Li; Chu-Min Li 001; Mao Luo; Jordi Coll; Djamal Habet; Felip Manyà (IJCAI, 2023)

Proofs and Certificates for Max-SAT (Extended Abstract). - Matthieu Py; Mohamed Sami Cherif; Djamal Habet (IJCAI, 2023)

A Tableau Calculus for Signed Maximum Satisfiability. - Shuolin Li; Jordi Coll; Djamal Habet; Chu Min Li 001; Felip Manyà (ISMVL, 2023)

Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT. - Shuolin Li; Chu-Min Li 001; Jordi Coll; Djamal Habet; Felip Manyà (AAAI, 2025)

Cargo Routing Optimization in Liner Shipping Networks. - Yousra El Ghazi; Djamal Habet; Cyril Terrioux (CP, 2025)

Solving weighted Maximum Satisfiability with Branch and Bound and clause learning. - Jordi Coll; Chu Min Li 001; Shuolin Li; Djamal Habet; Felip Manyà (Comput. Oper. Res., 2025)