default search action
André Schidler
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]André Schidler
, Stefan Szeider
SAT-based Decision Tree Learning for Large Data Sets. J. Artif. Intell. Res. 80: 875-918 (2024) - [j4]Sebastian Ordyniak
Backdoor DNFs. J. Comput. Syst. Sci. 144: 103547 (2024) - [c15]André Schidler, Stefan Szeider:
Structure-Guided Local Improvement for Maximum Satisfiability. CP 2024: 26:1-26:23 - [d15]Sebastian Ordyniak
Backdoor DNFs Results and Source Code. Zenodo, 2024 - [d14]André Schidler
SAT-based Decision Tree Learning for Large Data Sets - Results and Source code. Zenodo, 2024 - 2023
- [j3]André Schidler
Computing optimal hypertree decompositions with SAT. Artif. Intell. 325: 104015 (2023) - [j2]André Schidler
SAT-boosted Tabu Search for Coloring Massive Graphs. ACM J. Exp. Algorithmics 28: 1.5:1-1.5:19 (2023) - [c14]Rafael Kiesel, André Schidler:
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. ALENEX 2023: 39-52 - [c13]André Schidler, Stefan Szeider
Computing Twin-width with SAT and Branch & Bound. IJCAI 2023: 2013-2021 - [d13]André Schidler
SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments. Zenodo, 2023 - [d12]André Schidler
Computing twin-width with SAT and branch & bound - Results. Zenodo, 2023 - [d11]André Schidler
Computing twin-width with SAT and branch & bound. Zenodo, 2023 - [d10]André Schidler
SAT-Boosted Tabu Search for Coloring Massive Graphs - Code. Zenodo, 2023 - [d9]André Schidler
Computing twin-width with branch & bound - PACE Submission. Zenodo, 2023 - [d8]André Schidler, Stefan Szeider
MaxSLIM Anytime MaxSAT Solver. Zenodo, 2023 - [i7]Marijn J. H. Heule, Inês Lynce, Stefan Szeider, André Schidler:
SAT Encodings and Beyond (Dagstuhl Seminar 23261). Dagstuhl Reports 13(6): 106-122 (2023) - 2022
- [j1]Robert Ganian, André Schidler
Threshold Treewidth and Hypertree Width. J. Artif. Intell. Res. 74: 1687-1713 (2022) - [c12]Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler
Tractable Abstract Argumentation via Backdoor-Treewidth. AAAI 2022: 5608-5615 - [c11]André Schidler
A SAT Approach to Twin-Width. ALENEX 2022: 67-77 - [c10]André Schidler
SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge). SoCG 2022: 74:1-74:8 - [c9]Rafael Kiesel, André Schidler:
PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT. IPEC 2022: 32:1-32:4 - [c8]Robert Ganian, Filip Pokrývka, André Schidler
Weighted Model Counting with Twin-Width. SAT 2022: 15:1-15:17 - [d7]Robert Ganian
Weighted Model Counting with Twin-Width: Experimental Results. Zenodo, 2022 - [d6]André Schidler
Computing Optimal Hypertree Decompositions with SAT - Results. Zenodo, 2022 - [i6]Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width. CoRR abs/2206.01706 (2022) - [i5]André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. CoRR abs/2210.07040 (2022) - [i4]Rafael Kiesel, André Schidler:
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. CoRR abs/2211.06109 (2022) - 2021
- [c7]André Schidler
SAT-based Decision Tree Learning for Large Data Sets. AAAI 2021: 3904-3912 - [c6]Sebastian Ordyniak
Backdoor DNFs. IJCAI 2021: 1403-1409 - [c5]André Schidler
Computing Optimal Hypertree Decompositions with SAT. IJCAI 2021: 1418-1424 - [d5]André Schidler
DT-SLIM Results. Zenodo, 2021 - [d4]André Schidler
DT-SLIM: SAT-based Decision Tree Learning for Large Data Sets. Zenodo, 2021 - [d3]André Schidler
HtdLEO Results. Zenodo, 2021 - [d2]André Schidler
HtdLEO source code. Zenodo, 2021 - [d1]André Schidler
A SAT Approach to Twin-Width. Zenodo, 2021 - [i3]André Schidler, Stefan Szeider:
A SAT Approach to Twin-Width. CoRR abs/2110.06146 (2021) - 2020
- [c4]André Schidler
Computing Optimal Hypertree Decompositions. ALENEX 2020: 1-11 - [c3]Johannes Klaus Fichte
Towards Faster Reasoners by Using Transparent Huge Pages. CP 2020: 304-322 - [c2]Johannes Klaus Fichte, Markus Hecher, André Schidler
Solving the Steiner Tree Problem with few Terminals. ICTAI 2020: 293-300 - [c1]Robert Ganian, André Schidler
Threshold Treewidth and Hypertree Width. IJCAI 2020: 1898-1904 - [i2]Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler
Towards Faster Reasoners By Using Transparent Huge Pages. CoRR abs/2004.14378 (2020) - [i1]Johannes Klaus Fichte, Markus Hecher, André Schidler
Solving the Steiner Tree Problem with few Terminals. CoRR abs/2011.04593 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: