| Clique-width is NP-complete MR Fellows, FA Rosamond, U Rotics, S Szeider SIAM Journal on Discrete Mathematics 23 (2), 909-939, 2009 | 207* | 2009 |
| Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference H Fleischner, O Kullmann, S Szeider Theoretical Computer Science 289 (1), 503-516, 2002 | 136 | 2002 |
| Algorithms for propositional model counting M Samer, S Szeider Journal of Discrete Algorithms 8 (1), 50-64, 2010 | 118 | 2010 |
| Solving MAX-r-SAT above a tight lower bound N Alon, G Gutin, EJ Kim, S Szeider, A Yeo Algorithmica 61 (3), 638-655, 2011 | 116 | 2011 |
| On fixed-parameter tractable parameterizations of SAT S Szeider International Conference on Theory and Applications of Satisfiability …, 2003 | 99 | 2003 |
| Finding paths in graphs avoiding forbidden transitions S Szeider Discrete Applied Mathematics 126 (2-3), 261-273, 2003 | 99 | 2003 |
| Backdoor sets of quantified Boolean formulas M Samer, S Szeider Journal of Automated Reasoning 42 (1), 77-97, 2009 | 98 | 2009 |
| Detecting Backdoor Sets with Respect to Horn and Binary Clauses. N Nishimura, P Ragde, S Szeider SAT 4, 96-103, 2004 | 95 | 2004 |
| On the complexity of some colorful problems parameterized by treewidth MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ... Information and Computation 209 (2), 143-153, 2011 | 92 | 2011 |
| Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems G Gottlob, S Szeider The Computer Journal 51 (3), 303-325, 2008 | 92 | 2008 |
| Constraint satisfaction with bounded treewidth revisited M Samer, S Szeider Journal of Computer and System Sciences 76 (2), 103-114, 2010 | 82* | 2010 |
| Backdoors to satisfaction S Gaspers, S Szeider The Multivariate Algorithmic Revolution and Beyond, 287-317, 2012 | 81 | 2012 |
| The added value of argumentation S Modgil, F Toni, F Bex, I Bratko, CI Chesnevar, W Dvořák, MA Falappa, ... Agreement technologies, 357-403, 2013 | 78 | 2013 |
| Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable S Szeider Journal of Computer and System Sciences 69 (4), 656-674, 2004 | 76 | 2004 |
| Covering graphs with few complete bipartite subgraphs H Fleischner, E Mujuni, D Paulusma, S Szeider Theoretical Computer Science 410 (21-23), 2045-2053, 2009 | 74* | 2009 |
| Augmenting tractable fragments of abstract argumentation W Dvořák, S Ordyniak, S Szeider Artificial Intelligence 186, 157-173, 2012 | 54* | 2012 |
| Backdoor sets for DLL subsolvers S Szeider Journal of Automated Reasoning 35 (1-3), 73-88, 2005 | 52 | 2005 |
| Satisfiability of acyclic and almost acyclic CNF formulas S Ordyniak, D Paulusma, S Szeider Theoretical Computer Science 481, 85-99, 2013 | 51 | 2013 |
| A probabilistic approach to problems parameterized above or below tight bounds G Gutin, EJ Kim, S Szeider, A Yeo Journal of Computer and System Sciences 77 (2), 422-429, 2011 | 51 | 2011 |
| The linear arrangement problem parameterized above guaranteed value G Gutin, A Rafiey, S Szeider, A Yeo Theory of Computing Systems 41 (3), 521-538, 2007 | 51 | 2007 |
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonBestätigte E-Mail-Adresse bei rhul.ac.uk
