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.
