World's Best Scientists 2026 revealed!
Stefan Szeider

Stefan Szeider

D-Index & Metrics

Computer Science

D-Index
37
Citations
5120
World Ranking
10860
National Ranking
93

Overview

Stefan Szeider is a researcher affiliated with TU Wien in Austria, specializing primarily in the field of Computer Science. Their work spans numerous subfields, with significant contributions in Artificial Intelligence and Computational Theory and Mathematics. Other areas of focus include Computer Networks and Communications, Information Systems, and Electrical and Electronic Engineering.

Their research covers a variety of topics, with notable emphasis on Constraint Satisfaction and Optimization, Formal Methods in Verification, and Advanced Graph Theory Research. Additional subjects of study include Bayesian Modeling and Causal Inference, Data Mining Algorithms and Applications, Complexity and Algorithms in Graphs, and Data Management and Algorithms.

Among their recent publications are:

  • "SAT-based Decision Tree Learning for Large Data Sets," 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • "The Complexity of Planning Revisited - A Parameterized Analysis," 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • "SAT-based Decision Tree Learning for Large Data Sets," 2024, Journal of Artificial Intelligence Research
  • "The Silent (R)evolution of SAT," 2023, Communications of the ACM
  • "Don't Be Strict in Local Search!," 2021, Proceedings of the AAAI Conference on Artificial Intelligence

Szeider frequently collaborates with several coauthors, including André Schidler, Sebastian Ordyniak, Robert Ganian, Markus Hecher, and Johannes K. Fichte.

The most common venues for their work include:

  • Zenodo (CERN European Organization for Nuclear Research)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • arXiv (Cornell University)
  • Journal of Artificial Intelligence Research
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Best Publications

  • On the complexity of some colorful problems parameterized by treewidth

    Michael R. Fellows;Fedor V. Fomin;Daniel Lokshtanov;Frances Rosamond

  • Algorithms for propositional model counting

    Marko Samer;Stefan Szeider

  • Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

    Herbert Fleischner;Oliver Kullmann;Stefan Szeider

  • Clique-Width is NP-Complete

    Michael R. Fellows;Frances A. Rosamond;Udi Rotics;Stefan Szeider

  • On Fixed-Parameter Tractable Parameterizations of SAT

    Stefan Szeider

  • Finding paths in graphs avoiding forbidden transitions

    Stefan Szeider

  • Backdoor Sets of Quantified Boolean Formulas

    Marko Samer;Stefan Szeider

  • Constraint satisfaction with bounded treewidth revisited

    Marko Samer;Stefan Szeider

  • Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems

    Georg Gottlob;Stefan Szeider

  • Solving MAX- r -SAT Above a Tight Lower Bound

    Noga Alon;Gregory Gutin;Eun Jung Kim;Stefan Szeider

  • The Added Value of Argumentation

    Sanjay Modgil;Francesca Toni;Floris Bex;Ivan Bratko

  • Detecting Backdoor Sets with Respect to Horn and Binary Clauses.

    Naomi Nishimura;Prabhakar Ragde;Stefan Szeider

  • Clique-width minimization is NP-hard

    Michael R. Fellows;Frances A. Rosamond;Udi Rotics;Stefan Szeider

  • Theory and Applications of Satisfiability Testing – SAT 2010

    Ofer Strichman;Stefan Szeider

  • Backdoors to satisfaction

    Serge Gaspers;Stefan Szeider

  • Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

    Stefan Szeider

  • Editing graphs to satisfy degree constraints: A parameterized approach

    Luke Mathieson;Stefan Szeider

  • Satisfiability of acyclic and almost acyclic CNF formulas

    Sebastian Ordyniak;Daniel Paulusma;Stefan Szeider

  • A probabilistic approach to problems parameterized above or below tight bounds

    Gregory Gutin;Eun Jung Kim;Stefan Szeider;Anders Yeo

  • Fixed-Parameter Tractability

    Marko Samer;Stefan Szeider

  • Computational Models of Argument: Proceedings of COMMA 2012

    B. Verheij;S. Szeider;S. Woltran

  • A Probabilistic Approach to Problems Parameterized above or below Tight Bounds

    Gregory Gutin;Eun Jung Kim;Stefan Szeider;Anders Yeo

  • Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference

    Herbert Fleischner;Stefan Szeider

Frequent Co-Authors

Gregory Gutin
Gregory Gutin Royal Holloway University of London
Anders Yeo
Anders Yeo University of Southern Denmark
Daniël Paulusma
Daniël Paulusma Durham University
Michael R. Fellows
Michael R. Fellows Lebanese American University
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Frances A. Rosamond
Frances A. Rosamond University of Bergen
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Bart Verheij
Bart Verheij University of Groningen
Noga Alon
Noga Alon Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a broad array of online degrees and dynamic career pathways. For those seeking a flexible alternative, choosing an online program from a most respected online university ensures a high standard of education with nationwide recognition.

If you have a passion for interactive technology, pursuing a game development online degree can lead to careers in gaming, animation, or virtual reality. Meanwhile, the increasing importance of online safety makes an online cyber security degree highly valuable for roles in information security, risk management, and IT infrastructure.

Additionally, a affordable online construction management degree combines technology and management, preparing graduates for leadership roles in the growing technology-driven construction sector.

With these related online degrees, students can customize their education to match evolving industry demands while maintaining flexibility and affordability.

Best Scientists Citing Stefan Szeider

Trending Scientists