Copeland voting: Ties matter P Faliszewski, E Hemaspaandra, H Schnoor Proceedings of the 7th international joint conference on Autonomous agents …, 2008 | 127 | 2008 |

Approximability of manipulating elections E Brelsford, P Faliszewski, E Hemaspaandra, H Schnoor, I Schnoor Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 44-49, 2008 | 68 | 2008 |

Bases for Boolean co-clones E Böhler, S Reith, H Schnoor, H Vollmer Information Processing Letters 96 (2), 59-66, 2005 | 62 | 2005 |

Simple bases for Boolean co-clones E Bohler, S Reith, H Schnoor, H Vollmer Information Processing Letters, 2005 | 62* | 2005 |

The complexity of satisfiability problems: Refining Schaefer's theorem E Allender, M Bauland, N Immerman, H Schnoor, H Vollmer Journal of Computer and System Sciences 75 (4), 245-254, 2009 | 60 | 2009 |

Partial polymorphisms and constraint satisfaction problems H Schnoor, I Schnoor Complexity of Constraints, 229-254, 2008 | 59 | 2008 |

Manipulation of Copeland elections P Faliszewski, E Hemaspaandra, H Schnoor Proceedings of the 9th International Conference on Autonomous Agents and …, 2010 | 44 | 2010 |

A Van Benthem Theorem for Modal Team Semantics J Kontinen, JS Müller, H Schnoor, H Vollmer arXiv preprint arXiv:1410.6648, 2014 | 42 | 2014 |

The complexity of satisfiability problems: Refining Schaefer’s theorem E Allender, M Bauland, N Immerman, H Schnoor, H Vollmer Mathematical Foundations of Computer Science 2005, 71-82, 2005 | 42 | 2005 |

Modal Independence Logic J Kontinen, JS Müller, H Schnoor, H Vollmer arXiv preprint arXiv:1404.0144, 2014 | 41 | 2014 |

The complexity of generalized satisfiability for linear temporal logic M Bauland, T Schneider, H Schnoor, I Schnoor, H Vollmer Arxiv preprint arXiv:0812.4848, 2008 | 38 | 2008 |

Minimization for generalized Boolean formulas E Hemaspaandra, H Schnoor Proceedings of the Twenty-Second international joint conference on …, 2011 | 35 | 2011 |

A Control Dichotomy for Pure Scoring Rules E Hemaspaandra, LA Hemaspaandra, H Schnoor arXiv preprint arXiv:1404.4560, 2014 | 32 | 2014 |

Generalized modal satisfiability E Hemaspaandra, H Schnoor, I Schnoor Journal of Computer and System Sciences 76 (7), 561-578, 2010 | 32 | 2010 |

Generalized modal satisfiability M Bauland, E Hemaspaandra, H Schnoor, I Schnoor STACS 2006, 500-511, 2006 | 29 | 2006 |

Enumerating all solutions for constraint satisfaction problems H Schnoor, I Schnoor STACS 2007, 694-705, 2007 | 27 | 2007 |

The tractability of model checking for LTL: The good, the bad, and the ugly fragments M Bauland, M Mundhenk, T Schneider, H Schnoor, I Schnoor, H Vollmer ACM Transactions on Computational Logic (TOCL) 12 (2), 13, 2011 | 25 | 2011 |

The Complexity of Intransitive Noninterference S Eggert, R van der Meyden, H Schnoor, T Wilke Security and Privacy (SP), 2011 IEEE Symposium on, 196-211, 2011 | 24 | 2011 |

The tractability of model-checking for LTL: The good, the bad, and the ugly fragments M Bauland, M Mundhenk, T Schneider, H Schnoor, I Schnoor, H Vollmer Electronic Notes in Theoretical Computer Science 231, 277-292, 2009 | 24 | 2009 |

The complexity of generalized satisfiability for linear temporal logic M Bauland, T Schneider, H Schnoor, I Schnoor, H Vollmer Foundations of Software Science and Computational Structures, 48-62, 2007 | 24 | 2007 |