The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. - Nadia Creignou (CSL, 1992)

A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. - Nadia Creignou (J. Comput. Syst. Sci., 1995)

The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. - Nadia Creignou (Theor. Comput. Sci., 1995)

Exact Complexity of Problems of Incompletely Specified Automata. - Nadia Creignou (Ann. Math. Artif. Intell., 1996)

Complexity of Generalized Satisfiability Counting Problems. - Nadia Creignou; Miki Hermann (Inf. Comput., 1996)

On Generating All Solutions of Generalized Satisfiability Problems. - Nadia Creignou; Jean-Jacques Hébrard (RAIRO Theor. Informatics Appl., 1997)

Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. - Nadia Creignou; Malika More (J. Log. Comput., 1997)

Complexity Versus Stability for Classes of Propositional Formulas. - Nadia Creignou (Inf. Process. Lett., 1998)

Satisfiability Threshold for Random XOR-CNF Formulas. - Nadia Creignou; Hervé Daudé (Discret. Appl. Math., 1999)

Complexity classifications of Boolean constraint satisfaction problems. - Nadia Creignou; Sanjeev Khanna; Madhu Sudan 001 (SIAM, 2001)

Approximating The Satisfiability Threshold For Random K-Xor-Formulas. - Nadia Creignou; Hervé Daudé; Olivier Dubois 002 (Comb. Probab. Comput., 2003)

Smooth and sharp thresholds for random k-XOR-CNF satisfiability. - Nadia Creignou; Hervé Daudé (RAIRO Theor. Informatics Appl., 2003)

