Ilka Schnoor - RankMe

21 papers A* 1A 2B 3C 1Journal 9Unranked 4

Year	Rank	Type	Title / Venue / Authors
2012	J	`jnl`	Influence of tree topology restrictions on the complexity of haplotyping with missing data. Theor. Comput. Sci. Michael Elberfeld, Ilka Schnoor, Till Tantau
2011	J	`jnl`	The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2010	J	`jnl`	Generalized modal satisfiability. J. Comput. Syst. Sci. Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2010	J	`jnl`	Nonuniform Boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. Nadia Creignou, Henning Schnoor, Ilka Schnoor
2009	C	`conf`	Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. TAMC Michael Elberfeld, Ilka Schnoor, Till Tantau
2009	J	`jnl`	The Complexity of Generalized Satisfiability for Linear Temporal Logic Log. Methods Comput. Sci. Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2008	A*	`conf`	Approximability of Manipulating Elections. AAAI Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2008	J	`jnl`	Generalized Modal Satisfiability CoRR Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2008	B	`conf`	Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL Nadia Creignou, Henning Schnoor, Ilka Schnoor
2008	—	`conf`	Partial Polymorphisms and Constraint Satisfaction Problems. Complexity of Constraints Henning Schnoor, Ilka Schnoor
2008	J	`jnl`	The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments CoRR Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2008	J	`jnl`	The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electron. Colloquium Comput. Complex. Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2008	—	`—`	The weak base method for constraint satisfaction. Ilka Schnoor
2007	B	`conf`	Complexity of Default Logic on Generalized Conjunctive Queries. LPNMR Philippe Chapdelaine, Miki Hermann, Ilka Schnoor
2007	A	`conf`	Enumerating All Solutions for Constraint Satisfaction Problems. STACS Henning Schnoor, Ilka Schnoor
2007	B	`conf`	The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2007	—	`conf`	The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. M4M Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2006	—	`conf`	Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints Henning Schnoor, Ilka Schnoor
2006	A	`conf`	Generalized Modal Satisfiability. STACS Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2006	—	`conf`	New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints Henning Schnoor, Ilka Schnoor
2006	J	`jnl`	The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer