pith. sign in

Stefan Szeider

Identifiers

  • name variant Stefan Szeider 0.60 · backfill

Papers (51)

  1. Streamliners for Answer Set Programming cs.LO · 2026 · author #3
  2. Algorithm Selection with Zero Domain Knowledge via Text Embeddings cs.AI · 2026 · author #1
  3. Parameterized Algorithms for the Matrix Completion Problem cs.DS · 2018 · author #4
  4. Circuit Treewidth, Sentential Decision, and Query Compilation cs.LO · 2017 · author #2
  5. Backdoors to Tractable Valued CSP cs.DS · 2016 · author #3
  6. Combining Treewidth and Backdoors for CSP cs.DS · 2016 · author #3
  7. Backdoors into Heterogeneous Classes of SAT and CSP cs.AI · 2015 · author #4
  8. Meta-Kernelization using Well-Structured Modulators cs.DS · 2015 · author #3
  9. Solving Problems on Graphs of High Rank-Width cs.DS · 2015 · author #3
  10. Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting cs.DS · 2015 · author #3
  11. Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions cs.DS · 2015 · author #3
  12. Model Counting for Formulas of Bounded Clique-Width cs.CC · 2014 · author #2
  13. Quantified Conjunctive Queries on Partially Ordered Sets cs.LO · 2014 · author #3
  14. Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning cs.AI · 2014 · author #2
  15. Model Checking Existential Logic on Partially Ordered Sets cs.LO · 2014 · author #3
  16. The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation cs.DS · 2014 · author #3
  17. Parameterized Complexity Results for Exact Bayesian Network Structure Learning cs.AI · 2014 · author #2
  18. The Parameterized Complexity of Reasoning Problems Beyond NP cs.CC · 2013 · author #2
  19. A Complete Parameterized Complexity Analysis of Bounded Planning cs.AI · 2013 · author #4
  20. Parameterized Complexity Results for Plan Reuse cs.AI · 2013 · author #3
  21. Backdoors to Abduction cs.AI · 2013 · author #3
  22. Upper and Lower Bounds for Weak Backdoor Set Detection cs.DS · 2013 · author #4
  23. A SAT Approach to Clique-Width cs.DS · 2013 · author #2
  24. Local Backbones cs.CC · 2013 · author #3
  25. On the Subexponential Time Complexity of CSP cs.CC · 2013 · author #2
  26. Meta-Kernelization with Structural Parameters cs.DS · 2013 · author #3
  27. Backdoors to Normality for Disjunctive Logic Programs cs.LO · 2013 · author #2
  28. Parameterized Complexity and Kernel Bounds for Hard Planning Problems cs.DS · 2012 · author #4
  29. The Complexity of Planning Revisited - A Parameterized Analysis cs.AI · 2012 · author #5
  30. On Finding Optimal Polytrees cs.DS · 2012 · author #5
  31. Don't Be Strict in Local Search! cs.DS · 2012 · author #5
  32. Strong Backdoors to Bounded Treewidth SAT cs.DS · 2012 · author #2
  33. Algorithms and Complexity Results for Exact Bayesian Structure Learning cs.LG · 2012 · author #2
  34. Strong Backdoors to Nested Satisfiability cs.DS · 2012 · author #2
  35. Computing Resolution-Path Dependencies in Linear Time cs.DS · 2012 · author #2
  36. k-Gap Interval Graphs cs.DS · 2011 · author #5
  37. Backdoors to Satisfaction cs.DS · 2011 · author #2
  38. Backdoors to Acyclic SAT cs.DS · 2011 · author #2
  39. Not So Easy Problems for Tree Decomposable Graphs cs.DS · 2011 · author #1
  40. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming cs.DS · 2011 · author #4
  41. Limits of Preprocessing cs.AI · 2011 · author #1
  42. Algorithms and Complexity Results for Persuasive Argumentation cs.AI · 2011 · author #3
  43. Satisfiability of Acyclic and Almost Acyclic CNF Formulas cs.DS · 2011 · author #3
  44. Augmenting Tractable Fragments of Abstract Argumentation cs.AI · 2011 · author #2
  45. Backdoors to Tractable Answer-Set Programming cs.CC · 2011 · author #2
  46. Kernels for Global Constraints cs.AI · 2011 · author #2
  47. Solving MAX-r-SAT Above a Tight Lower Bound cs.DS · 2009 · author #4
  48. A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth cs.DS · 2006 · author #2
  49. Complexity and Applications of Edge-Induced Vertex-Cuts cs.DM · 2006 · author #2
  50. Fixed-Parameter Complexity of Minimum Profile Problems cs.DS · 2006 · author #2
  51. Families of unsatisfiable k-CNF formulas with few occurrences per variable math.CO · 2004 · author #2

Mentions

  • 1307.4440 #3 · backfill · confidence 0.70 Stefan Szeider
  • 1304.5961 #3 · backfill · confidence 0.70 Stefan Szeider
  • 1304.5518 #4 · backfill · confidence 0.70 Stefan Szeider
  • 1304.5498 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1304.5479 #3 · backfill · confidence 0.70 Stefan Szeider
  • 1304.1996 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1303.1786 #3 · backfill · confidence 0.70 Stefan Szeider
  • 1301.1391 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1211.0479 #4 · backfill · confidence 0.70 Stefan Szeider
  • 1208.2566 #5 · backfill · confidence 0.70 Stefan Szeider
  • 1208.1692 #5 · backfill · confidence 0.70 Stefan Szeider
  • 1208.1688 #5 · backfill · confidence 0.70 Stefan Szeider
  • 1204.6233 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1203.3501 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1202.4331 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1202.3097 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1112.3244 #5 · backfill · confidence 0.70 Stefan Szeider
  • 1110.6387 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1110.6384 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1107.1177 #1 · backfill · confidence 0.70 Stefan Szeider
  • 1106.3527 #4 · backfill · confidence 0.70 Stefan Szeider
  • 1104.5566 #1 · backfill · confidence 0.70 Stefan Szeider
  • 1104.4290 #3 · backfill · confidence 0.70 Stefan Szeider
  • 1104.4279 #3 · backfill · confidence 0.70 Stefan Szeider
  • 1104.2842 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1104.2788 #2 · backfill · confidence 0.70 Stefan Szeider
  • 1104.2541 #2 · backfill · confidence 0.70 Stefan Szeider
  • 0907.4573 #4 · backfill · confidence 0.70 Stefan Szeider

Frequent Coauthors