 | 2009 |
| 16 |  | Michael Elberfeld,
Ilka Schnoor,
Till Tantau:
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data.
TAMC 2009: 201-210 |
| 15 |  | 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) |
| 2008 |
| 14 |  | Eric Brelsford,
Piotr Faliszewski,
Edith Hemaspaandra,
Henning Schnoor,
Ilka Schnoor:
Approximability of Manipulating Elections.
AAAI 2008: 44-49 |
| 13 |  | Nadia Creignou,
Henning Schnoor,
Ilka Schnoor:
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.
CSL 2008: 109-123 |
| 12 |  | Henning Schnoor,
Ilka Schnoor:
Partial Polymorphisms and Constraint Satisfaction Problems.
Complexity of Constraints 2008: 229-254 |
| 11 |  | Edith Hemaspaandra,
Henning Schnoor,
Ilka Schnoor:
Generalized Modal Satisfiability
CoRR abs/0804.2729: (2008) |
| 10 |  | 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) |
| 9 |  | 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) |
| 8 |  | Michael Bauland,
Thomas Schneider,
Henning Schnoor,
Ilka Schnoor,
Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Logical Methods in Computer Science 5(1): (2008) |
| 2007 |
| 7 |  | Michael Bauland,
Thomas Schneider,
Henning Schnoor,
Ilka Schnoor,
Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
FoSSaCS 2007: 48-62 |
| 6 |  | Philippe Chapdelaine,
Miki Hermann,
Ilka Schnoor:
Complexity of Default Logic on Generalized Conjunctive Queries.
LPNMR 2007: 58-70 |
| 5 |  | Henning Schnoor,
Ilka Schnoor:
Enumerating All Solutions for Constraint Satisfaction Problems.
STACS 2007: 694-705 |
| 2006 |
| 4 |  | Henning Schnoor,
Ilka Schnoor:
Enumerating all Solutions for Constraint Satisfaction Problems.
Complexity of Constraints 2006 |
| 3 |  | Henning Schnoor,
Ilka Schnoor:
New Algebraic Tools for Constraint Satisfaction.
Complexity of Constraints 2006 |
| 2 |  | Michael Bauland,
Edith Hemaspaandra,
Henning Schnoor,
Ilka Schnoor:
Generalized Modal Satisfiability.
STACS 2006: 500-511 |
| 1 |  | 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) |