André Schidler | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/andre-schidler/André SchidlerHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngAndré Schidlerhttps://ac.tuwien.ac.at/team/andre-schidler/Analyzing Reformulation Performance in Core-Guided MaxSAT Solvinghttps://ac.tuwien.ac.at/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/Extracting Problem Structure with LLMs for Optimized SAT Local Searchhttps://ac.tuwien.ac.at/publication/extracting-problem-structure-with-llms-for-optimized-sat-local-search/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/extracting-problem-structure-with-llms-for-optimized-sat-local-search/SAT-based Decision Tree Learning for Large Data Setshttps://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-3/Structure-guided Local Improvement for Maximum Satisfiabilityhttps://ac.tuwien.ac.at/publication/structure-guided-local-improvement-for-maximum-satisfiability/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/structure-guided-local-improvement-for-maximum-satisfiability/A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Setshttps://ac.tuwien.ac.at/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/Computing optimal hypertree decompositions with SAThttps://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-with-sat-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-with-sat-2/A SAT Approach to Twin-Widthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-twin-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-twin-width/PACE Solver Description: DAGer - Cutting out Cycles with MaxSAThttps://ac.tuwien.ac.at/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)https://ac.tuwien.ac.at/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/Backdoor DNFshttps://ac.tuwien.ac.at/publication/backdoor-dnfs-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs-2/Parameterized Complexity of Small Decision Tree Learninghttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning-2/SAT-based Decision Tree Learning for Large Data Setshttps://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-2/SAT-based Decision Tree Learning for Large Data Setshttps://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets/Computing Optimal Hypertree Decompositionshttps://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-2/Computing Optimal Hypertree Decompositionshttps://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions/Solving the Steiner Tree Problem with few Terminalshttps://ac.tuwien.ac.at/publication/solving-the-steiner-tree-problem-with-few-terminals/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-steiner-tree-problem-with-few-terminals/Towards Faster Reasoners by Using Transparent Huge Pageshttps://ac.tuwien.ac.at/publication/towards-faster-reasoners-by-using-transparent-huge-pages/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-faster-reasoners-by-using-transparent-huge-pages/