André Schidler

Orcid: 0000-0001-6790-7158

Affiliations:
  • TU Wien, Vienna, Austria


According to our database1, André Schidler authored at least 32 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SAT-based Decision Tree Learning for Large Data Sets - Results and Source code.
Dataset, May, 2024

Backdoor DNFs Results and Source Code.
Dataset, May, 2024

Backdoor DNFs.
J. Comput. Syst. Sci., 2024

SAT-based Decision Tree Learning for Large Data Sets.
J. Artif. Intell. Res., 2024

Structure-Guided Local Improvement for Maximum Satisfiability.
Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024

2023
SAT-boosted Tabu Search for Coloring Massive Graphs.
ACM J. Exp. Algorithmics, December, 2023

Computing optimal hypertree decompositions with SAT.
Artif. Intell., December, 2023

MaxSLIM Anytime MaxSAT Solver.
Dataset, December, 2023

Computing twin-width with branch & bound - PACE Submission.
Dataset, June, 2023

SAT-Boosted Tabu Search for Coloring Massive Graphs - Code.
Dataset, May, 2023

Computing twin-width with SAT and branch & bound.
Dataset, May, 2023

Computing twin-width with SAT and branch & bound - Results.
Dataset, May, 2023

SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments.
Dataset, March, 2023

SAT Encodings and Beyond (Dagstuhl Seminar 23261).
Dagstuhl Reports, 2023

Computing Twin-width with SAT and Branch & Bound.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Computing Optimal Hypertree Decompositions with SAT - Results.
Dataset, July, 2022

Weighted Model Counting with Twin-Width: Experimental Results.
Dataset, June, 2022

Threshold Treewidth and Hypertree Width.
J. Artif. Intell. Res., 2022

Weighted Model Counting with Twin-Width.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge).
Proceedings of the 38th International Symposium on Computational Geometry, 2022

A SAT Approach to Twin-Width.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

Tractable Abstract Argumentation via Backdoor-Treewidth.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
A SAT Approach to Twin-Width.
Dataset, October, 2021

HtdLEO source code.
Dataset, May, 2021

HtdLEO Results.
Dataset, May, 2021

DT-SLIM: SAT-based Decision Tree Learning for Large Data Sets.
Dataset, March, 2021

DT-SLIM Results.
Dataset, March, 2021

2020
Solving the Steiner Tree Problem with few Terminals.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Towards Faster Reasoners by Using Transparent Huge Pages.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Computing Optimal Hypertree Decompositions.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020


  Loading...