Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nadia Creignou
2010 – today
- 2013
[j27]- [c19]Nadia Creignou, Reinhard Pichler, Stefan Woltran: Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? IJCAI 2013
- [c18]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer: Paradigms for Parameterized Enumeration. MFCS 2013: 290-301
- [i13]Nadia Creignou, Uwe Egly, Johannes Schmidt: Complexity Classifications for logic-based Argumentation. CoRR abs/1304.5388 (2013)
- [i12]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer: Paradigms for Parameterized Enumeration. CoRR abs/1306.2171 (2013)
- [i11]Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer: Parameterized Enumeration with Ordering. CoRR abs/1309.5009 (2013)
- 2012
- [j26]Nadia Creignou, Johannes Schmidt, Michael Thomas: Complexity Classifications for Propositional Abduction in Post's Framework. J. Log. Comput. 22(5): 1145-1170 (2012)
- [j25]Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas: The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13(2): 17 (2012)
- [c17]Nadia Creignou, Uwe Egly, Johannes Schmidt: Complexity of logic-based argumentation in Schaefer's framework. COMMA 2012: 237-248
- [c16]Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran: Belief Revision within Fragments of Propositional Logic. KR 2012
- [c15]Nadia Creignou, Heribert Vollmer: Parameterized Complexity of Weighted Satisfiability Problems. SAT 2012: 341-354
- [c14]Nadia Creignou, Uwe Egly, Martina Seidl: A Framework for the Specification of Random SAT and QSAT Formulas. TAP 2012: 163-168
- [i10]Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer: SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012)
- 2011
- [j24]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran: Complexity of logic-based argumentation in Post's framework. Argument & Computation 2(2-3): 107-129 (2011)
- [c13]Nadia Creignou, Frédéric Olive, Johannes Schmidt: Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. SAT 2011: 120-133
- [i9]Nadia Creignou, Hervé Daudé, Uwe Egly: Phase Transition for Random Quantified XOR-Formulas. CoRR abs/1110.2739 (2011)
- 2010
- [j23]Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer: Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems. Logical Methods in Computer Science 8(3) (2010)
- [j22]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: The Helly property and satisfiability of Boolean formulas defined on set families. Eur. J. Comb. 31(2): 502-516 (2010)
- [j21]Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer: The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47(2): 454-490 (2010)
- [j20]Nadia Creignou, Henning Schnoor, Ilka Schnoor: Nonuniform Boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. 11(4) (2010)
- [c12]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran: Sets of Boolean Connectives That Make Argumentation Easier. JELIA 2010: 117-129
- [c11]Nadia Creignou, Johannes Schmidt, Michael Thomas: Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. KR 2010
- [i8]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Autoepistemic Logic. CoRR abs/1006.0220 (2010)
- [i7]Nadia Creignou, Johannes Schmidt, Michael Thomas: Complexity Classifications for Propositional Abduction in Post's Framework. CoRR abs/1006.4923 (2010)
2000 – 2009
- 2009
- [j19]Nadia Creignou, Hervé Daudé: The SAT-UNSAT transition for random constraint satisfaction problems. Discrete Mathematics 309(8): 2085-2099 (2009)
- [c10]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. SAT 2009: 363-376
- [i6]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: The threshold for random (1,2)-QSAT. CoRR abs/0907.0937 (2009)
- [i5]Nadia Creignou, Johannes Schmidt, Michael Thomas: Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. CoRR abs/0912.3134 (2009)
- 2008
- [j18]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74(7): 1103-1115 (2008)
- [j17]Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer: Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42(2): 239-255 (2008)
- [c9]Nadia Creignou, Henning Schnoor, Ilka Schnoor: Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123
- [c8]Nadia Creignou, Heribert Vollmer: Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37
- [c7]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105
- [c6]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: New Results on the Phase Transition for Random Quantified Boolean Formulas. SAT 2008: 34-47
- [e2]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (Eds.): Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Lecture Notes in Computer Science 5250, Springer 2008, ISBN 978-3-540-92799-0
- 2007
- [j16]Nadia Creignou, Hervé Daudé, Uwe Egly: Phase Transition for Random Quantified XOR-Formulas. J. Artif. Intell. Res. (JAIR) 29: 1-18 (2007)
- [i4]Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor: The Complexity of Problems for Quantified Constraints. Electronic Colloquium on Computational Complexity (ECCC) 14(023) (2007)
- 2006
- [j15]Nadia Creignou, Bruno Zanuttini: A Complete Classification of the Complexity of Propositional Abduction. SIAM J. Comput. 36(1): 207-229 (2006)
- [c5]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006
- [c4]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006
- [e1]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (Eds.): Complexity of Constraints, 01.10. - 06.10.2006. Dagstuhl Seminar Proceedings 06401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- 2005
- [j14]Philippe Chapdelaine, Nadia Creignou: The complexity of Boolean constraint satisfaction local search problems. Ann. Math. Artif. Intell. 43(1): 51-63 (2005)
- [j13]Nadia Creignou, Hervé Daudé, John V. Franco: A sharp threshold for the renameable-Horn and the q-Horn properties. Discrete Applied Mathematics 153(1-3): 48-57 (2005)
- [i3]Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer: Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electronic Colloquium on Computational Complexity (ECCC)(024) (2005)
- [i2]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Preferred representations of Boolean relations. Electronic Colloquium on Computational Complexity (ECCC)(119) (2005)
- 2004
- [j12]Nadia Creignou, Hervé Daudé: Combinatorial sharpness criterion and phase transition classification for random CSPs. Inf. Comput. 190(2): 220-238 (2004)
- [c3]Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004
- [c2]Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers 2004: 30-45
- 2003
- [j11]Nadia Creignou, Hervé Daudé, Olivier Dubois: Approximating The Satisfiability Threshold For Random K-Xor-Formulas. Combinatorics, Probability & Computing 12(2): 113-126 (2003)
- [j10]Nadia Creignou, Hervé Daudé: Smooth and sharp thresholds for random k-XOR-CNF satisfiability. ITA 37(2): 127-147 (2003)
- [j9]Nadia Creignou, Hervé Daudé: Generalized satisfiability problems: minimal elements and phase transitions. Theor. Comput. Sci. 302(1-3): 417-430 (2003)
- 2001
- [i1]Nadia Creignou, Hervé Daudé, Olivier Dubois: Approximating the satisfiability threshold for random k-XOR-formulas. CoRR cs.DM/0106001 (2001)
1990 – 1999
- 1999
- [j8]Nadia Creignou, Hervé Daudé: Satisfiability Threshold for Random XOR-CNF Formulas. Discrete Applied Mathematics 96-97: 41-53 (1999)
- 1998
- [j7]Nadia Creignou: Complexity Versus Stability for Classes of Propositional Formulas. Inf. Process. Lett. 68(4): 161-165 (1998)
- 1997
- [j6]Nadia Creignou, Jean-Jacques Hébrard: On Generating All Solutions of Generalized Satisfiability Problems. ITA 31(6): 499-511 (1997)
- [j5]Nadia Creignou, Malika More: Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. J. Log. Comput. 7(3): 353-366 (1997)
- 1996
- [j4]Nadia Creignou: Exact Complexity of Problems of Incompletely Specified Automata. Ann. Math. Artif. Intell. 16: 237-249 (1996)
- [j3]Nadia Creignou, Miki Hermann: Complexity of Generalized Satisfiability Counting Problems. Inf. Comput. 125(1): 1-12 (1996)
- 1995
- [j2]Nadia Creignou: A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. J. Comput. Syst. Sci. 51(3): 511-522 (1995)
- [j1]Nadia Creignou: The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. Theor. Comput. Sci. 145(1&2): 111-145 (1995)
- 1992
- [c1]Nadia Creignou: The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. CSL 1992: 115-133
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:27 CEST by the dblp team