default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Szeider
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c166]Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider:
Breaking Symmetries in Quantified Graph Search: A Comparative Study. AAAI 2025: 11246-11254- [c165]Carlos Ansótegui, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia:
Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach. ICCS (2) 2025: 35-49 - [c164]Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners. NSE@ICSE 2025: 17-22 - [i88]Stefan Szeider:
MCP-Solver: Integrating Language Models with Constraint Programming Systems. CoRR abs/2501.00539 (2025) - [i87]André Schilder, Stefan Szeider:
Extracting Problem Structure with LLMs for Optimized SAT Local Search. CoRR abs/2501.14630 (2025) - [i86]Markus Kirchweger, Hai Xia, Tomás Peitl, Stefan Szeider:
Smart Cubing for Graph Search: A Comparative Study. CoRR abs/2501.17201 (2025) - [i85]Alexis de Colnet, Stefan Szeider, Tianwei Zhang:
Compilation and Fast Model Counting beyond CNF. CoRR abs/2502.00434 (2025) - [i84]Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider:
Breaking Symmetries in Quantified Graph Search: A Comparative Study. CoRR abs/2502.15078 (2025) - [i83]Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider:
Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. CoRR abs/2503.03576 (2025) - 2024
- [j89]André Schidler
, Stefan Szeider:
SAT-based Decision Tree Learning for Large Data Sets. J. Artif. Intell. Res. 80: 875-918 (2024) - [j88]Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere:
Satisfiability Modulo User Propagators. J. Artif. Intell. Res. 81: 989-1017 (2024) - [j87]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT backdoors: Depth beats size. J. Comput. Syst. Sci. 142: 103520 (2024) - [j86]Sebastian Ordyniak, André Schidler, Stefan Szeider:
Backdoor DNFs. J. Comput. Syst. Sci. 144: 103547 (2024) - [j85]Markus Kirchweger, Stefan Szeider:
SAT Modulo Symmetries for Graph Generation and Enumeration. ACM Trans. Comput. Log. 25(3): 1-30 (2024) - [c163]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider:
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. AAAI 2024: 7978-7986 - [c162]Hai Xia, Stefan Szeider:
SAT-Based Tree Decomposition with Iterative Cascading Policy Selection. AAAI 2024: 8191-8199 - [c161]Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider:
Learning Small Decision Trees for Data of Low Rank-Width. AAAI 2024: 10476-10483 - [c160]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider:
A General Theoretical Framework for Learning Smallest Interpretable Models. AAAI 2024: 10662-10669 - [c159]Stefan Szeider:
Large and Parallel Human Sorting Networks. CMSC 2024: 194-204 - [c158]André Schidler, Stefan Szeider:
Structure-Guided Local Improvement for Maximum Satisfiability. CP 2024: 26:1-26:23 - [c157]Markus Kirchweger, Stefan Szeider:
Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper). CP 2024: 37:1-37:11 - [c156]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia:
The Power of Collaboration: Learning Large Bayesian Networks at Scale. ICTAI 2024: 371-378 - [c155]Alexis de Colnet, Stefan Szeider, Tianwei Zhang:
Compilation and Fast Model Counting beyond CNF. IJCAI 2024: 3315-3323 - [c154]Robert Ganian, Viktoriia Korchemna, Stefan Szeider:
Revisiting Causal Discovery from a Complexity-Theoretic Perspective. IJCAI 2024: 3377-3385 - [c153]Leroy Chew, Alexis de Colnet, Stefan Szeider:
ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP. KR 2024 - [c152]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider:
Explaining Decisions in ML Models: A Parameterized Complexity Analysis. KR 2024 - [c151]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
eSLIM: Circuit Minimization with SAT Based Local Improvement. SAT 2024: 23:1-23:14 - [c150]Tianwei Zhang, Tomás Peitl, Stefan Szeider:
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. SAT 2024: 31:1-31:22 - [d25]Sebastian Ordyniak, André Schidler, Stefan Szeider:
Backdoor DNFs Results and Source Code. Zenodo, 2024
- [d24]André Schidler, Stefan Szeider:
SAT-based Decision Tree Learning for Large Data Sets - Results and Source code. Zenodo, 2024 - [d23]Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere:
Supplementary material of "Satisfiability modulo User Propagators". Zenodo, 2024 - [d22]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia:
collab-bn-slim. Zenodo, 2024 - [d21]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
eSLIM. DROPS Artifacts, 2024 - [d20]André Schidler, Stefan Szeider:
Structure-guided Local Improvement for Maximum Satisfiability Supplementary. Zenodo, 2024 - [d19]Florentina Voboril, P. R. Vaidyanathan, Stefan Szeider:
Code and Instances for the Paper Realtime Generation of Streamliners with Large Language Models. Zenodo, 2024 - [i82]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider:
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. CoRR abs/2402.00542 (2024) - [i81]Tianwei Zhang, Tomás Peitl, Stefan Szeider:
Small unsatisfiable k-CNFs with bounded literal occurrence. CoRR abs/2405.16149 (2024) - [i80]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. CoRR abs/2407.10699 (2024) - [i79]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider:
Explaining Decisions in ML Models: a Parameterized Complexity Analysis. CoRR abs/2407.15780 (2024) - [i78]Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Realtime Generation of Streamliners with Large Language Models. CoRR abs/2408.10268 (2024) - 2023
- [j84]André Schidler, Stefan Szeider:
Computing optimal hypertree decompositions with SAT. Artif. Intell. 325: 104015 (2023) - [j83]Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider:
The Silent (R)evolution of SAT. Commun. ACM 66(6): 64-72 (2023) - [j82]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
CSP beyond tractable constraint languages. Constraints An Int. J. 28(3): 450-471 (2023) - [j81]Tomás Peitl, Stefan Szeider:
Are hitting formulas hard for resolution? Discret. Appl. Math. 337: 173-184 (2023) - [j80]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On the parameterized complexity of clustering problems for incomplete data. J. Comput. Syst. Sci. 134: 1-19 (2023) - [j79]André Schidler, Stefan Szeider:
SAT-boosted Tabu Search for Coloring Massive Graphs. ACM J. Exp. Algorithmics 28: 1.5:1-1.5:19 (2023) - [c149]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Circuit Minimization with QBF-Based Exact Synthesis. AAAI 2023: 4087-4094 - [c148]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. AAAI 2023: 6363-6371 - [c147]Tianwei Zhang, Stefan Szeider:
Searching for Smallest Universal Graphs and Tournaments with SAT. CP 2023: 39:1-39:20 - [c146]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper). CP 2023: 48:1-48:10 - [c145]Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. ICML 2023: 9060-9070 - [c144]Markus Kirchweger, Tomás Peitl, Stefan Szeider:
Co-Certificate Learning with SAT Modulo Symmetries. IJCAI 2023: 1944-1953 - [c143]André Schidler, Stefan Szeider:
Computing Twin-width with SAT and Branch & Bound. IJCAI 2023: 2013-2021 - [c142]Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider:
Learning Small Decision Trees with Large Domain. IJCAI 2023: 3184-3192 - [c141]Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider:
The Parameterized Complexity of Finding Concise Local Explanations. IJCAI 2023: 3312-3320 - [c140]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC 2023: 16:1-16:14 - [c139]Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere:
IPASIR-UP: User Propagators for CDCL. SAT 2023: 8:1-8:13 - [c138]Markus Kirchweger, Tomás Peitl, Stefan Szeider:
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. SAT 2023: 13:1-13:17 - [c137]Markus Kirchweger, Manfred Scheucher, Stefan Szeider:
SAT-Based Generation of Planar Graphs. SAT 2023: 14:1-14:18 - [d18]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider:
Dataset of Random Reordered Encodings of Parity Problems. Zenodo, 2023 - [d17]Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere:
Supplementary material of submission "IPASIR-UP: User Propagators for CDCL". Zenodo, 2023 - [d16]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Supplementary Material for Proven optimally-balanced Latin rectangles with SAT. Version 1.0. Zenodo, 2023 [all versions] - [d15]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Supplementary Material for Proven optimally-balanced Latin rectangles with SAT. Version 1.1. Zenodo, 2023 [all versions] - [d14]André Schidler, Stefan Szeider:
SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments. Zenodo, 2023 - [d13]André Schidler, Stefan Szeider:
Computing twin-width with SAT and branch & bound - Results. Zenodo, 2023 - [d12]André Schidler, Stefan Szeider:
Computing twin-width with SAT and branch & bound. Zenodo, 2023 - [d11]André Schidler, Stefan Szeider:
SAT-Boosted Tabu Search for Coloring Massive Graphs - Code. Zenodo, 2023 - [d10]André Schidler, Stefan Szeider:
Computing twin-width with branch & bound - PACE Submission. Zenodo, 2023 - [d9]André Schidler, Stefan Szeider:
MaxSLIM Anytime MaxSAT Solver. Zenodo, 2023 - [i77]Markus Kirchweger, Tomás Peitl, Stefan Szeider:
Co-Certificate Learning with SAT Modulo Symmetries. CoRR abs/2306.10427 (2023) - [i76]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. CoRR abs/2312.07103 (2023) - [i75]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. CoRR abs/2312.07628 (2023) - [i74]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
- [j78]Robert Ganian, Jan Kratochvíl, Stefan Szeider:
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. Discret. Appl. Math. 312: 1-2 (2022) - [j77]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. 73: 535-552 (2022) - [j76]Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. J. Artif. Intell. Res. 74: 1687-1713 (2022) - [j75]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. SIAM J. Discret. Math. 36(4): 2635-2666 (2022) - [c136]Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, Stefan Woltran:
Tractable Abstract Argumentation via Backdoor-Treewidth. AAAI 2022: 5608-5615 - [c135]André Schidler, Stefan Szeider:
A SAT Approach to Twin-Width. ALENEX 2022: 67-77 - [c134]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
CSP Beyond Tractable Constraint Languages. CP 2022: 20:1-20:17 - [c133]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT Backdoors: Depth Beats Size. ESA 2022: 46:1-46:18 - [c132]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. ESA 2022: 47:1-47:14 - [c131]Markus Kirchweger, Manfred Scheucher, Stefan Szeider:
A SAT Attack on Rota's Basis Conjecture. SAT 2022: 4:1-4:18 - [c130]Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width. SAT 2022: 15:1-15:17 - [c129]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Learning large Bayesian networks with expert constraints. UAI 2022: 1592-1601 - [e6]Stefan Szeider, Robert Ganian, Alexandra Silva:
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria. LIPIcs 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-256-3 [contents] - [d8]Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width: Experimental Results. Zenodo, 2022 - [d7]André Schidler, Stefan Szeider:
Computing Optimal Hypertree Decompositions with SAT - Results. Zenodo, 2022 - [i73]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT Backdoors: Depth Beats Size. CoRR abs/2202.08326 (2022) - [i72]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. CoRR abs/2206.00752 (2022) - [i71]Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width. CoRR abs/2206.01706 (2022) - [i70]Tomás Peitl, Stefan Szeider:
Are Hitting Formulas Hard for Resolution? CoRR abs/2206.15225 (2022) - [i69]André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. CoRR abs/2210.07040 (2022) - 2021
- [j74]Robert Ganian, Stefan Szeider:
New width parameters for SAT and #SAT. Artif. Intell. 295: 103460 (2021) - [j73]Tomás Peitl, Stefan Szeider:
Finding the Hardest Formulas for Resolution. J. Artif. Intell. Res. 72: 69-97 (2021) - [c128]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. AAAI 2021: 3895-3903 - [c127]André Schidler, Stefan Szeider:
SAT-based Decision Tree Learning for Large Data Sets. AAAI 2021: 3904-3912 - [c126]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity of Small Decision Tree Learning. AAAI 2021: 6454-6462 - [c125]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Parameterized Complexity of Clustering Incomplete Data. AAAI 2021: 7296-7304 - [c124]Markus Kirchweger, Stefan Szeider:
SAT Modulo Symmetries for Graph Generation. CP 2021: 34:1-34:16 - [c123]Sebastian Ordyniak, André Schidler, Stefan Szeider:
Backdoor DNFs. IJCAI 2021: 1403-1409 - [c122]André Schidler, Stefan Szeider:
Computing Optimal Hypertree Decompositions with SAT. IJCAI 2021: 1418-1424 - [c121]Tomás Peitl, Stefan Szeider:
Finding the Hardest Formulas for Resolution (Extended Abstract). IJCAI 2021: 4814-4818 - [c120]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Learning Fast-Inference Bayesian Networks. NeurIPS 2021: 17852-17863 - [c119]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Certified DQBF Solving by Definition Extraction. SAT 2021: 499-517 - [p3]Marko Samer, Stefan Szeider:
Fixed-Parameter Tractability. Handbook of Satisfiability 2021: 693-736 - [d6]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
aditya95sriram/bn-slim: NeurIPS 2021. Zenodo, 2021 - [d5]André Schidler, Stefan Szeider:
DT-SLIM Results. Zenodo, 2021 - [d4]André Schidler, Stefan Szeider:
DT-SLIM: SAT-based Decision Tree Learning for Large Data Sets. Zenodo, 2021 - [d3]André Schidler, Stefan Szeider:
HtdLEO Results. Zenodo, 2021 - [d2]André Schidler, Stefan Szeider:
HtdLEO source code. Zenodo, 2021 - [d1]André Schidler, Stefan Szeider:
A SAT Approach to Twin-Width. Zenodo, 2021 - [i68]Laura Kovács, Hanna Lachnitt, Stefan Szeider:
Formalizing Graph Trail Properties in Isabelle/HOL. CoRR abs/2103.03607 (2021) - [i67]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Certified DQBF Solving by Definition Extraction. CoRR abs/2106.02550 (2021) - [i66]André Schidler, Stefan Szeider:
A SAT Approach to Twin-Width. CoRR abs/2110.06146 (2021) - 2020
- [j72]Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider:
On Existential MSO and Its Relation to ETH. ACM Trans. Comput. Theory 12(4): 22:1-22:32 (2020) - [c118]Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. AAAI 2020: 3906-3913 - [c117]André Schidler, Stefan Szeider:
Computing Optimal Hypertree Decompositions. ALENEX 2020: 1-11 - [c116]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT-Solving. CP 2020: 267-285 - [c115]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Breaking Symmetries with RootClique and LexTopSort. CP 2020: 286-303 - [c114]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
MaxSAT-Based Postprocessing for Treedepth. CP 2020: 478-495 - [c113]Tomás Peitl, Stefan Szeider:
Finding the Hardest Formulas for Resolution. CP 2020: 514-530 - [c112]Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. IJCAI 2020: 1898-1904 - [c111]Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. KR 2020: 392-402 - [c110]Laura Kovács, Hanna Lachnitt, Stefan Szeider:
Formalizing Graph Trail Properties in Isabelle/HOL. CICM 2020: 190-205 - [c109]Friedrich Slivovsky, Stefan Szeider:
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. SAT 2020: 267-276 - [c108]Ankit Shukla, Friedrich Slivovsky, Stefan Szeider:
Short Q-Resolution Proofs with Homomorphisms. SAT 2020: 412-428 - [i65]P. R. Vaidyanathan, Stefan Szeider:
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. CoRR abs/2006.13843 (2020) - [i64]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT Solving. CoRR abs/2008.02215 (2020)
2010 – 2019
- 2019
- [j71]Ronald de Haan, Stefan Szeider:
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms 12(9): 188 (2019) - [j70]Daniël Paulusma, Stefan Szeider:
On the parameterized complexity of (k, s)-SAT. Inf. Process. Lett. 143: 34-36 (2019) - [j69]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Dependency Learning for QBF. J. Artif. Intell. Res. 65: 180-208 (2019) - [j68]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Long-Distance Q-Resolution with Dependency Schemes. J. Autom. Reason. 63(1): 127-155 (2019) - [j67]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Qute in the QBF Evaluation 2018. J. Satisf. Boolean Model. Comput. 11(1): 261-272 (2019) - [j66]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. ACM Trans. Comput. Log. 20(3): 15:1-15:24 (2019) - [c107]Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. ALENEX 2019: 117-129 - [c106]Robert Ganian, Sebastian Ordyniak, Stefan Szeider:
A Join-Based Hybrid Parameter for Constraint Satisfaction. CP 2019: 195-212 - [c105]Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider:
The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS 2019: 7666-7676 - [c104]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Combining Resolution-Path Dependencies with Dependency Learning. SAT 2019: 306-318 - [c103]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Proof Complexity of Fragments of Long-Distance Q-Resolution. SAT 2019: 319-335 - [i63]Robert Ganian, Sebastian Ordyniak, Stefan Szeider:
A Join-Based Hybrid Parameter for Constraint Satisfaction. CoRR abs/1907.12335 (2019) - [i62]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On Clustering Incomplete Data. CoRR abs/1911.01465 (2019) - [i61]Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. CoRR abs/1911.12995 (2019) - 2018
- [j65]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. Algorithmica 80(2): 742-771 (2018) - [j64]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using well-structured modulators. Discret. Appl. Math. 248: 153-167 (2018) - [c102]Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider:
An SMT Approach to Fractional Hypertree Width. CP 2018: 109-127 - [c101]Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Portfolio-Based Algorithm Selection for Circuit QBFs. CP 2018: 195-209 - [c100]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. ICML 2018: 1642-1651 - [c99]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. ICTAI 2018: 733-737 - [c98]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Polynomial-Time Validation of QCDCL Certificates. SAT 2018: 253-269 - [i60]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. CoRR abs/1804.03423 (2018) - 2017
- [j63]Moritz Müller, Stefan Szeider:
The treewidth of proofs. Inf. Comput. 255: 147-164 (2017) - [j62]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85: 38-56 (2017) - [j61]Ronald de Haan, Stefan Szeider:
Parameterized complexity classes beyond para-NP. J. Comput. Syst. Sci. 87: 16-57 (2017) - [j60]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Trans. Algorithms 13(2): 29:1-29:32 (2017) - [j59]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. ACM Trans. Comput. Log. 18(3): 21:1-21:46 (2017) - [c97]M. S. Ramanujan, Stefan Szeider:
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. AAAI 2017: 3929-3935 - [c96]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. IJCAI 2017: 4894-4898 - [c95]Johannes Klaus Fichte, Stefan Szeider:
Backdoor Trees for Answer Set Programming. ASPOCP@LPNMR 2017 - [c94]Simone Bova, Stefan Szeider:
Circuit Treewidth, Sentential Decision, and Query Compilation. PODS 2017: 233-246 - [c93]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoor Treewidth for SAT. SAT 2017: 20-37 - [c92]Robert Ganian, Stefan Szeider:
New Width Parameters for Model Counting. SAT 2017: 38-52 - [c91]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Dependency Learning for QBF. SAT 2017: 298-313 - [c90]Johannes Klaus Fichte, Neha Lodha, Stefan Szeider:
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. SAT 2017: 401-411 - [c89]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Special Treewidth and Pathwidth. SAT 2017: 429-445 - [c88]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. STACS 2017: 36:1-36:17 - [p2]Serge Gaspers, Sebastian Ordyniak, Stefan Szeider:
Backdoor Sets for CSP. The Constraint Satisfaction Problem 2017: 137-157 - [i59]Simone Bova, Stefan Szeider:
Circuit Treewidth, Sentential Decision, and Query Compilation. CoRR abs/1701.04626 (2017) - [i58]Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan Szeider:
Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381). Dagstuhl Reports 7(9): 62-85 (2017) - 2016
- [j58]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. Algorithmica 74(1): 540-557 (2016) - [j57]Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica 76(1): 168-194 (2016) - [j56]Friedrich Slivovsky, Stefan Szeider:
Quantifier Reordering for QBF. J. Autom. Reason. 56(4): 459-477 (2016) - [j55]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with structural parameters. J. Comput. Syst. Sci. 82(2): 333-346 (2016) - [j54]Friedrich Slivovsky, Stefan Szeider:
Soundness of Q-resolution with dependency schemes. Theor. Comput. Sci. 612: 83-101 (2016) - [j53]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified conjunctive queries on partially ordered sets. Theor. Comput. Sci. 618: 72-84 (2016) - [j52]Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. ACM Trans. Comput. Log. 17(2): 10 (2016) - [c87]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoors to Tractable Valued CSP. CP 2016: 233-250 - [c86]Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff:
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. IPDPS 2016: 638-647 - [c85]Ronald de Haan, Stefan Szeider:
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. KR 2016: 453-462 - [c84]Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On Existential MSO and its Relation to ETH. MFCS 2016: 42:1-42:14 - [c83]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. SAT 2016: 179-195 - [c82]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Long Distance Q-Resolution with Dependency Schemes. SAT 2016: 500-518 - [c81]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. SODA 2016: 1670-1681 - [r2]Stefan Szeider:
Parameterized SAT. Encyclopedia of Algorithms 2016: 1530-1532 - [i57]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. CoRR abs/1610.03298 (2016) - [i56]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoors to Tractable Valued CSP. CoRR abs/1612.05733 (2016) - 2015
- [j51]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to tractable answer set programming. Artif. Intell. 220: 64-103 (2015) - [j50]Gregory Z. Gutin, Stefan Szeider:
Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica 71(3): 539-540 (2015) - [j49]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On the Subexponential-Time Complexity of CSP. J. Artif. Intell. Res. 52: 203-234 (2015) - [j48]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci. 81(7): 1311-1332 (2015) - [j47]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On finding optimal polytrees. Theor. Comput. Sci. 592: 49-58 (2015) - [j46]Iyad A. Kanj, Stefan Szeider:
Parameterized and subexponential-time complexity of satisfiability problems and applications. Theor. Comput. Sci. 607: 282-295 (2015) - [j45]Marijn Heule, Stefan Szeider:
A SAT Approach to Clique-Width. ACM Trans. Comput. Log. 16(3): 24:1-24:27 (2015) - [j44]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. ACM Trans. Comput. Log. 17(1): 7 (2015) - [c80]Ulle Endriss, Ronald de Haan, Stefan Szeider:
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. AAMAS 2015: 127-136 - [c79]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using Well-structured Modulators. IPEC 2015: 114-126 - [c78]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. MFCS (2) 2015: 348-360 - [c77]Robert Ganian, Stefan Szeider:
Community Structure Inspired Algorithms for SAT and #SAT. SAT 2015: 223-237 - [c76]Ronald de Haan, Stefan Szeider:
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. SOFSEM 2015: 217-229 - [c75]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. WADS 2015: 314-326 - [i55]Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff:
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. CoRR abs/1506.09100 (2015) - [i54]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. CoRR abs/1507.02479 (2015) - [i53]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. CoRR abs/1507.05463 (2015) - [i52]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-Kernelization using Well-Structured Modulators. CoRR abs/1507.05544 (2015) - [i51]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. CoRR abs/1509.05725 (2015) - 2014
- [j43]Serge Gaspers, Stefan Szeider:
Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Artif. Intell. 216: 1-19 (2014) - [j42]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory Pract. Log. Program. 14(2): 141-164 (2014) - [c74]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. AAAI 2014: 2652-2658 - [c73]Iyad A. Kanj, Stefan Szeider:
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. COCOA 2014: 637-651 - [c72]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Subexponential Time Complexity of CSP with Global Constraints. CP 2014: 272-288 - [c71]Simone Bova, Robert Ganian, Stefan Szeider:
Model checking existential logic on partially ordered sets. CSL-LICS 2014: 21:1-21:10 - [c70]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Small Unsatisfiable Subsets in Constraint Satisfaction. ICTAI 2014: 429-436 - [c69]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified Conjunctive Queries on Partially Ordered Sets. IPEC 2014: 122-134 - [c68]Ronald de Haan, Stefan Szeider:
The Parameterized Complexity of Reasoning Problems Beyond NP. KR 2014 - [c67]Ronald de Haan, Stefan Szeider:
Fixed-Parameter Tractable Reductions to SAT. SAT 2014: 85-102 - [c66]Friedrich Slivovsky, Stefan Szeider:
Variable Dependencies and Q-Resolution. SAT 2014: 269-284 - [i50]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity Results for Exact Bayesian Network Structure Learning. CoRR abs/1402.0558 (2014) - [i49]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. CoRR abs/1402.6109 (2014) - [i48]Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. CoRR abs/1405.2891 (2014) - [i47]Serge Gaspers, Stefan Szeider:
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning. CoRR abs/1406.3124 (2014) - [i46]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified Conjunctive Queries on Partially Ordered Sets. CoRR abs/1408.4263 (2014) - [i45]Friedrich Slivovsky, Stefan Szeider:
Model Counting for Formulas of Bounded Clique-Width. CoRR abs/1409.8464 (2014) - [i44]Ronald de Haan, Stefan Szeider:
Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j41]Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider:
Preface. Fundam. Informaticae 123(1) (2013) - [j40]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity Results for Exact Bayesian Network Structure Learning. J. Artif. Intell. Res. 46: 263-302 (2013) - [j39]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 53(4): 690-691 (2013) - [j38]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci. 481: 85-99 (2013) - [c65]Ronald de Haan, Anna Roubícková, Stefan Szeider:
Parameterized Complexity Results for Plan Reuse. AAAI 2013: 224-231 - [c64]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. AAAI 2013: 320-327 - [c63]Iyad A. Kanj, Stefan Szeider:
On the Subexponential Time Complexity of CSP. AAAI 2013: 459-465 - [c62]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CIAC 2013: 13-24 - [c61]Serge Gaspers, Stefan Szeider:
Strong Backdoors to Bounded Treewidth SAT. FOCS 2013: 489-498 - [c60]Stefan Szeider:
Capturing Structure in Hard Combinatorial Problems. ICTAI 2013: 897-898 - [c59]Andreas Pfandler, Stefan Rümmele, Stefan Szeider:
Backdoors to Abduction. IJCAI 2013: 1046-1052 - [c58]Friedrich Slivovsky, Stefan Szeider:
Model Counting for Formulas of Bounded Clique-Width. ISAAC 2013: 677-687 - [c57]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with Structural Parameters. MFCS 2013: 457-468 - [c56]Moritz Müller, Stefan Szeider:
Revisiting Space in Proof Complexity: Treewidth and Pathwidth. MFCS 2013: 704-716 - [c55]Marijn Heule, Stefan Szeider:
A SAT Approach to Clique-Width. SAT 2013: 318-334 - [c54]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Local Backbones. SAT 2013: 377-393 - [c53]Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. SAT 2013: 394-402 - [c52]Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. STACS 2013: 55-66 - [c51]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. STACS 2013: 67-79 - [c50]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. TAFA 2013: 158-175 - [e5]Gregory Z. Gutin, Stefan Szeider:
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8246, Springer 2013, ISBN 978-3-319-03897-1 [contents] - [i43]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. CoRR abs/1301.1391 (2013) - [i42]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-Kernelization with Structural Parameters. CoRR abs/1303.1786 (2013) - [i41]Iyad A. Kanj, Stefan Szeider:
On the Subexponential Time Complexity of CSP. CoRR abs/1304.1996 (2013) - [i40]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Local Backbones. CoRR abs/1304.5479 (2013) - [i39]Marijn Heule, Stefan Szeider:
A SAT Approach to Clique-Width. CoRR abs/1304.5498 (2013) - [i38]Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. CoRR abs/1304.5518 (2013) - [i37]Andreas Pfandler, Stefan Rümmele, Stefan Szeider:
Backdoors to Abduction. CoRR abs/1304.5961 (2013) - [i36]Ronald de Haan, Anna Roubícková, Stefan Szeider:
Parameterized Complexity Results for Plan Reuse. CoRR abs/1307.4440 (2013) - [i35]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
A Complete Parameterized Complexity Analysis of Bounded Planning. CoRR abs/1310.7828 (2013) - [i34]Ronald de Haan, Stefan Szeider:
The Parameterized Complexity of Reasoning Problems Beyond NP. CoRR abs/1312.1672 (2013) - [i33]Moritz Müller, Stefan Szeider:
Revisiting Space in Proof Complexity: Treewidth and Pathwidth. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j37]Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider:
Augmenting tractable fragments of abstract argumentation. Artif. Intell. 186: 157-173 (2012) - [j36]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica 64(1): 112-125 (2012) - [j35]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
On graph contractions and induced minors. Discret. Appl. Math. 160(6): 799-809 (2012) - [j34]Luke Mathieson, Stefan Szeider:
Editing graphs to satisfy degree constraints: A parameterized approach. J. Comput. Syst. Sci. 78(1): 179-191 (2012) - [c49]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! AAAI 2012: 486-492 - [c48]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On Finding Optimal Polytrees. AAAI 2012: 750-756 - [c47]Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Planning Revisited - A Parameterized Analysis. AAAI 2012: 1735-1741 - [c46]Serge Gaspers, Stefan Szeider:
Backdoors to Satisfaction. The Multivariate Algorithmic Revolution and Beyond 2012: 287-317 - [c45]Serge Gaspers, Stefan Szeider:
Backdoors to Acyclic SAT. ICALP (1) 2012: 363-374 - [c44]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. LATIN 2012: 350-361 - [c43]Friedrich Slivovsky, Stefan Szeider:
Computing Resolution-Path Dependencies in Linear Time , . SAT 2012: 58-71 - [c42]Serge Gaspers, Stefan Szeider:
Strong Backdoors to Nested Satisfiability. SAT 2012: 72-85 - [c41]Wolfgang Dvorák, Stefan Szeider, Stefan Woltran:
Abstract Argumentation via Monadic Second Order Logic. SUM 2012: 85-98 - [e4]Bart Verheij, Stefan Szeider, Stefan Woltran:
Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012. Frontiers in Artificial Intelligence and Applications 245, IOS Press 2012, ISBN 978-1-61499-110-6 [contents] - [i32]Friedrich Slivovsky, Stefan Szeider:
Computing Resolution-Path Dependencies in Linear Time. CoRR abs/1202.3097 (2012) - [i31]Serge Gaspers, Stefan Szeider:
Strong Backdoors to Nested Satisfiability. CoRR abs/1202.4331 (2012) - [i30]Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Exact Bayesian Structure Learning. CoRR abs/1203.3501 (2012) - [i29]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR abs/1204.3040 (2012) - [i28]Serge Gaspers, Stefan Szeider:
Strong Backdoors to Bounded Treewidth SAT. CoRR abs/1204.6233 (2012) - [i27]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! CoRR abs/1208.1688 (2012) - [i26]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On Finding Optimal Polytrees. CoRR abs/1208.1692 (2012) - [i25]Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Planning Revisited - A Parameterized Analysis. CoRR abs/1208.2566 (2012) - [i24]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CoRR abs/1211.0479 (2012) - 2011
- [j33]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and complexity results for persuasive argumentation. Artif. Intell. 175(9-10): 1722-1736 (2011) - [j32]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011) - [j31]Stefan S. Dantchev, Barnaby Martin, Stefan Szeider:
Parameterized Proof Complexity. Comput. Complex. 20(1): 51-85 (2011) - [j30]Marko Samer, Stefan Szeider:
Tractable cases of the extended global cardinality constraint. Constraints An Int. J. 16(1): 1-24 (2011) - [j29]Stefan Szeider:
The parameterized complexity of k-flip local search for SAT and MAX SAT. Discret. Optim. 8(1): 139-145 (2011) - [j28]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen:
On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2): 143-153 (2011) - [j27]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2): 422-429 (2011) - [j26]Stefan Szeider:
Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12(2): 12:1-12:21 (2011) - [c40]Stefan Szeider:
Limits of Preprocessing. AAAI 2011: 93-98 - [c39]Serge Gaspers, Stefan Szeider:
The Parameterized Complexity of Local Consistency. CP 2011: 302-316 - [c38]Serge Gaspers, Stefan Szeider:
Kernels for Global Constraints. IJCAI 2011: 540-545 - [c37]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Tractable Answer-Set Programming. IJCAI 2011: 863-868 - [c36]Sebastian Ordyniak, Stefan Szeider:
Augmenting Tractable Fragments of Abstract Argumentation. IJCAI 2011: 1033-1038 - [c35]Stefan Szeider:
The Parameterized Complexity of Constraint Satisfaction and Reasoning. INAP/WLP 2011: 27-37 - [c34]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). SAT 2011: 47-60 - [i23]Serge Gaspers, Stefan Szeider:
Kernels for Global Constraints. CoRR abs/1104.2541 (2011) - [i22]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Tractable Answer-Set Programming. CoRR abs/1104.2788 (2011) - [i21]Sebastian Ordyniak, Stefan Szeider:
Augmenting Tractable Fragments of Abstract Argumentation. CoRR abs/1104.2842 (2011) - [i20]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II). CoRR abs/1104.4279 (2011) - [i19]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Persuasive Argumentation. CoRR abs/1104.4290 (2011) - [i18]Stefan Szeider:
Limits of Preprocessing. CoRR abs/1104.5566 (2011) - [i17]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. CoRR abs/1106.3527 (2011) - [i16]Stefan Szeider:
Not So Easy Problems for Tree Decomposable Graphs. CoRR abs/1107.1177 (2011) - [i15]Serge Gaspers, Stefan Szeider:
Backdoors to Acyclic SAT. CoRR abs/1110.6384 (2011) - [i14]Serge Gaspers, Stefan Szeider:
Backdoors to Satisfaction. CoRR abs/1110.6387 (2011) - [i13]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. CoRR abs/1112.3244 (2011) - [i12]Serge Gaspers, Stefan Szeider:
The Parameterized Complexity of Local Consistency. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j25]Marko Samer, Stefan Szeider:
Constraint satisfaction with bounded treewidth revisited. J. Comput. Syst. Sci. 76(2): 103-114 (2010) - [j24]Marko Samer, Stefan Szeider:
Algorithms for propositional model counting. J. Discrete Algorithms 8(1): 50-64 (2010) - [j23]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 8(2): 101 (2010) - [c33]Wolfgang Dvorák, Stefan Szeider, Stefan Woltran:
Reasoning in Argumentation Frameworks of Bounded Clique-Width. COMMA 2010: 219-230 - [c32]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Persuasive Argumentation. COMMA 2010: 311-322 - [c31]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. FSTTCS 2010: 84-95 - [c30]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC 2010: 158-169 - [c29]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR 2010 - [c28]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517 - [c27]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514 - [c26]Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Exact Bayesian Structure Learning. UAI 2010: 401-408 - [e3]Ofer Strichman, Stefan Szeider:
Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Lecture Notes in Computer Science 6175, Springer 2010, ISBN 978-3-642-14185-0 [contents]
2000 – 2009
- 2009
- [j22]Marko Samer, Stefan Szeider:
Backdoor Sets of Quantified Boolean Formulas. J. Autom. Reason. 42(1): 77-97 (2009) - [j21]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 7(2): 147 (2009) - [j20]Stefan Szeider:
Matched Formulas and Backdoor Sets. J. Satisf. Boolean Model. Comput. 6(1-3): 1-12 (2009) - [j19]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Clique-Width is NP-Complete. SIAM J. Discret. Math. 23(2): 909-939 (2009) - [j18]Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider:
Covering graphs with few complete bipartite subgraphs. Theor. Comput. Sci. 410(21-23): 2045-2053 (2009) - [c25]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245 - [c24]Stefan Szeider:
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. SAT 2009: 276-283 - [p1]Marko Samer, Stefan Szeider:
Fixed-Parameter Tractability. Handbook of Satisfiability 2009: 425-454 - [i11]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound. CoRR abs/0906.1356 (2009) - [i10]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-2-SAT Above a Tight Lower Bound. CoRR abs/0907.4573 (2009) - 2008
- [j17]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008) - [j16]Georg Gottlob, Stefan Szeider:
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. Comput. J. 51(3): 303-325 (2008) - [j15]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Preface. J. Discrete Algorithms 6(4): 539 (2008) - [c23]Marko Samer, Stefan Szeider:
Backdoor Trees. AAAI 2008: 363-368 - [c22]Marko Samer, Stefan Szeider:
Tractable Cases of the Extended Global Cardinality Constraint. CATS 2008: 67-74 - [c21]Luke Mathieson, Stefan Szeider:
The Parameterized Complexity of Regular Subgraph Problems and Generalizations. CATS 2008: 79-86 - [c20]Luke Mathieson, Stefan Szeider:
Parameterized Graph Editing with Chosen Vertex Degrees. COCOA 2008: 13-22 - [c19]Stefan Szeider:
Monadic Second Order Logic on Graphs with Local Cardinality Constraints. MFCS 2008: 601-612 - [r1]Stefan Szeider:
Parameterized SAT. Encyclopedia of Algorithms 2008 - 2007
- [j14]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Solving #SAT using vertex covers. Acta Informatica 44(7-8): 509-523 (2007) - [j13]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007) - [c18]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen:
On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377 - [c17]Stefan S. Dantchev, Barnaby Martin, Stefan Szeider:
Parameterized Proof Complexity. FOCS 2007: 150-160 - [c16]Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider:
Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351 - [c15]Marko Samer, Stefan Szeider:
Algorithms for Propositional Model Counting. LPAR 2007: 484-498 - [c14]Stefan Szeider:
Matched Formulas and Backdoor Sets. SAT 2007: 94-99 - [c13]Marko Samer, Stefan Szeider:
Backdoor Sets of Quantified Boolean Formulas. SAT 2007: 230-243 - [i9]Stefan S. Dantchev, Barnaby Martin, Stefan Szeider:
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j12]Shlomo Hoory, Stefan Szeider:
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. SIAM J. Discret. Math. 20(2): 523-528 (2006) - [j11]Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006) - [c12]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367 - [c11]Marko Samer, Stefan Szeider:
Constraint Satisfaction with Bounded Treewidth Revisited. CP 2006: 499-513 - [c10]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71 - [c9]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Solving #SAT Using Vertex Covers. SAT 2006: 396-409 - [c8]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Clique-width minimization is NP-hard. STOC 2006: 354-362 - [e2]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Texts in Algorithmics 7, King's College, London 2006, ISBN 1-904987-38-9 [contents] - [i8]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. CoRR abs/cs/0604095 (2006) - [i7]Marko Samer, Stefan Szeider:
Complexity and Applications of Edge-Induced Vertex-Cuts. CoRR abs/cs/0607109 (2006) - [i6]Marko Samer, Stefan Szeider:
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth. CoRR abs/cs/0610174 (2006) - 2005
- [j10]Stefan Szeider:
Generalizations of matched CNF formulas. Ann. Math. Artif. Intell. 43(1): 223-238 (2005) - [j9]Herbert Fleischner, Stefan Szeider:
On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs Comb. 21(3): 301-306 (2005) - [j8]Stefan Szeider:
Backdoor Sets for DLL Subsolvers. J. Autom. Reason. 35(1-3): 73-88 (2005) - [j7]Stefan Szeider:
The Complexity of Resolution with Generalized Symmetry Rules. Theory Comput. Syst. 38(2): 171-188 (2005) - [j6]Shlomo Hoory, Stefan Szeider:
Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337(1-3): 347-359 (2005) - [e1]Hajo Broersma, Matthew Johnson, Stefan Szeider:
Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK. Texts in Algorithmics 4, King's College, London 2005, ISBN 1-904987-10-9 [contents] - [i5]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CoRR abs/cs/0511030 (2005) - [i4]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width. Electron. Colloquium Comput. Complex. TR05 (2005) - [i3]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Proving NP-hardness for clique-width II: non-approximability of clique-width. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j5]Stefan Szeider:
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors. Ars Comb. 73 (2004) - [j4]Stefan Szeider:
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. J. Comput. Syst. Sci. 69(4): 656-674 (2004) - [c7]Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234 - [c6]Shlomo Hoory, Stefan Szeider:
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004 - [c5]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT 2004 - 2003
- [j3]Stefan Szeider:
Finding paths in graphs avoiding forbidden transitions. Discret. Appl. Math. 126(2-3): 261-273 (2003) - [j2]Stefan Szeider:
Homomorphisms of conjunctive normal forms. Discret. Appl. Math. 130(2): 351-365 (2003) - [c4]Stefan Szeider:
Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. COCOON 2003: 548-558 - [c3]Stefan Szeider:
On Fixed-Parameter Tractable Parameterizations of SAT. SAT 2003: 188-202 - [c2]Stefan Szeider:
The Complexity of Resolution with Generalized Symmetry Rules. STACS 2003: 475-486 - [i2]Stefan Szeider:
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j1]Herbert Fleischner, Oliver Kullmann, Stefan Szeider:
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. 289(1): 503-516 (2002) - 2001
- [c1]Stefan Szeider:
NP-Completeness of Refutability by Literal-Once Resolution. IJCAR 2001: 168-181 - 2000
- [i1]Herbert Fleischner, Stefan Szeider:
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
[c154] [i80] [j80] [c145] [c140] [i76] [i75] [j78] [j77] [j76] [j75] [c132] [c130] [e6] [d8] [i72] [i71] [i69] [j74] [c125] [j72] [c118] [c112] [c111] [c107] [c106] [c105] [i63] [i62] [i61] [j65] [j64] [c100] [c99] [i60] [j60] [c93] [c92] [c88] [j55] [j53] [j52] [c87] [c86] [c84] [c81] [i57] [i56] [c79] [c78] [c77] [c75] [i55] [i54] [i53] [i52] [c71] [c69] [i48] [i46] [c57] [i42]
Iyad Kanj
aka: Iyad A. Kanj
aka: Iyad A. Kanj
[j87] [j86] [c161] [c160] [c152] [d25] [i80] [i79] [j82] [j80] [c145] [c142] [c141] [c140] [i76] [i75] [c134] [c133] [c132] [i73] [c126] [c125] [c123] [c118] [j66] [c107] [c106] [i63] [i62] [i61] [c100] [i60] [j62] [c96] [c89] [p2] [j58] [c83] [j48] [j47] [i51] [c74] [i50] [i49] [j40] [j38] [c62] [c53] [c51] [c50] [i38] [i35] [j37] [c49] [c48] [c47] [i30] [i27] [i26] [i25] [i24] [j33] [c36] [c34] [i21] [i20] [i19] [c32] [c31] [c26]
P. R. Vaidyanathan
aka: Vaidyanathan Peruvemba Ramaswamy
aka: Vaidyanathan Peruvemba Ramaswamy
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 2025-07-18 00:40 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:
