New Algebraic Tools for Constraint Satisfaction. - Henning Schnoor; Ilka Schnoor (Complexity of Constraints, 2006)

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)

Complexity of Default Logic on Generalized Conjunctive Queries. - Philippe Chapdelaine; Miki Hermann; Ilka Schnoor (LPNMR, 2007)

Enumerating All Solutions for Constraint Satisfaction Problems. - Henning Schnoor; Ilka Schnoor (STACS, 2007)

Approximability of Manipulating Elections. - Eric Brelsford; Piotr Faliszewski; Edith Hemaspaandra; Henning Schnoor; Ilka Schnoor (AAAI, 2008)

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

Partial Polymorphisms and Constraint Satisfaction Problems. - Henning Schnoor; Ilka Schnoor (Complexity of Constraints, 2008)

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 weak base method for constraint satisfaction. - Ilka Schnoor (2008)

Generalized modal satisfiability. - Edith Hemaspaandra; Henning Schnoor; Ilka Schnoor (J. Comput. Syst. Sci., 2010)

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

Influence of tree topology restrictions on the complexity of haplotyping with missing data. - Michael Elberfeld; Ilka Schnoor; Till Tantau (Theor. Comput. Sci., 2012)