- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j6 |      | Michael Elberfeld, Ilka Schnoor, Till Tantau: Influence of tree topology restrictions on the complexity of haplotyping with missing data. Theor. Comput. Sci. 432: 38-51 (2012) |
| 2011 | ||
| j5 | | 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. ACM Trans. Comput. Log. 12(2): 13 (2011) |
| 2010 | ||
| j4 | | Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized modal satisfiability. J. Comput. Syst. Sci. 76(7): 561-578 (2010) |
| j3 | | Nadia Creignou, Henning Schnoor, Ilka Schnoor: Nonuniform Boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. 11(4) (2010) |
| 2009 | ||
| j2 | | 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) (2009) |
| j1 | | 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) |
| c10 | | Michael Elberfeld, Ilka Schnoor, Till Tantau: Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. TAMC 2009: 201-210 |
| 2008 | ||
| b1 | | Ilka Schnoor: The weak base method for constraint satisfaction. University of Hanover 2008, pp. 1-107 |
| c9 | | Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49 |
| c8 | | Nadia Creignou, Henning Schnoor, Ilka Schnoor: Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123 |
| c7 | | Henning Schnoor, Ilka Schnoor: Partial Polymorphisms and Constraint Satisfaction Problems. Complexity of Constraints 2008: 229-254 |
| i4 | | Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. CoRR abs/0804.2729 (2008) |
| i3 | | 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) |
| i2 | | 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 | ||
| c6 | | Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62 |
| c5 | | Philippe Chapdelaine, Miki Hermann, Ilka Schnoor: Complexity of Default Logic on Generalized Conjunctive Queries. LPNMR 2007: 58-70 |
| c4 | | Henning Schnoor, Ilka Schnoor: Enumerating All Solutions for Constraint Satisfaction Problems. STACS 2007: 694-705 |
| 2006 | ||
| c3 | | Henning Schnoor, Ilka Schnoor: Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints 2006 |
| c2 | | Henning Schnoor, Ilka Schnoor: New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints 2006 |
| c1 | | Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. STACS 2006: 500-511 |
| i1 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page