Szeider, Stefan
230  Ergebnisse:
Personensuche X
?
1

Backdoor DNFs:

Ordyniak, Sebastian ; Schidler, Andre ; Szeider, Stefan
Journal of Computer and System Sciences.  144 (2024)  - p. 103547 , 2024
 
?
2

SAT backdoors: Depth beats size:

Dreier, Jan ; Ordyniak, Sebastian ; Szeider, Stefan
Journal of Computer and System Sciences.  142 (2024)  - p. 103520 , 2024
 
?
4

The Silent (R)evolution of SAT:

Fichte, Johannes K. ; Berre, Daniel Le ; Hecher, Markus.
Communications of the ACM.  66 (2023)  6 - p. 64-72 , 2023
 
?
5

On the parameterized complexity of clustering problems for ..:

Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad..
Journal of Computer and System Sciences.  134 (2023)  - p. 1-19 , 2023
 
?
7

Are hitting formulas hard for resolution?:

Peitl, Tomáš ; Szeider, Stefan
Discrete Applied Mathematics.  337 (2023)  - p. 173-184 , 2023
 
?
 
?
9

Algorithmic Applications of Tree-Cut Width:

Ganian, Robert ; Kim, Eun Jung ; Szeider, Stefan
SIAM Journal on Discrete Mathematics.  36 (2022)  4 - p. 2635-2666 , 2022
 
?
11

New width parameters for SAT and #SAT:

Ganian, Robert ; Szeider, Stefan
Artificial Intelligence.  295 (2021)  - p. 103460 , 2021
 
?
12

Certified DQBF Solving by Definition Extraction:

, In: Theory and Applications of Satisfiability Testing – SAT 2021; Lecture Notes in Computer Science,
 
?
14

On Existential MSO and Its Relation to ETH:

Ganian, Robert ; Haan, Ronald de ; Kanj, Iyad.
ACM Transactions on Computation Theory.  12 (2020)  4 - p. 1-32 , 2020
 
?
15

A Faster Algorithm for Propositional Model Counting Paramet..:

, In: Theory and Applications of Satisfiability Testing – SAT 2020; Lecture Notes in Computer Science,
Slivovsky, Friedrich ; Szeider, Stefan - p. 267-276 , 2020
 
1-15