Ilka Schnoor

Publication Activity (10 Years)

Years Active: 2006-2012
Publications (10 Years): 0

Top Venues

Theor. Comput. Sci.

University of Hanover, Hannover, Germany (PHD)

Education History

University of Hanover, Hannover, Germany

PHD

Publications

Michael Elberfeld, Ilka Schnoor, Till Tantau
Influence of tree topology restrictions on the complexity of haplotyping with missing data. Theor. Comput. Sci. 432 (2012)
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) (2011)
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized modal satisfiability. J. Comput. Syst. Sci. 76 (7) (2010)
Nadia Creignou, Henning Schnoor, Ilka Schnoor
Nonuniform Boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. 11 (4) (2010)
Michael Elberfeld, Ilka Schnoor, Till Tantau
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. TAMC (2009)
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. Electron. Notes Theor. Comput. Sci. 231 (2009)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic Log. Methods Comput. Sci. 5 (1) (2009)
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized Modal Satisfiability CoRR (2008)
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 (2008)
Henning Schnoor, Ilka Schnoor
Partial Polymorphisms and Constraint Satisfaction Problems. Complexity of Constraints (2008)
Nadia Creignou, Henning Schnoor, Ilka Schnoor
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL (2008)
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. Electron. Colloquium Comput. Complex. 15 (028) (2008)
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Approximability of Manipulating Elections. AAAI (2008)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS (2007)
Philippe Chapdelaine, Miki Hermann, Ilka Schnoor
Complexity of Default Logic on Generalized Conjunctive Queries. LPNMR (2007)
Henning Schnoor, Ilka Schnoor
Enumerating All Solutions for Constraint Satisfaction Problems. STACS (2007)
Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized Modal Satisfiability. STACS (2006)
Henning Schnoor, Ilka Schnoor
New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints (2006)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. 13 (153) (2006)
Henning Schnoor, Ilka Schnoor
Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints (2006)

Ilka Schnoor.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ilka Schnoor