Henning Schnoor

2009
24	EE	Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. Electr. Notes Theor. Comput. Sci. 231: 277-292 (2009)
23	EE	Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75(4): 245-254 (2009)
2008
22		Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49
21	EE	Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990
20	EE	Nadia Creignou, Henning Schnoor, Ilka Schnoor: Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123
19	EE	Henning Schnoor, Ilka Schnoor: Partial Polymorphisms and Constraint Satisfaction Problems. Complexity of Constraints 2008: 229-254
18	EE	Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics. STACS 2008: 349-360
17	EE	Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics CoRR abs/0802.1884: (2008)
16	EE	Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability CoRR abs/0804.2729: (2008)
15	EE	Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments CoRR abs/0805.0498: (2008)
14	EE	Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic CoRR abs/0812.4848: (2008)
13	EE	Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electronic Colloquium on Computational Complexity (ECCC) 15(028): (2008)
2007
12	EE	Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62
11	EE	Henning Schnoor, Ilka Schnoor: Enumerating All Solutions for Constraint Satisfaction Problems. STACS 2007: 694-705
10	EE	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)
9	EE	Elmar Böhler, Henning Schnoor: The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Theory Comput. Syst. 41(4): 753-777 (2007)
2006
8	EE	Henning Schnoor, Ilka Schnoor: Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints 2006
7	EE	Henning Schnoor, Ilka Schnoor: New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints 2006
6	EE	Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. STACS 2006: 500-511
5	EE	Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electronic Colloquium on Computational Complexity (ECCC) 13(153): (2006)
2005
4	EE	Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82
3	EE	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)
2	EE	Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer: Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)
2004
1	EE	Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Electronic Colloquium on Computational Complexity (ECCC)(100): (2004)

Coauthor Index

1	Eric Allender	[1] [4] [23]
2	Michael Bauland	[1] [3] [4] [5] [6] [10] [12] [13] [14] [15] [23] [24]
3	Elmar Böhler	[2] [3] [9] [10]
4	Eric Brelsford	[22]
5	Nadia Creignou	[3] [10] [20]
6	Piotr Faliszewski	[21] [22]
7	Edith Hemaspaandra (Edith Spaan)	[6] [16] [17] [18] [21] [22]
8	Neil Immerman	[1] [4] [23]
9	Martin Mundhenk	[13] [15] [24]
10	Steffen Reith	[2] [3] [10]
11	Thomas Schneider	[5] [12] [13] [14] [15] [24]
12	Ilka Schnoor	[5] [6] [7] [8] [11] [12] [13] [14] [15] [16] [19] [20] [22] [24]
13	Heribert Vollmer	[1] [2] [3] [4] [5] [10] [12] [13] [14] [15] [23] [24]