Generalized satisfiability problems: minimal elements and phase transitions. - Nadia Creignou; Hervé Daudé (Theor. Comput. Sci., 2003)

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. - Michael Bauland; Philippe Chapdelaine; Nadia Creignou; Miki Hermann; Heribert Vollmer (SAT (Selected Papers, 2004)

Combinatorial sharpness criterion and phase transition classification for random CSPs. - Nadia Creignou; Hervé Daudé (Inf. Comput., 2004)

The complexity of Boolean constraint satisfaction local search problems. - Philippe Chapdelaine; Nadia Creignou (Ann. Math. Artif. Intell., 2005)

A sharp threshold for the renameable-Horn and the q-Horn properties. - Nadia Creignou; Hervé Daudé; John V. Franco (Discret. Appl. Math., 2005)

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation - Michael Bauland; Elmar Böhler; Nadia Creignou; Steffen Reith; Henning Schnoor; Heribert Vollmer (Electron. Colloquium Comput. Complex., 2005)

Preferred representations of Boolean relations - Nadia Creignou; Phokion G. Kolaitis; Bruno Zanuttini (Electron. Colloquium Comput. Complex., 2005)

06401 Executive Summary - Complexity of Constraints. - Nadia Creignou; Phokion G. Kolaitis; Heribert Vollmer (Complexity of Constraints, 2006)

06401 Abstracts Collection - Complexity of Constraints. - Nadia Creignou; Phokion G. Kolaitis; Heribert Vollmer (Complexity of Constraints, 2006)

A Complete Classification of the Complexity of Propositional Abduction. - Nadia Creignou; Bruno Zanuttini (SIAM J. Comput., 2006)

The Complexity of Problems for Quantified Constraints. - Heribert Vollmer; Michael Bauland; Elmar Böhler; Nadia Creignou; Steffen Reith; Henning Schnoor (Electron. Colloquium Comput. Complex., 2007)

Phase Transition for Random Quantified XOR-Formulas. - Nadia Creignou; Hervé Daudé; Uwe Egly (J. Artif. Intell. Res., 2007)

Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. - Nadia Creignou; Henning Schnoor; Ilka Schnoor (CSL, 2008)

Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. - Nadia Creignou; Heribert Vollmer (Complexity of Constraints, 2008)

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. - Victor Chepoi; Nadia Creignou; Miki Hermann; Gernot Salzer (ISMVL, 2008)

New Results on the Phase Transition for Random Quantified Boolean Formulas. - Nadia Creignou; Hervé Daudé; Uwe Egly; Raphaël Rossignol (SAT, 2008)

Structure identification of Boolean relations and plain bases for co-clones. - Nadia Creignou; Phokion G. Kolaitis; Bruno Zanuttini (J. Comput. Syst. Sci., 2008)

Complexity of Clausal Constraints Over Chains. - Nadia Creignou; Miki Hermann; Andrei A. Krokhin; Gernot Salzer (Theory Comput. Syst., 2008)

(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. - Nadia Creignou; Hervé Daudé; Uwe Egly; Raphaël Rossignol (SAT, 2009)

The threshold for random (1,2)-QSAT - Nadia Creignou; Hervé Daudé; Uwe Egly; Raphaël Rossignol (CoRR, 2009)

The SAT-UNSAT transition for random constraint satisfaction problems. - Nadia Creignou; Hervé Daudé (Discret. Math., 2009)

Sets of Boolean Connectives That Make Argumentation Easier. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001; Stefan Woltran (JELIA, 2010)

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001 (KR, 2010)

Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems - Elmar Böhler; Nadia Creignou; Matthias Galota; Steffen Reith; Henning Schnoor; Heribert Vollmer (Log. Methods Comput. Sci., 2010)

The Helly property and satisfiability of Boolean formulas defined on set families. - Victor Chepoi; Nadia Creignou; Miki Hermann; Gernot Salzer (Eur. J. Comb., 2010)

Nonuniform Boolean constraint satisfaction problems with cardinality constraint. - Nadia Creignou; Henning Schnoor; Ilka Schnoor (ACM Trans. Comput. Log., 2010)

Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. - Nadia Creignou; Frédéric Olive; Johannes Schmidt 001 (SAT, 2011)

Complexity of logic-based argumentation in Post's framework. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001; Stefan Woltran (Argument Comput., 2011)

Complexity of logic-based argumentation in Schaefer's framework. - Nadia Creignou; Uwe Egly; Johannes Schmidt 001 (COMMA, 2012)

Parameterized Complexity of Weighted Satisfiability Problems. - Nadia Creignou; Heribert Vollmer (SAT, 2012)

A Framework for the Specification of Random SAT and QSAT Formulas. - Nadia Creignou; Uwe Egly; Martina Seidl (TAP@TOOLS, 2012)

SAT Interactions (Dagstuhl Seminar 12471). - Nadia Creignou; Nicola Galesi; Oliver Kullmann; Heribert Vollmer (Dagstuhl Reports, 2012)

Complexity Classifications for Propositional Abduction in Post's Framework. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001 (J. Log. Comput., 2012)

The Complexity of Reasoning for Fragments of Autoepistemic Logic. - Nadia Creignou; Arne Meier; Heribert Vollmer; Michael Thomas 001 (ACM Trans. Comput. Log., 2012)

Parameterized Enumeration with Ordering. - Nadia Creignou; Raïda Ktari; Arne Meier; Julian-Steffen Müller; Frédéric Olive; Heribert Vollmer (CoRR, 2013)

Sensitivity of Boolean formulas. - Nadia Creignou; Hervé Daudé (Eur. J. Comb., 2013)

Belief revision within fragments of propositional logic. - Nadia Creignou; Odile Papini; Reinhard Pichler; Stefan Woltran (J. Comput. Syst. Sci., 2014)

Complexity Classifications for Logic-Based Argumentation. - Nadia Creignou; Uwe Egly; Johannes Schmidt 001 (ACM Trans. Comput. Log., 2014)

Parameterized Enumeration for Modification Problems. - Nadia Creignou; Raïda Ktari; Arne Meier; Julian-Steffen Müller; Frédéric Olive; Heribert Vollmer (LATA, 2015)

Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. - Nadia Creignou; Heribert Vollmer (Fundam. Informaticae, 2015)

Exact location of the phase transition for random (1, 2)-QSAT. - Nadia Creignou; Hervé Daudé; Uwe Egly; Raphaël Rossignol (RAIRO Theor. Informatics Appl., 2015)

Belief Contraction Within Fragments of Propositional Logic. - Nadia Creignou; Raïda Ktari; Odile Papini (ECAI, 2016)

SAT and Interactions (Dagstuhl Seminar 16381). - Olaf Beyersdorff; Nadia Creignou; Uwe Egly; Heribert Vollmer (Dagstuhl Reports, 2016)

Belief Merging within Fragments of Propositional Logic. - Nadia Creignou; Odile Papini; Stefan Rümmele; Stefan Woltran (ACM Trans. Comput. Log., 2016)

Complexity of Model Checking for Cardinality-Based Belief Revision Operators. - Nadia Creignou; Raïda Ktari; Odile Papini (ECSQARU, 2017)

On the Complexity of Hard Enumeration Problems. - Nadia Creignou; Markus Kröll; Reinhard Pichler; Sebastian Skritek; Heribert Vollmer (LATA, 2017)

Paradigms for Parameterized Enumeration. - Nadia Creignou; Arne Meier; Julian-Steffen Müller; Johannes Schmidt 001; Heribert Vollmer (Theory Comput. Syst., 2017)

Belief Update in the Horn Fragment. - Nadia Creignou; Adrian Haret; Odile Papini; Stefan Woltran (IJCAI, 2018)

Belief Update within Propositional Fragments. - Nadia Creignou; Raïda Ktari; Odile Papini (J. Artif. Intell. Res., 2018)

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? - Nadia Creignou; Reinhard Pichler; Stefan Woltran (Log. Methods Comput. Sci., 2018)

Parameterised Enumeration for Modification Problems. - Nadia Creignou; Raïda Ktari; Arne Meier; Julian-Steffen Müller; Frédéric Olive; Heribert Vollmer (Algorithms, 2019)

A complexity theory for hard enumeration problems. - Nadia Creignou; Markus Kröll; Reinhard Pichler; Sebastian Skritek; Heribert Vollmer (Discret. Appl. Math., 2019)

Locally definable vertex set properties are efficiently enumerable. - Sarah Blind; Nadia Creignou; Frédéric Olive (Discret. Appl. Math., 2021)

Enumeration Classes Defined by Circuits. - Nadia Creignou; Arnaud Durand 001; Heribert Vollmer (MFCS, 2022)

Belief contraction and erasure in fragments of propositional logic. - Nadia Creignou; Raïda Ktari; Odile Papini (J. Log. Comput., 2022)

Complexity of Reasoning with Cardinality Minimality Conditions. - Nadia Creignou; Frédéric Olive; Johannes Schmidt 001 (AAAI, 2023)

Belief Erasure in Propositional Logic. - Nadia Creignou; Raïda Ktari; Odile Papini (ECAI, 2024)

Effacement des croyances en logique propositionnelle. - Nadia Creignou; Raïda Ktari; Odile Papini (JIAF-JFPDA, 2024)

Special issue on logic and complexity. - Nadia Creignou; Arnaud Durand 001; Heribert Vollmer (Math. Struct. Comput. Sci., 2024)

On the Enumeration of Signatures of XOR-CNF's. - Nadia Creignou; Oscar Defrain; Frédéric Olive; Simon Vilmin (WADS, 2025)