| 2025 | WADS | On the Enumeration of Signatures of XOR-CNF's. | Nadia Creignou, Oscar Defrain, Frdric Olive, Simon Vilmin |
| 2024 | ECAI | Belief Erasure in Propositional Logic. | Nadia Creignou, Rada Ktari, Odile Papini |
| 2023 | AAAI | Complexity of Reasoning with Cardinality Minimality Conditions. | Nadia Creignou, Frdric Olive, Johannes Schmidt |
| 2022 | MFCS | Enumeration Classes Defined by Circuits. | Nadia Creignou, Arnaud Durand, Heribert Vollmer |
| 2018 | IJCAI | Belief Update in the Horn Fragment. | Nadia Creignou, Adrian Haret, Odile Papini, Stefan Woltran |
| 2017 | ECSQARU | Complexity of Model Checking for Cardinality-Based Belief Revision Operators. | Nadia Creignou, Rada Ktari, Odile Papini |
| 2017 | LATA | On the Complexity of Hard Enumeration Problems. | Nadia Creignou, Markus Krll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer |
| 2016 | ECAI | Belief Contraction Within Fragments of Propositional Logic. | Nadia Creignou, Rada Ktari, Odile Papini |
| 2015 | ECSQARU | Belief Update Within Propositional Fragments. | Nadia Creignou, Rada Ktari, Odile Papini |
| 2015 | LATA | Parameterized Enumeration for Modification Problems. | Nadia Creignou, Rada Ktari, Arne Meier, Julian-Steffen Mller, Frdric Olive, Heribert Vollmer |
| 2014 | ECAI | Belief merging within fragments of propositional logic. | Nadia Creignou, Odile Papini, Stefan Rmmele, Stefan Woltran |
| 2013 | IJCAI | Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? | Nadia Creignou, Reinhard Pichler, Stefan Woltran |
| 2013 | MFCS | Paradigms for Parameterized Enumeration. | Nadia Creignou, Arne Meier, Julian-Steffen Mller, Johannes Schmidt, Heribert Vollmer |
| 2012 | COMMA | Complexity of logic-based argumentation in Schaefer's framework. | Nadia Creignou, Uwe Egly, Johannes Schmidt |
| 2012 | KR | Belief Revision within Fragments of Propositional Logic. | Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran |
| 2012 | SAT | Parameterized Complexity of Weighted Satisfiability Problems. | Nadia Creignou, Heribert Vollmer |
| 2012 | TAP | A Framework for the Specification of Random SAT and QSAT Formulas. | Nadia Creignou, Uwe Egly, Martina Seidl |
| 2011 | SAT | Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. | Nadia Creignou, Frdric Olive, Johannes Schmidt |
| 2010 | JELIA | Sets of Boolean Connectives That Make Argumentation Easier. | Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran |
| 2010 | KR | Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. | Nadia Creignou, Johannes Schmidt, Michael Thomas |
| 2009 | SAT | (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. | Nadia Creignou, Herv Daud, Uwe Egly, Raphal Rossignol |
| 2008 | CSL | Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. | Nadia Creignou, Henning Schnoor, Ilka Schnoor |
| 2008 | SAT | New Results on the Phase Transition for Random Quantified Boolean Formulas. | Nadia Creignou, Herv Daud, Uwe Egly, Raphal Rossignol |
| 2004 | SAT | An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
| 2004 | SAT | An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
| 1992 | CSL | The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. | Nadia Creignou |