Évaluation des méthodes d'achèvement par parties. - Olivier Roussel; Philippe Mathieu (JFPLC, 1995)

A New Method for Knowledge Compilation: The Achievement by Cycle Search. - Olivier Roussel; Philippe Mathieu (CADE, 1996)

Une nouvelle méthode de compilation logique: l'achèvement par cycles. - Olivier Roussel; Philippe Mathieu (JFPLC, 1996)

Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case. - Olivier Roussel; Philippe Mathieu (CADE, 1997)

Une compilation logique exacte en calcul des prédicats: le cas de l'achèvement partiel. - Olivier Roussel; Philippe Mathieu (JFPLC, 1997)

Redundancy in Random SAT Formulas. - Yacine Boufkhad; Olivier Roussel (AAAI/IAAI, 2000)

The Achievement of Knowledge Bases by Cycle Search. - Olivier Roussel; Philippe Mathieu (Inf. Comput., 2000)

Another SAT to CSP Conversion. - Olivier Roussel (ICTAI, 2004)

A Translation of Pseudo Boolean Constraints to SAT. - Olivier Bailleux; Yacine Boufkhad; Olivier Roussel (J. Satisf. Boolean Model. Comput., 2006)

The First Evaluation of Pseudo-Boolean Solvers (PB'05). - Vasco M. Manquinho; Olivier Roussel (J. Satisf. Boolean Model. Comput., 2006)

A Decomposition Technique for Max-CSP. - Hachemi Bennaceur; Christophe Lecoutre; Olivier Roussel (ECAI, 2008)

An adaptive multiresolution scheme with local time stepping for evolutionary PDEs. - Margarete O. Domingues; Sônia M. Gomes; Olivier Roussel; Kai Schneider (J. Comput. Phys., 2008)

Failed Value Consistencies for Constraint Satisfaction. - Christophe Lecoutre; Olivier Roussel (CP, 2009)

New Encodings of Pseudo-Boolean Constraints into CNF. - Olivier Bailleux; Yacine Boufkhad; Olivier Roussel (SAT, 2009)

XML Representation of Constraint Networks: Format XCSP 2.1 - Olivier Roussel; Christophe Lecoutre (CoRR, 2009)

Boltzmann sampling of ordered structures. - Olivier Roussel; Michèle Soria (Electron. Notes Discret. Math., 2009)

Pseudo-Boolean and Cardinality Constraints. - Olivier Roussel; Vasco Manquinho (Handbook of Satisfiability, 2009)

Promoting robust black-box solvers through competitions. - Christophe Lecoutre; Olivier Roussel; Marc R. C. van Dongen (Constraints An Int. J., 2010)

Coherent Vortex Simulation of weakly compressible turbulent mixing layers using adaptive multiresolution methods. - Olivier Roussel; Kai Schneider (J. Comput. Phys., 2010)

Controlling a Solver Execution with the runsolver Tool. - Olivier Roussel (J. Satisf. Boolean Model. Comput., 2011)

Behind the Scene of Solvers Competitions: the "evaluation" Experience. - Olivier Roussel (COMPARE, 2012)

Propagating Soft Table Constraints. - Christophe Lecoutre; Nicolas Paris; Olivier Roussel; Sébastien Tabary (CP, 2012)

WCSP Integration of Soft Neighborhood Substitutability. - Christophe Lecoutre; Olivier Roussel; Djamel E. Dehani (CP, 2012)

The International SAT Solver Competitions. - Matti Järvisalo; Daniel Le Berre; Olivier Roussel; Laurent Simon 001 (AI Mag., 2012)

Boltzmann samplers for first-order differential specifications. - Olivier Bodini; Olivier Roussel; Michèle Soria (Discret. Appl. Math., 2012)

Boys-and-girls Birthdays and Hadamard Products. - Olivier Bodini; Danièle Gardy; Olivier Roussel (Fundam. Informaticae, 2012)

Solving WCSP by Extraction of Minimal Unsatisfiable Cores. - Christophe Lecoutre; Nicolas Paris; Olivier Roussel; Sébastien Tabary (ICTAI, 2013)

Robust and Scalable Navmesh Generation. - Guillaume Saupin; Olivier Roussel; Jérémie Le Garrec (WSCG, 2013)

Efficient motion planning for quasi-static elastic rods using geometry neighborhood approximation. - Olivier Roussel; Michel Taïx; Timothy Bretl (AIM, 2014)

Sliced Table Constraints: Combining Compression and Tabular Reduction. - Nebras Gharbi; Fred Hemery; Christophe Lecoutre; Olivier Roussel (CPAIOR, 2014)

Manipulation planning with contacts for an extensible elastic rod by sampling on the submanifold of static equilibrium configurations. - Olivier Roussel; Andy Borum; Michel Taïx; Timothy Bretl (ICRA, 2015)

Planification de mouvement pour tiges élastiques. (Motion planning for elastic rods ). - Olivier Roussel (2015)

On the accuracy and efficiency of point-value multiresolution algorithms for solving scalar wave and Euler equations. - V. Soni; Olivier Roussel; Abdellah Hadjadj (J. Comput. Appl. Math., 2017)

MoCaNA, un agent de n{é}gociation automatique utilisant la recherche arborescente de Monte-Carlo. - Cédric L. R. Buron; Zahia Guessoum; Sylvain Ductor; Olivier Roussel (CoRR, 2018)

Motion planning in Irreducible Path Spaces. - Andreas Orthey; Olivier Roussel; Olivier Stasse; Michel Taïx (Robotics Auton. Syst., 2018)

Proceedings of the 2018 XCSP3 Competition. - Christophe Lecoutre; Olivier Roussel (CoRR, 2019)

Parallel multi-core and multi-processor methods on point-value multiresolution algorithms for hyperbolic conservation laws. - V. Soni; Abdellah Hadjadj; Olivier Roussel; G. Moebs (J. Parallel Distributed Comput., 2019)

XCSP3 and its ecosystem. - Gilles Audemard; Frédéric Boussemart; Christophe Lecoutre; Cédric Piette; Olivier Roussel (Constraints An Int. J., 2020)

Motion Planning for an Elastic Rod Using Contacts. - Olivier Roussel; Pierre Fernbach; Michel Taïx (IEEE Trans Autom. Sci. Eng., 2020)

Pseudo-Boolean and Cardinality Constraints. - Olivier Roussel; Vasco Manquinho (Handbook of Satisfiability, 2021)

Identifying Soft Cores in Propositional Formulæ. - Gilles Audemard; Jean-Marie Lagniez; Marie Miceli; Olivier Roussel (ICAART (2), 2022)

MoCaNA, un agent de négociation automatique utilisant la recherche arborescente de Monte-Carlo. - Cédric L. R. Buron; Zahia Guessoum; Sylvain Ductor; Olivier Roussel (Rev. Ouverte Intell. Artif., 2022)

Compressing UNSAT Search Trees with Caching. - Anthony Blomme; Daniel Le Berre; Anne Parrain; Olivier Roussel (ICAART (3), 2023)

Compressing UNSAT CDCL Trees with Caching. - Anthony Blomme; Daniel Le Berre; Anne Parrain; Olivier Roussel (ICAART (3), 2024)