Edit Profile (opens in new tab) Szeider, Stefan Compute Distance To: Compute Author ID: szeider.stefan Published as: Szeider, Stefan; Szneider, Stefan External Links: MGP · Wikidata Documents Indexed: 137 Publications since 2001 12 Contributions as Editor Co-Authors: 72 Co-Authors with 131 Joint Publications 2,326 Co-Co-Authors all top 5 Co-Authors 18 single-authored 23 Ganian, Robert 20 Slivovsky, Friedrich 19 Ordyniak, Sebastian 13 Gutin, Gregory Z. 11 Yeo, Anders 10 Gaspers, Serge 10 Kim, Eun Jung 10 Paulusma, Daniël 8 de Haan, Ronald 8 Peitl, Tomáš 7 Kanj, Iyad A. 7 Samer, Marko 6 Dantchev, Stefan Stoyanov 6 Fellows, Michael Ralph 6 Johnson, Matthew 6 Ramanujan, M. S. 5 Broersma, Hajo J. 5 Lodha, Neha 4 Bova, Simone 4 Eiben, Eduard 4 Fleischner, Herbert J. 4 Rosamond, Frances A. 4 Saurabh, Saket 3 Fichte, Johannes Klaus 3 Fomin, Fedor V. 3 Rafiey, Arash 2 Alon, Noga M. 2 Bäckström, Christer 2 Heule, Marijn J. H. 2 Hoory, Shlomo 2 Jonsson, Peter A. 2 Kamiński, Marcin Marek 2 Lokshtanov, Daniel 2 Mathieson, Luke 2 Misra, Neeldhara 2 Mujuni, Egbert 2 Müller, Moritz 2 Nishimura, Naomi 2 Ragde, Prabhakar L. 2 Rotics, Udi 2 Soleimanfallah, Arezou 2 Thilikos, Dimitrios M. 2 Thomassen, Carsten 2 van ’t Hof, Pim 2 Woltran, Stefan 2 Wrightson, Graham 1 Broesma, Hajo 1 Ciabattoni, Agata 1 Dvořák, Wolfgang 1 Freivalds, Rūsiņš Mārtiņš 1 Golovach, Petr A. 1 Koivisto, Mikko 1 Kovács, Laura Ildikó 1 Kucera, Antonin 1 Kullmann, Oliver 1 Lachnitt, Hanna 1 Liedloff, Mathieu 1 Martin, Barnaby D. 1 Pichler, Reinhard 1 Potapov, Igor 1 Raman, Venkatesh 1 Reichl, Franz-Xaver 1 Rümmele, Stefan 1 Schidler, André 1 Shukla, Ankit 1 Strichman, Ofer 1 Suchan, Karol 1 Van Leeuwen, Erik Jan 1 Vatshelle, Martin 1 Verheij, Bart 1 Villanger, Yngve 1 Živný, Stanislav all top 5 Serials 9 Theoretical Computer Science 8 Journal of Computer and System Sciences 7 Algorithmica 6 ACM Transactions on Computational Logic 5 Artificial Intelligence 5 Discrete Applied Mathematics 5 The Journal of Artificial Intelligence Research (JAIR) 4 Journal of Automated Reasoning 4 Journal of Discrete Algorithms 3 Theory of Computing Systems 3 Texts in Algorithmics 2 Information and Computation 2 SIAM Journal on Discrete Mathematics 2 Lecture Notes in Computer Science 1 Acta Informatica 1 Information Processing Letters 1 Ars Combinatoria 1 Graphs and Combinatorics 1 Computational Complexity 1 Annals of Mathematics and Artificial Intelligence 1 Constraints 1 Fundamenta Informaticae 1 Theory and Practice of Logic Programming 1 Discrete Optimization 1 Frontiers in Artificial Intelligence and Applications 1 Journal of Satisfiability, Boolean Modeling and Computation 1 ACM Transactions on Algorithms 1 ACM Transactions on Computation Theory all top 5 Fields 141 Computer science (68-XX) 32 Mathematical logic and foundations (03-XX) 31 Combinatorics (05-XX) 12 General and overarching topics; collections (00-XX) 6 Operations research, mathematical programming (90-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 2 Information and communication theory, circuits (94-XX) 1 General algebraic systems (08-XX) 1 Statistics (62-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 111 Publications have been cited 783 times in 490 Documents Cited by ▼ Year ▼ Clique-width is NP-complete. Zbl 1207.68159Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan 45 2009 Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Zbl 1061.68072Fleischner, Herbert; Kullmann, Oliver; Szeider, Stefan 33 2002 On the complexity of some colorful problems parameterized by treewidth. Zbl 1223.05070Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten 32 2011 On fixed-parameter tractable parameterizations of SAT. Zbl 1204.68109Szeider, Stefan 29 2004 Solving MAX-\(r\)-SAT above a tight lower bound. Zbl 1242.68118Alon, Noga; Gutin, Gregory; Kim, Eun Jung; Szeider, Stefan; Yeo, Anders 28 2011 Editing graphs to satisfy degree constraints: a parameterized approach. Zbl 1242.68124Mathieson, Luke; Szeider, Stefan 24 2012 Backdoor sets of quantified Boolean formulas. Zbl 1191.68353Samer, Marko; Szeider, Stefan 23 2009 Algorithms for propositional model counting. Zbl 1214.05166Samer, Marko; Szeider, Stefan 23 2010 Clique-width minimization is NP-hard. Zbl 1301.68145Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan 21 2006 Covering graphs with few complete bipartite subgraphs. Zbl 1168.68019Fleischner, Herbert; Mujuni, Egbert; Paulusma, Daniël; Szeider, Stefan 20 2009 On graph contractions and induced minors. Zbl 1241.05137Van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël; Szeider, Stefan; Thilikos, Dimitrios M. 17 2012 The linear arrangement problem parameterized above guaranteed value. Zbl 1148.68039Gutin, Gregory; Rafiey, Arash; Szeider, Stefan; Yeo, Anders 17 2007 Backdoors to satisfaction. Zbl 1358.68133Gaspers, Serge; Szeider, Stefan 16 2012 Augmenting tractable fragments of abstract argumentation. Zbl 1251.68225Dvořák, Wolfgang; Ordyniak, Sebastian; Szeider, Stefan 15 2012 Constraint satisfaction with bounded treewidth revisited. Zbl 1186.68443Samer, Marko; Szeider, Stefan 14 2010 Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Zbl 1108.68065Szeider, Stefan 14 2004 Solving MAX-\(r\)-SAT above a tight lower bound. Zbl 1288.68099Alon, Noga; Gutin, Gregory; Kim, Eun Jung; Szeider, Stefan; Yeo, Anders 14 2010 Finding paths in graphs avoiding forbidden transitions. Zbl 1010.68099Szeider, Stefan 13 2003 A probabilistic approach to problems parameterized above or below tight bounds. Zbl 1209.68277Gutin, Gregory; Kim, Eun Jung; Szeider, Stefan; Yeo, Anders 12 2011 NP-completeness of refutability by literal-once resolution. Zbl 0988.03020Szeider, Stefan 12 2001 Satisfiability of acyclic and almost acyclic CNF formulas. Zbl 1291.68182Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan 11 2013 Algorithmic applications of tree-cut width. Zbl 1465.68211Ganian, Robert; Kim, Eun Jung; Szeider, Stefan 10 2015 The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT. Zbl 1248.90067Szeider, Stefan 10 2011 Soundness of \(\mathcal{Q}\)-resolution with dependency schemes. Zbl 1332.68204Slivovsky, Friedrich; Szeider, Stefan 9 2016 Meta-kernelization using well-structured modulators. Zbl 1378.68073Eiben, Eduard; Ganian, Robert; Szeider, Stefan 9 2015 Solving #SAT using vertex covers. Zbl 1133.68073Nishimura, Naomi; Ragde, Prabhakar; Szeider, Stefan 9 2007 Model counting for CNF formulas of bounded modular treewidth. Zbl 1353.68137Paulusma, Daniel; Slivovsky, Friedrich; Szeider, Stefan 8 2016 Backdoors to tractable answer set programming. Zbl 1328.68040Fichte, Johannes Klaus; Szeider, Stefan 8 2015 Not so easy problems for tree decomposable graphs. Zbl 1231.05252Szeider, Stefan 8 2010 Parameterized proof complexity. Zbl 1252.68151Dantchev, Stefan; Martin, Barnaby; Szeider, Stefan 8 2011 Tractable cases of the extended global cardinality constraint. Zbl 1215.68164Samer, Marko; Szeider, Stefan 8 2011 Backdoor sets for DLL subsolvers. Zbl 1109.68105Szeider, Stefan 8 2005 Fixed-parameter complexity of minimum profile problems. Zbl 1170.68020Gutin, Gregory; Szeider, Stefan; Yeo, Anders 8 2008 Dependency learning for QBF. Zbl 1478.68330Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 8 2017 A probabilistic approach to problems parameterized above or below tight bounds. Zbl 1273.68176Gutin, Gregory; Kim, Eun Jung; Szeider, Stefan; Yeo, Anders 7 2009 Backdoors into heterogeneous classes of SAT and CSP. Zbl 1356.68097Gaspers, Serge; Misra, Neeldhara; Ordyniak, Sebastian; Szeider, Stefan; Živný, Stanislav 7 2017 Algorithms and complexity results for persuasive argumentation. Zbl 1230.68189Kim, Eun Jung; Ordyniak, Sebastian; Szeider, Stefan 7 2011 On the complexity of some colorful problems parameterized by treewidth. Zbl 1175.68292Fellows, Michael; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten 7 2007 Backdoors to normality for disjunctive logic programs. Zbl 1367.68032Fichte, Johannes K.; Szeider, Stefan 7 2015 Algorithms for propositional model counting. Zbl 1137.68623Samer, Marko; Szeider, Stefan 7 2007 Computing resolution-path dependencies in linear time. Zbl 1273.68187Slivovsky, Friedrich; Szeider, Stefan 7 2012 Long distance Q-resolution with dependency schemes. Zbl 1475.68446Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 6 2016 Generalizations of matched CNF formulas. Zbl 1099.68044Szeider, Stefan 6 2005 Constraint satisfaction with bounded treewidth revisited. Zbl 1160.68563Samer, Marko; Szeider, Stefan 6 2006 Homomorphisms of conjunctive normal forms. Zbl 1033.68095Szeider, Stefan 6 2003 Combining treewidth and backdoors for CSP. Zbl 1402.68094Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 6 2017 Solving problems on graphs of high rank-width. Zbl 1392.68199Eiben, Eduard; Ganian, Robert; Szeider, Stefan 5 2015 On the subexponential-time complexity of CSP. Zbl 1323.68325de Haan, Ronald; Kanj, Iyad; Szeider, Stefan 5 2015 A complete parameterized complexity analysis of bounded planning. Zbl 1320.68096Bäckström, Christer; Jonsson, Peter; Ordyniak, Sebastian; Szeider, Stefan 5 2015 Monadic second order logic on graphs with local cardinality constraints. Zbl 1351.68121Szeider, Stefan 5 2011 Fixed-parameter tractable reductions to SAT. Zbl 1423.68444de Haan, Ronald; Szeider, Stefan 5 2014 Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Zbl 1310.68053Pichler, Reinhard; Rümmele, Stefan; Szeider, Stefan; Woltran, Stefan 5 2014 Monadic second order logic on graphs with local cardinality constraints. Zbl 1173.03300Szeider, Stefan 5 2008 On finding short resolution refutations and small unsatisfiable subsets. Zbl 1087.03035Fellows, Michael R.; Szeider, Stefan; Wrightson, Graham 4 2006 A note on unsatisfiable \(k\)-CNF formulas with few occurrences per variable. Zbl 1115.68104Hoory, Shlomo; Szeider, Stefan 4 2006 Meta-kernelization with structural parameters. Zbl 1346.68109Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan 4 2016 A SAT approach to clique-width. Zbl 1354.68240Heule, Marijn J. H.; Szeider, Stefan 4 2015 Variable dependencies and Q-resolution. Zbl 1423.68426Slivovsky, Friedrich; Szeider, Stefan 4 2014 Parameterized complexity classes beyond para-NP. Zbl 1370.68146de Haan, Ronald; Szeider, Stefan 4 2017 Backdoors to acyclic SAT. Zbl 1272.68373Gaspers, Serge; Szeider, Stefan 4 2012 Parameterized graph editing with chosen vertex degrees. Zbl 1168.68445Mathieson, Luke; Szeider, Stefan 4 2008 SAT-based local improvement for finding tree decompositions of small width. Zbl 06807239Fichte, Johannes K.; Lodha, Neha; Szeider, Stefan 4 2017 Quantifier reordering for QBF. Zbl 1356.68200Slivovsky, Friedrich; Szeider, Stefan 3 2016 Matched formulas and backdoor sets. Zbl 1187.68254Szeider, Stefan 3 2009 On contracting graphs to fixed pattern graphs. Zbl 1274.68277van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël; Szeider, Stefan; Thilikos, Dimitrios M. 3 2010 Community structure inspired algorithms for SAT and #SAT. Zbl 1471.68322Ganian, Robert; Szeider, Stefan 3 2015 Model counting for formulas of bounded clique-width. Zbl 1406.68046Slivovsky, Friedrich; Szeider, Stefan 3 2013 Model checking existential logic on partially ordered sets. Zbl 1367.68182Bova, Simone; Ganian, Robert; Szeider, Stefan 3 2016 Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Zbl 1405.68139Gaspers, Serge; Szeider, Stefan 3 2014 Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable. Zbl 1087.68042Hoory, Shlomo; Szeider, Stefan 3 2005 On theorems equivalent with Kotzig’s result on graphs with unique 1-factors. Zbl 1074.05074Szeider, Stefan 3 2004 Theory and applications of satisfiability testing – SAT 2010. 13th international conference, SAT 2010, Edinburgh, UK, July 11–14, 2010. Proceedings. Zbl 1196.68013 3 2010 SAT-encodings for special treewidth and pathwidth. Zbl 06807241Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan 3 2017 Dependency learning for QBF. Zbl 1477.68293Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 3 2019 \(k\)-gap interval graphs. Zbl 1353.68124Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr; Suchan, Karol; Szeider, Stefan; van Leeuwen, Erik Jan; Vatshelle, Martin; Villanger, Yngve 2 2012 Model counting for CNF formulas of bounded modular treewidth. Zbl 1354.68131Paulusma, Daniel; Slivovsky, Friedrich; Szeider, Stefan 2 2013 The linear arrangement problem parameterized above guaranteed value. Zbl 1183.68428Gutin, Gregory; Rafiey, Arash; Szeider, Stefan; Yeo, Anders 2 2006 Solving #SAT using vertex covers. Zbl 1187.68263Nishimura, Naomi; Ragde, Prabhakar; Szeider, Stefan 2 2006 Satisfiability of acyclic and almost acyclic CNF formulas. Zbl 1245.68112Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan 2 2010 The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT. Zbl 1247.68262Szeider, Stefan 2 2009 Machine characterizations for parameterized complexity classes beyond para-NP. Zbl 1370.68145de Haan, Ronald; Szeider, Stefan 2 2015 Backdoors to q-Horn. Zbl 1336.68126Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan 2 2016 The complexity of resolution with generalized symmetry rules. Zbl 1066.68121Szeider, Stefan 2 2005 Parameterized complexity results for exact Bayesian network structure learning. Zbl 1272.68344Ordyniak, Sebastian; Szeider, Stefan 2 2013 Parameterized complexity and kernel bounds for hard planning problems. Zbl 1382.68098Bäckström, Christer; Jonsson, Peter; Ordyniak, Sebastian; Szeider, Stefan 2 2013 A SAT approach to clique-width. Zbl 1390.68501Heule, Marijn J. H.; Szeider, Stefan 2 2013 Strong backdoors to nested satisfiability. Zbl 1273.68169Gaspers, Serge; Szeider, Stefan 2 2012 Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1410.68166Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 2 2016 Polynomial-time validation of QCDCL certificates. Zbl 06916311Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 2 2018 Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1446.68073Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 2 2017 Backdoors to q-Horn. Zbl 1354.68123Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan 1 2013 Satisfiability of acyclic and almost acyclic CNF formulas. II. Zbl 1331.68115Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan 1 2011 Matched formulas and backdoor sets. Zbl 1187.68253Szeider, Stefan 1 2007 Backdoor sets of quantified Boolean formulas. Zbl 1214.68372Samer, Marko; Szeider, Stefan 1 2007 Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Zbl 1276.68086Szeider, Stefan 1 2003 Quantified conjunctive queries on partially ordered sets. Zbl 1456.68096Bova, Simone; Ganian, Robert; Szeider, Stefan 1 2014 On finding optimal polytrees. Zbl 1330.68223Gaspers, Serge; Koivisto, Mikko; Liedloff, Mathieu; Ordyniak, Sebastian; Szeider, Stefan 1 2015 Meta-kernelization with structural parameters. Zbl 1400.68089Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan 1 2013 Revisiting space in proof complexity: treewidth and pathwidth. Zbl 1400.03073Müller, Moritz; Szeider, Stefan 1 2013 Corrigendum to: “The linear arrangement problem parameterized above guaranteed value”. Zbl 1277.68223Gutin, Gregory; Rafiey, Arash; Szeider, Stefan; Yeo, Anders 1 2013 Computing optimal hypertree decompositions. Zbl 07302416Schidler, André; Szeider, Stefan 1 2020 Dependency learning for QBF. Zbl 1477.68293Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 3 2019 SAT-encodings for treecut width and treedepth. Zbl 1430.68206Ganian, Robert; Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan 1 2019 Proof complexity of fragments of long-distance Q-resolution. Zbl 1441.03044Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 1 2019 On the parameterized complexity of \((k,s)\)-SAT. Zbl 1478.68105Paulusma, Daniël; Szeider, Stefan 1 2019 Polynomial-time validation of QCDCL certificates. Zbl 06916311Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 2 2018 Solving problems on graphs of high rank-width. Zbl 1390.68342Eiben, Eduard; Ganian, Robert; Szeider, Stefan 1 2018 Meta-kernelization using well-structured modulators. Zbl 1396.68055Eiben, Eduard; Ganian, Robert; Szeider, Stefan 1 2018 Dependency learning for QBF. Zbl 1478.68330Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 8 2017 Backdoors into heterogeneous classes of SAT and CSP. Zbl 1356.68097Gaspers, Serge; Misra, Neeldhara; Ordyniak, Sebastian; Szeider, Stefan; Živný, Stanislav 7 2017 Combining treewidth and backdoors for CSP. Zbl 1402.68094Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 6 2017 Parameterized complexity classes beyond para-NP. Zbl 1370.68146de Haan, Ronald; Szeider, Stefan 4 2017 SAT-based local improvement for finding tree decompositions of small width. Zbl 06807239Fichte, Johannes K.; Lodha, Neha; Szeider, Stefan 4 2017 SAT-encodings for special treewidth and pathwidth. Zbl 06807241Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan 3 2017 Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1446.68073Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 2 2017 Backdoor treewidth for SAT. Zbl 06807216Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 1 2017 New width parameters for model counting. Zbl 06807217Ganian, Robert; Szeider, Stefan 1 2017 Soundness of \(\mathcal{Q}\)-resolution with dependency schemes. Zbl 1332.68204Slivovsky, Friedrich; Szeider, Stefan 9 2016 Model counting for CNF formulas of bounded modular treewidth. Zbl 1353.68137Paulusma, Daniel; Slivovsky, Friedrich; Szeider, Stefan 8 2016 Long distance Q-resolution with dependency schemes. Zbl 1475.68446Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan 6 2016 Meta-kernelization with structural parameters. Zbl 1346.68109Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan 4 2016 Quantifier reordering for QBF. Zbl 1356.68200Slivovsky, Friedrich; Szeider, Stefan 3 2016 Model checking existential logic on partially ordered sets. Zbl 1367.68182Bova, Simone; Ganian, Robert; Szeider, Stefan 3 2016 Backdoors to q-Horn. Zbl 1336.68126Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan 2 2016 Discovering archipelagos of tractability for constraint satisfaction and counting. Zbl 1410.68166Ganian, Robert; Ramanujan, M. S.; Szeider, Stefan 2 2016 Algorithmic applications of tree-cut width. Zbl 1465.68211Ganian, Robert; Kim, Eun Jung; Szeider, Stefan 10 2015 Meta-kernelization using well-structured modulators. Zbl 1378.68073Eiben, Eduard; Ganian, Robert; Szeider, Stefan 9 2015 Backdoors to tractable answer set programming. Zbl 1328.68040Fichte, Johannes Klaus; Szeider, Stefan 8 2015 Backdoors to normality for disjunctive logic programs. Zbl 1367.68032Fichte, Johannes K.; Szeider, Stefan 7 2015 Solving problems on graphs of high rank-width. Zbl 1392.68199Eiben, Eduard; Ganian, Robert; Szeider, Stefan 5 2015 On the subexponential-time complexity of CSP. Zbl 1323.68325de Haan, Ronald; Kanj, Iyad; Szeider, Stefan 5 2015 A complete parameterized complexity analysis of bounded planning. Zbl 1320.68096Bäckström, Christer; Jonsson, Peter; Ordyniak, Sebastian; Szeider, Stefan 5 2015 A SAT approach to clique-width. Zbl 1354.68240Heule, Marijn J. H.; Szeider, Stefan 4 2015 Community structure inspired algorithms for SAT and #SAT. Zbl 1471.68322Ganian, Robert; Szeider, Stefan 3 2015 Machine characterizations for parameterized complexity classes beyond para-NP. Zbl 1370.68145de Haan, Ronald; Szeider, Stefan 2 2015 On finding optimal polytrees. Zbl 1330.68223Gaspers, Serge; Koivisto, Mikko; Liedloff, Mathieu; Ordyniak, Sebastian; Szeider, Stefan 1 2015 Fixed-parameter tractable reductions to SAT. Zbl 1423.68444de Haan, Ronald; Szeider, Stefan 5 2014 Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Zbl 1310.68053Pichler, Reinhard; Rümmele, Stefan; Szeider, Stefan; Woltran, Stefan 5 2014 Variable dependencies and Q-resolution. Zbl 1423.68426Slivovsky, Friedrich; Szeider, Stefan 4 2014 Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Zbl 1405.68139Gaspers, Serge; Szeider, Stefan 3 2014 Quantified conjunctive queries on partially ordered sets. Zbl 1456.68096Bova, Simone; Ganian, Robert; Szeider, Stefan 1 2014 Model checking existential logic on partially ordered sets. Zbl 1401.68187Bova, Simone; Ganian, Robert; Szeider, Stefan 1 2014 Satisfiability of acyclic and almost acyclic CNF formulas. Zbl 1291.68182Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan 11 2013 Model counting for formulas of bounded clique-width. Zbl 1406.68046Slivovsky, Friedrich; Szeider, Stefan 3 2013 Model counting for CNF formulas of bounded modular treewidth. Zbl 1354.68131Paulusma, Daniel; Slivovsky, Friedrich; Szeider, Stefan 2 2013 Parameterized complexity results for exact Bayesian network structure learning. Zbl 1272.68344Ordyniak, Sebastian; Szeider, Stefan 2 2013 Parameterized complexity and kernel bounds for hard planning problems. Zbl 1382.68098Bäckström, Christer; Jonsson, Peter; Ordyniak, Sebastian; Szeider, Stefan 2 2013 A SAT approach to clique-width. Zbl 1390.68501Heule, Marijn J. H.; Szeider, Stefan 2 2013 Backdoors to q-Horn. Zbl 1354.68123Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan 1 2013 Meta-kernelization with structural parameters. Zbl 1400.68089Ganian, Robert; Slivovsky, Friedrich; Szeider, Stefan 1 2013 Revisiting space in proof complexity: treewidth and pathwidth. Zbl 1400.03073Müller, Moritz; Szeider, Stefan 1 2013 Corrigendum to: “The linear arrangement problem parameterized above guaranteed value”. Zbl 1277.68223Gutin, Gregory; Rafiey, Arash; Szeider, Stefan; Yeo, Anders 1 2013 Editing graphs to satisfy degree constraints: a parameterized approach. Zbl 1242.68124Mathieson, Luke; Szeider, Stefan 24 2012 On graph contractions and induced minors. Zbl 1241.05137Van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël; Szeider, Stefan; Thilikos, Dimitrios M. 17 2012 Backdoors to satisfaction. Zbl 1358.68133Gaspers, Serge; Szeider, Stefan 16 2012 Augmenting tractable fragments of abstract argumentation. Zbl 1251.68225Dvořák, Wolfgang; Ordyniak, Sebastian; Szeider, Stefan 15 2012 Computing resolution-path dependencies in linear time. Zbl 1273.68187Slivovsky, Friedrich; Szeider, Stefan 7 2012 Backdoors to acyclic SAT. Zbl 1272.68373Gaspers, Serge; Szeider, Stefan 4 2012 \(k\)-gap interval graphs. Zbl 1353.68124Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr; Suchan, Karol; Szeider, Stefan; van Leeuwen, Erik Jan; Vatshelle, Martin; Villanger, Yngve 2 2012 Strong backdoors to nested satisfiability. Zbl 1273.68169Gaspers, Serge; Szeider, Stefan 2 2012 Computational models of argument. Proceedings of the 4th conference, COMMA 2012, Vienna, Austria, September 10–12, 2012. Zbl 1401.68011 1 2012 On the complexity of some colorful problems parameterized by treewidth. Zbl 1223.05070Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten 32 2011 Solving MAX-\(r\)-SAT above a tight lower bound. Zbl 1242.68118Alon, Noga; Gutin, Gregory; Kim, Eun Jung; Szeider, Stefan; Yeo, Anders 28 2011 A probabilistic approach to problems parameterized above or below tight bounds. Zbl 1209.68277Gutin, Gregory; Kim, Eun Jung; Szeider, Stefan; Yeo, Anders 12 2011 The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT. Zbl 1248.90067Szeider, Stefan 10 2011 Parameterized proof complexity. Zbl 1252.68151Dantchev, Stefan; Martin, Barnaby; Szeider, Stefan 8 2011 Tractable cases of the extended global cardinality constraint. Zbl 1215.68164Samer, Marko; Szeider, Stefan 8 2011 Algorithms and complexity results for persuasive argumentation. Zbl 1230.68189Kim, Eun Jung; Ordyniak, Sebastian; Szeider, Stefan 7 2011 Monadic second order logic on graphs with local cardinality constraints. Zbl 1351.68121Szeider, Stefan 5 2011 Satisfiability of acyclic and almost acyclic CNF formulas. II. Zbl 1331.68115Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan 1 2011 Algorithms for propositional model counting. Zbl 1214.05166Samer, Marko; Szeider, Stefan 23 2010 Constraint satisfaction with bounded treewidth revisited. Zbl 1186.68443Samer, Marko; Szeider, Stefan 14 2010 Solving MAX-\(r\)-SAT above a tight lower bound. Zbl 1288.68099Alon, Noga; Gutin, Gregory; Kim, Eun Jung; Szeider, Stefan; Yeo, Anders 14 2010 Not so easy problems for tree decomposable graphs. Zbl 1231.05252Szeider, Stefan 8 2010 On contracting graphs to fixed pattern graphs. Zbl 1274.68277van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël; Szeider, Stefan; Thilikos, Dimitrios M. 3 2010 Theory and applications of satisfiability testing – SAT 2010. 13th international conference, SAT 2010, Edinburgh, UK, July 11–14, 2010. Proceedings. Zbl 1196.68013 3 2010 Satisfiability of acyclic and almost acyclic CNF formulas. Zbl 1245.68112Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan 2 2010 Clique-width is NP-complete. Zbl 1207.68159Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan 45 2009 Backdoor sets of quantified Boolean formulas. Zbl 1191.68353Samer, Marko; Szeider, Stefan 23 2009 Covering graphs with few complete bipartite subgraphs. Zbl 1168.68019Fleischner, Herbert; Mujuni, Egbert; Paulusma, Daniël; Szeider, Stefan 20 2009 A probabilistic approach to problems parameterized above or below tight bounds. Zbl 1273.68176Gutin, Gregory; Kim, Eun Jung; Szeider, Stefan; Yeo, Anders 7 2009 Matched formulas and backdoor sets. Zbl 1187.68254Szeider, Stefan 3 2009 The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT. Zbl 1247.68262Szeider, Stefan 2 2009 Fixed-parameter complexity of minimum profile problems. Zbl 1170.68020Gutin, Gregory; Szeider, Stefan; Yeo, Anders 8 2008 Monadic second order logic on graphs with local cardinality constraints. Zbl 1173.03300Szeider, Stefan 5 2008 Parameterized graph editing with chosen vertex degrees. Zbl 1168.68445Mathieson, Luke; Szeider, Stefan 4 2008 The linear arrangement problem parameterized above guaranteed value. Zbl 1148.68039Gutin, Gregory; Rafiey, Arash; Szeider, Stefan; Yeo, Anders 17 2007 Solving #SAT using vertex covers. Zbl 1133.68073Nishimura, Naomi; Ragde, Prabhakar; Szeider, Stefan 9 2007 On the complexity of some colorful problems parameterized by treewidth. Zbl 1175.68292Fellows, Michael; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten 7 2007 Algorithms for propositional model counting. Zbl 1137.68623Samer, Marko; Szeider, Stefan 7 2007 Matched formulas and backdoor sets. Zbl 1187.68253Szeider, Stefan 1 2007 Backdoor sets of quantified Boolean formulas. Zbl 1214.68372Samer, Marko; Szeider, Stefan 1 2007 Clique-width minimization is NP-hard. Zbl 1301.68145Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan 21 2006 Constraint satisfaction with bounded treewidth revisited. Zbl 1160.68563Samer, Marko; Szeider, Stefan 6 2006 On finding short resolution refutations and small unsatisfiable subsets. Zbl 1087.03035Fellows, Michael R.; Szeider, Stefan; Wrightson, Graham 4 2006 A note on unsatisfiable \(k\)-CNF formulas with few occurrences per variable. Zbl 1115.68104Hoory, Shlomo; Szeider, Stefan 4 2006 The linear arrangement problem parameterized above guaranteed value. Zbl 1183.68428Gutin, Gregory; Rafiey, Arash; Szeider, Stefan; Yeo, Anders 2 2006 Solving #SAT using vertex covers. Zbl 1187.68263Nishimura, Naomi; Ragde, Prabhakar; Szeider, Stefan 2 2006 Fixed-parameter complexity of minimum profile problems. Zbl 1154.68426Gutin, Gregory; Szeider, Stefan; Yeo, Anders 1 2006 Backdoor sets for DLL subsolvers. Zbl 1109.68105Szeider, Stefan 8 2005 ...and 11 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 641 Authors 54 Szeider, Stefan 32 Gutin, Gregory Z. 30 Paulusma, Daniël 25 Golovach, Petr A. 20 Yeo, Anders 19 Ordyniak, Sebastian 17 Ganian, Robert 17 Saurabh, Saket 16 Thilikos, Dimitrios M. 12 Fomin, Fedor V. 12 Heggernes, Pinar 12 Woltran, Stefan 10 Beyersdorff, Olaf 10 Courcelle, Bruno 10 Kim, Eun Jung 10 Sau, Ignasi 10 Slivovsky, Friedrich 9 Fellows, Michael Ralph 9 Kamiński, Marcin Marek 9 Wahlström, Magnus 8 Belmonte, Rémy 8 Dabrowski, Konrad Kazimierz 8 Kleine Büning, Hans 8 Lozin, Vadim Vladislavovich 8 Meister, Daniel 8 Niedermeier, Rolf 8 Raman, Venkatesh 8 van ’t Hof, Pim 7 Crowston, Robert 7 Eiben, Eduard 7 Gaspers, Serge 7 Gurski, Frank 7 Kanté, Mamadou Moustapha 7 Kwon, Ojoung 7 Lokshtanov, Daniel 7 Subramani, Krishnan 6 Fichte, Johannes Klaus 6 Hermelin, Danny 6 Jonsson, Peter A. 6 Lonsing, Florian 6 Martin, Barnaby D. 6 Misra, Neeldhara 6 Mnich, Matthias 6 Otachi, Yota 6 Papadopoulos, Charis 6 Paul, Christophe 6 Rosamond, Frances A. 6 Wojciechowski, Piotr J. 5 Bliem, Bernhard 5 Dvořák, Wolfgang 5 Hartung, Sepp 5 Kullmann, Oliver 5 Lampis, Michael 5 Meier, Arne 5 Nichterlein, André 5 Panolan, Fahad 5 Ramanujan, M. S. 5 Rotics, Udi 4 Bäckström, Christer 4 Biere, Armin 4 Blinkhorn, Joshua 4 Downey, Rodney Graham 4 Egly, Uwe 4 Giannopoulou, Archontia C. 4 Hecher, Markus 4 Heule, Marijn J. H. 4 Jansen, Bart M. P. 4 Kratsch, Stefan 4 Lauria, Massimo 4 Marques-Silva, João P. 4 Masařík, Tomáš 4 Milanič, Martin 4 Raymond, Jean-Florent 4 Seidl, Martina 4 Zamaraev, Victor A. 4 Zhao, Xishun 3 Bannach, Max 3 Becker, Bernd 3 Bonnet, Edouard 3 Bredereck, Robert 3 Dell, Holger 3 Fazzinga, Bettina 3 Flesca, Sergio 3 Froese, Vincent 3 Galesi, Nicola 3 Kronegger, Martin 3 Lagerkvist, Victor 3 Liberatore, Paolo 3 Majumdar, Diptapriyo 3 Marquis, Pierre 3 Marx, Dániel 3 Mathieson, Luke 3 Mengel, Stefan 3 Mertzios, George B. 3 Mitsou, Valia 3 Oum, Sang-Il 3 Peitl, Tomáš 3 Pilipczuk, Michał 3 Sabharwal, Ashish 3 Samer, Marko ...and 541 more Authors all top 5 Cited in 57 Serials 58 Theoretical Computer Science 46 Discrete Applied Mathematics 42 Algorithmica 31 Artificial Intelligence 27 Journal of Computer and System Sciences 15 Theory of Computing Systems 14 Information Processing Letters 14 SIAM Journal on Discrete Mathematics 13 Annals of Mathematics and Artificial Intelligence 12 Information and Computation 9 Journal of Automated Reasoning 7 Discrete Mathematics 5 Journal of Combinatorial Theory. Series B 5 Constraints 5 Journal of Discrete Algorithms 4 The Journal of Artificial Intelligence Research (JAIR) 4 Journal of Combinatorial Optimization 4 Theory and Practice of Logic Programming 4 ACM Transactions on Computational Logic 4 Logical Methods in Computer Science 3 Journal of Satisfiability, Boolean Modeling and Computation 3 Algorithms 2 Acta Informatica 2 European Journal of Combinatorics 2 Combinatorica 2 Computers & Operations Research 2 International Journal of Approximate Reasoning 2 Linear Algebra and its Applications 2 Trudy Instituta Matematiki 2 Discrete Optimization 2 Computer Science Review 1 Communications in Mathematical Physics 1 Journal of Statistical Physics 1 Information Sciences 1 Networks 1 Annals of Pure and Applied Logic 1 Graphs and Combinatorics 1 Machine Learning 1 Computational Geometry 1 MSCS. Mathematical Structures in Computer Science 1 European Journal of Operational Research 1 Archive for Mathematical Logic 1 Computational Complexity 1 Formal Methods in System Design 1 The Electronic Journal of Combinatorics 1 Top 1 The Bulletin of Symbolic Logic 1 Soft Computing 1 Journal of Scheduling 1 Journal of Graph Algorithms and Applications 1 Annals of Combinatorics 1 RAIRO. Theoretical Informatics and Applications 1 Journal of Mathematical Logic 1 Journal of Multiple-Valued Logic and Soft Computing 1 Journal of Applied Logic 1 Annales de l’Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) 1 Prikladnaya Diskretnaya Matematika all top 5 Cited in 19 Fields 400 Computer science (68-XX) 218 Combinatorics (05-XX) 67 Mathematical logic and foundations (03-XX) 37 Operations research, mathematical programming (90-XX) 7 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 4 Order, lattices, ordered algebraic structures (06-XX) 4 Biology and other natural sciences (92-XX) 4 Information and communication theory, circuits (94-XX) 3 Statistical mechanics, structure of matter (82-XX) 2 History and biography (01-XX) 2 General algebraic systems (08-XX) 2 Linear and multilinear algebra; matrix theory (15-XX) 2 Quantum theory (81-XX) 1 General and overarching topics; collections (00-XX) 1 Number theory (11-XX) 1 Partial differential equations (35-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Probability theory and stochastic processes (60-XX) 1 Numerical analysis (65-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.