Nadia Creignou Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. SAT 2009: 363-376
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: The threshold for random (1,2)-QSAT CoRR abs/0907.0937: (2009)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Johannes Schmidt, Michael Thomas: Complexity of Propositional Abduction for Restricted Sets of Boolean Functions CoRR abs/0912.3134: (2009)
2008
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Springer 2008
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Henning Schnoor, Ilka Schnoor: Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Heribert Vollmer: Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVictor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: New Results on the Phase Transition for Random Quantified Boolean Formulas. SAT 2008: 34-47
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia 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)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer: Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42(2): 239-255 (2008)
2007
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert 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)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé, Uwe Egly: Phase Transition for Random Quantified XOR-Formulas. J. Artif. Intell. Res. (JAIR) 29: 1-18 (2007)
2006
24no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: Complexity of Constraints, 01.10. - 06.10.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Bruno Zanuttini: A Complete Classification of the Complexity of Propositional Abduction. SIAM J. Comput. 36(1): 207-229 (2006)
2005
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPhilippe Chapdelaine, Nadia Creignou: The complexity of Boolean constraint satisfaction local search problems. Ann. Math. Artif. Intell. 43(1): 51-63 (2005)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia 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)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Preferred representations of Boolean relations Electronic Colloquium on Computational Complexity (ECCC)(119): (2005)
2004
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé: Combinatorial sharpness criterion and phase transition classification for random CSPs. Inf. Comput. 190(2): 220-238 (2004)
2003
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé, Olivier Dubois: Approximating The Satisfiability Threshold For Random K-Xor-Formulas. Combinatorics, Probability & Computing 12(2): (2003)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé: Smooth and sharp thresholds for random k-XOR-CNF satisfiability. ITA 37(2): 127-147 (2003)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé: Generalized satisfiability problems: minimal elements and phase transitions. Theor. Comput. Sci. 302(1-3): 417-430 (2003)
2001
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé, Olivier Dubois: Approximating the satisfiability threshold for random k-XOR-formulas CoRR cs.DM/0106001: (2001)
1999
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Hervé Daudé: Satisfiability Threshold for Random XOR-CNF Formulas. Discrete Applied Mathematics 96-97: 41-53 (1999)
1998
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou: Complexity Versus Stability for Classes of Propositional Formulas. Inf. Process. Lett. 68(4): 161-165 (1998)
1997
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Jean-Jacques Hébrard: On Generating All Solutions of Generalized Satisfiability Problems. ITA 31(6): 499-511 (1997)
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Malika More: Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. J. Log. Comput. 7(3): 353-366 (1997)
1996
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou: Exact Complexity of Problems of Incompletely Specified Automata. Ann. Math. Artif. Intell. 16: 237-249 (1996)
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Miki Hermann: Complexity of Generalized Satisfiability Counting Problems. Inf. Comput. 125(1): 1-12 (1996)
1995
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou: A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. J. Comput. Syst. Sci. 51(3): 511-522 (1995)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia 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

1Michael Bauland [15] [16] [18] [26]
2Elmar Böhler [18] [26]
3Philippe Chapdelaine [15] [16] [20]
4Victor Chepoi [30]
5Hervé Daudé [9] [10] [11] [12] [13] [14] [19] [25] [29] [35] [36]
6Olivier Dubois [10] [13]
7Uwe Egly [25] [29] [35] [36]
8John V. Franco [19]
9Jean-Jacques Hébrard [7]
10Miki Hermann [4] [15] [16] [27] [30]
11Phokion G. Kolaitis [17] [22] [23] [24] [28] [33]
12Andrei A. Krokhin [27]
13Malika More [6]
14Steffen Reith [18] [26]
15Raphaël Rossignol [29] [35] [36]
16Gernot Salzer [27] [30]
17Johannes Schmidt [34]
18Henning Schnoor [18] [26] [32]
19Ilka Schnoor [32]
20Michael Thomas [34]
21Heribert Vollmer [15] [16] [18] [22] [23] [24] [26] [31] [33]
22Bruno Zanuttini [17] [21] [28]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)