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

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)

Generalized Modal Satisfiability. - Michael Bauland; Edith Hemaspaandra; Henning Schnoor; Ilka Schnoor (STACS, 2006)

The Complexity of Generalized Satisfiability for Linear Temporal Logic. - Michael Bauland; Thomas Schneider 002; Henning Schnoor; Ilka Schnoor; Heribert Vollmer (Electron. Colloquium Comput. Complex., 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)

Complexity results for boolean constraint satisfaction problems. - Michael Bauland (2007)

The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. - Michael Bauland; Martin Mundhenk; Thomas Schneider 002; Henning Schnoor; Ilka Schnoor; Heribert Vollmer (Electron. Colloquium Comput. Complex., 2008)

The complexity of satisfiability problems: Refining Schaefer's theorem. - Eric Allender; Michael Bauland; Neil Immerman; Henning Schnoor; Heribert Vollmer (J. Comput. Syst. Sci., 2009)

Isomorphic Implication. - Michael Bauland; Edith Hemaspaandra (Theory Comput. Syst., 2009)