50 years Univerity of Lübeck

Dr. Ilka Schnoor

Research


Research interests

  • Complexity of haplotyping problems
  • Constraint satisfaction problems

Publications

2012

  • Michael Elberfeld, Ilka Schnoor, Till Tantau:
    Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data.
    Theoretical Computer Science, 432:38–51, 2012.
    Show PDF | Go to website | Show abstract

2009

  • Michael Elberfeld, Ilka Schnoor, Till Tantau:
    Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data.
    In Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (TAMC 2009), Volume 5532 of Lecture Notes in Computer Science, pp. 201-210. Springer, 2009.
    Show PDF | Go to website | Show abstract

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.
    Electronic Notes in Theoretical Computer Science, 2008 (to appear). To appear.
    Show abstract
  • Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
    Approximability of Manipulating Elections.
    In Proceedings of AAAI Conference on Artificial Intelligence, pp. 44-49. AAAI Press, 2008.
    Show abstract
  • Nadia Creignou, Henning Schnoor, Ilka Schnoor:
    Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.
    In Proceedings of Computer Science Logic, Volume 5213 of Lecture Notes in Computer Science, pp. 109-123. Springer, 2008.
    Show abstract
  • Henning Schnoor, Ilka Schnoor:
    Partial Polymorphisms and Constraint Satisfaction Problems.
    In Complexity of Constraints, Volume 5250 of Lecture Notes in Computer Science, pp. 229-254. Springer, 2008.
    Show abstract
  • Michael Elberfeld, Ilka Schnoor, Till Tantau:
    Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data.
    Technical report SIIM-TR-A-08-05, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2008.
    Show PDF | Show abstract

2007

  • Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
    The Complexity of Generalized Satisfiability for Linear Temporal Logic.
    In Proceedings of FOSSACS, Volume 4423 of Lecture Notes in Computer Science, pp. 46-62. Springer, 2007.
    Show abstract
  • Phillipe Chapdelaine,, Miki Hermann, Ilka Schnoor:
    Complexity of Default Logic on Generalized Conjunctive Queries.
    In Proceedings of LPNMR, Volume 4483 of Lecture Notes in Artificial Intelligence, pp. 58-70. Springer, 2007.
    Show abstract
  • Henning Schnoor, Ilka Schnoor:
    Enumerating All Solutions for Constraint Satisfaction Problems.
    In Proceedings of STACS, Volume 4393 of Lecture Notes in Computer Science, pp. 694-705. Springer, 2007.
    Show abstract

2006

  • Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
    Generalized Modal Satisfiability.
    In Proceedings of STACS, Volume 3884 of Lecture Notes in Computer Science, pp. 500-511. Springer, 2006.
    Show abstract