André Schidler

34 papers A* 10A 8B 3Journal 13
YearRankTypeTitle / Venue / Authors
2026 A* conf
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach.
AAAI
Hannes Ihalainen, Dieter Vandesande, André Schidler, Jeremias Berg, Bart Bogaerts, Matti Järvisalo
2026 A* conf
Ordered Objectives in Maximum Satisfiability.
AAAI
Jeremias Berg, André Schidler, Matti Järvisalo
2025 A conf
Analyzing Reformulation Performance in Core-Guided MaxSAT Solving.
SAT
André Schidler, Stefan Szeider
2025 J jnl
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach.
CoRR
Hannes Ihalainen, Dieter Vandesande, André Schidler, Jeremias Berg, Bart Bogaerts, Matti Järvisalo
2025 A conf
Learn to Unlearn.
SAT
Bernhard Gstrein, Florian Pollitt, André Schidler, Mathias Fleury, Armin Biere
2025 A* conf
Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms.
ICML
Christian Komusiewicz, André Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus
2025 B conf
PACE Solver Description: Minimum Hitting Set Computation via Core-Guided MaxSAT Solving.
IPEC
André Schidler
2024 J jnl
Backdoor DNFs.
J. Comput. Syst. Sci.
Sebastian Ordyniak, André Schidler, Stefan Szeider
2024 J jnl
SAT-based Decision Tree Learning for Large Data Sets.
J. Artif. Intell. Res.
André Schidler, Stefan Szeider
2024 A conf
Structure-Guided Local Improvement for Maximum Satisfiability.
CP
André Schidler, Stefan Szeider
2023 A conf
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets.
ALENEX
Rafael Kiesel, André Schidler
2023 A* conf
Computing Twin-width with SAT and Branch & Bound.
IJCAI
André Schidler, Stefan Szeider
2023 J jnl
Computing optimal hypertree decompositions with SAT.
Artif. Intell.
André Schidler, Stefan Szeider
2023 J jnl
SAT Encodings and Beyond (Dagstuhl Seminar 23261).
Dagstuhl Reports
Marijn J. H. Heule, Inês Lynce, Stefan Szeider, André Schidler
2023 J jnl
SAT-boosted Tabu Search for Coloring Massive Graphs.
ACM J. Exp. Algorithmics
André Schidler, Stefan Szeider
2022 J jnl
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets.
CoRR
Rafael Kiesel, André Schidler
2022 A conf
A SAT Approach to Twin-Width.
ALENEX
André Schidler, Stefan Szeider
2022 B conf
PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT.
IPEC
Rafael Kiesel, André Schidler
2022 A* conf
SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge).
SoCG
André Schidler
2022 J jnl
Threshold Treewidth and Hypertree Width.
CoRR
André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider
2022 J jnl
Threshold Treewidth and Hypertree Width.
J. Artif. Intell. Res.
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
2022 A* conf
Tractable Abstract Argumentation via Backdoor-Treewidth.
AAAI
Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, Stefan Woltran
2022 A conf
Weighted Model Counting with Twin-Width.
SAT
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
2022 J jnl
Weighted Model Counting with Twin-Width.
CoRR
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
2021 J jnl
A SAT Approach to Twin-Width.
CoRR
André Schidler, Stefan Szeider
2021 A* conf
Backdoor DNFs.
IJCAI
Sebastian Ordyniak, André Schidler, Stefan Szeider
2021 A* conf
Computing Optimal Hypertree Decompositions with SAT.
IJCAI
André Schidler, Stefan Szeider
2021 A* conf
SAT-based Decision Tree Learning for Large Data Sets.
AAAI
André Schidler, Stefan Szeider
2020 A conf
Computing Optimal Hypertree Decompositions.
ALENEX
André Schidler, Stefan Szeider
2020 B conf
Solving the Steiner Tree Problem with few Terminals.
ICTAI
Johannes Klaus Fichte, Markus Hecher, André Schidler
2020 J jnl
Solving the Steiner Tree Problem with few Terminals.
CoRR
Johannes Klaus Fichte, Markus Hecher, André Schidler
2020 A* conf
Threshold Treewidth and Hypertree Width.
IJCAI
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
2020 J jnl
Towards Faster Reasoners By Using Transparent Huge Pages.
CoRR
Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler
2020 A conf
Towards Faster Reasoners by Using Transparent Huge Pages.
CP
Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler