D-Index & Metrics Best Publications
Stefan Szeider

Stefan Szeider

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 30 Citations 3,527 142 World Ranking 8557 National Ranking 76

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Programming language
  • Combinatorics

Stefan Szeider mostly deals with Discrete mathematics, Combinatorics, Parameterized complexity, Satisfiability and Boolean satisfiability problem. His Time complexity, Conjunctive normal form, Vertex, Vertex cover and Null graph investigations are all subjects of Discrete mathematics research. As part of his studies on Combinatorics, Stefan Szeider often connects relevant areas like Polynomial.

His Parameterized complexity study combines topics from a wide range of disciplines, such as Maximum satisfiability problem, Probabilistic logic and Bipartite graph. His research on Satisfiability concerns the broader Theoretical computer science. The Unit propagation research Stefan Szeider does as part of his general Theoretical computer science study is frequently linked to other disciplines of science, such as DPLL algorithm, therefore creating a link between diverse domains of science.

His most cited work include:

  • Algorithms for propositional model counting (105 citations)
  • Clique-Width is NP-Complete (96 citations)
  • Solving MAX- r -SAT Above a Tight Lower Bound (89 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Parameterized complexity, Time complexity and Treewidth. His study explores the link between Discrete mathematics and topics such as Polynomial that cross with problems in Kernel. His study in Combinatorics is interdisciplinary in nature, drawing from both Variable, Conjunctive normal form and Boolean satisfiability problem.

His Parameterized complexity research is multidisciplinary, relying on both Satisfiability, Theoretical computer science, Set, Polynomial hierarchy and Computational problem. His study focuses on the intersection of Time complexity and fields such as Resolution with connections in the field of Dependency and Mathematical proof. His research integrates issues of Partial k-tree, Tree-depth, Model counting and Tree decomposition in his study of Treewidth.

He most often published in these fields:

  • Discrete mathematics (48.67%)
  • Combinatorics (48.29%)
  • Parameterized complexity (46.77%)

What were the highlights of his more recent work (between 2015-2021)?

  • Parameterized complexity (46.77%)
  • Combinatorics (48.29%)
  • Discrete mathematics (48.67%)

In recent papers he was focusing on the following fields of study:

His scientific interests lie mostly in Parameterized complexity, Combinatorics, Discrete mathematics, Treewidth and Theoretical computer science. His Parameterized complexity study combines topics in areas such as Matrix and Set. His work in Combinatorics tackles topics such as Conjunctive normal form which are related to areas like Boolean satisfiability problem.

His study in the field of Satisfiability and Arity is also linked to topics like Class, Constraint satisfaction problem and Symmetry breaking. His Treewidth research is multidisciplinary, incorporating elements of Decomposition method and Model counting. His Theoretical computer science research integrates issues from Variable, Knowledge representation and reasoning, Tree-depth, Polynomial hierarchy and Maximum satisfiability problem.

Between 2015 and 2021, his most popular works were:

  • Dependency Learning for QBF (24 citations)
  • Soundness of Q-resolution with dependency schemes (24 citations)
  • Model Counting for CNF Formulas of Bounded Modular Treewidth (16 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Algebra
  • Programming language

Discrete mathematics, Parameterized complexity, Theoretical computer science, Combinatorics and Treewidth are his primary areas of study. His work in the fields of Discrete mathematics, such as Time complexity, Conjunctive normal form and Binary relation, intersects with other areas such as Constraint satisfaction problem and Multivalued dependency. The various areas that Stefan Szeider examines in his Parameterized complexity study include Matrix completion, Complement and Rank.

His work carried out in the field of Theoretical computer science brings together such families of science as Variable and Benchmark. He performs integrative Combinatorics and Hyperbolic tree research in his work. The Treewidth study combines topics in areas such as Decomposition method, Tree-depth and Boolean function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

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

Herbert Fleischner;Oliver Kullmann;Stefan Szeider.
Theoretical Computer Science (2002)

144 Citations

Algorithms for propositional model counting

Marko Samer;Stefan Szeider.
Journal of Discrete Algorithms (2010)

137 Citations

On the complexity of some colorful problems parameterized by treewidth

Michael R. Fellows;Fedor V. Fomin;Daniel Lokshtanov;Frances Rosamond.
Information & Computation (2011)

131 Citations

Clique-Width is NP-Complete

Michael R. Fellows;Frances A. Rosamond;Udi Rotics;Stefan Szeider.
SIAM Journal on Discrete Mathematics (2009)

126 Citations

Theory and Applications of Satisfiability Testing – SAT 2010

Ofer Strichman;Stefan Szeider.
Lecture Notes in Computer Science (2010)

124 Citations

On Fixed-Parameter Tractable Parameterizations of SAT

Stefan Szeider.
theory and applications of satisfiability testing (2003)

112 Citations

Backdoor Sets of Quantified Boolean Formulas

Marko Samer;Stefan Szeider.
Journal of Automated Reasoning (2009)

106 Citations

Finding paths in graphs avoiding forbidden transitions

Stefan Szeider.
Discrete Applied Mathematics (2003)

105 Citations

Detecting Backdoor Sets with Respect to Horn and Binary Clauses.

Naomi Nishimura;Prabhakar Ragde;Stefan Szeider.
theory and applications of satisfiability testing (2004)

101 Citations

Constraint satisfaction with bounded treewidth revisited

Marko Samer;Stefan Szeider.
Journal of Computer and System Sciences (2010)

101 Citations

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

Contact us

Best Scientists Citing Stefan Szeider

Saket Saurabh

Saket Saurabh

Institute of Mathematical Sciences

Publications: 64

Gregory Gutin

Gregory Gutin

Royal Holloway University of London

Publications: 64

Stefan Woltran

Stefan Woltran

TU Wien

Publications: 50

Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

Publications: 40

Dimitrios M. Thilikos

Dimitrios M. Thilikos

National and Kapodistrian University of Athens

Publications: 34

Rolf Niedermeier

Rolf Niedermeier

Technical University of Berlin

Publications: 33

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 33

Michael R. Fellows

Michael R. Fellows

University of Bergen

Publications: 32

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 32

Armin Biere

Armin Biere

Johannes Kepler University of Linz

Publications: 25

Dániel Marx

Dániel Marx

Saarland University

Publications: 25

Bruno Courcelle

Bruno Courcelle

University of Bordeaux

Publications: 22

Venkatesh Raman

Venkatesh Raman

Institute of Mathematical Sciences

Publications: 21

Joao Marques-Silva

Joao Marques-Silva

Centre national de la recherche scientifique, CNRS

Publications: 17

Georg Gottlob

Georg Gottlob

University of Oxford

Publications: 14

Vadim V. Lozin

Vadim V. Lozin

University of Warwick

Publications: 12

Something went wrong. Please try again later.