No. Title Author Year
1 A SAT Attack on Rota’s Basis Conjecture Kirchweger, Markus et al. 2022
2 CSP Beyond Tractable Constraint Languages Dreier, Jan et al. 2022
3 Finding a Cluster in Incomplete Data Eiben, Eduard et al. 2022
4 Front Matter, Table of Contents, Preface, Conference Organization Szeider, Stefan et al. 2022
5 LIPIcs, Volume 241, MFCS 2022, Complete Volume Szeider, Stefan et al. 2022
6 SAT Backdoors: Depth Beats Size Dreier, Jan et al. 2022
7 Weighted Model Counting with Twin-Width Ganian, Robert et al. 2022
8 SAT Modulo Symmetries for Graph Generation Kirchweger, Markus et al. 2021
9 Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381) Darwiche, Adnan et al. 2018
10 Backdoor Sets for CSP Gaspers, Serge et al. 2017
11 Combining Treewidth and Backdoors for CSP Ganian, Robert et al. 2017
12 On Existential MSO and its Relation to ETH Ganian, Robert et al. 2016
13 Meta-kernelization using Well-structured Modulators Eiben, Eduard et al. 2015
14 Backdoors to q-Horn Gaspers, Serge et al. 2013
15 Model Counting for CNF Formulas of Bounded Modular Treewidth Paulusma, Daniel et al. 2013
16 Satisfiability of Acyclic and Almost Acyclic CNF Formulas Ordyniak, Sebastian et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 16

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI