Author:
Lodha Neha,Ordyniak Sebastian,Szeider Stefan
Publisher
Springer International Publishing
Reference21 articles.
1. Lecture Notes in Computer Science;I Adler,2010
2. Alekhnovich, M., Razborov, A.A.: Satisfiability, branch-width and Tseitin tautologies. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 593–603 (2002)
3. Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and complexity results for #SAT and Bayesian inference. In: 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 340–351 (2003)
4. Berg, J., Järvisalo, M.: SAT-based approaches to treewidth computation: an evaluation. In: 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, 10–12 November 2014, pp. 328–335. IEEE Computer Society (2014)
5. Bodlander, H.: TreewidthLIB a benchmark for algorithms for treewidth and related graph problems. http://www.staff.science.uu.nl/~bodla101/treewidthlib/
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Tangle bases: Revisited;Networks;2020-08-21
2. MaxSAT-Based Postprocessing for Treedepth;Lecture Notes in Computer Science;2020
3. An SMT Approach to Fractional Hypertree Width;Lecture Notes in Computer Science;2018
4. Exact Synthesis of Majority-Inverter Graphs and Its Applications;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2017-11
5. SAT-Encodings for Special Treewidth and Pathwidth;Theory and Applications of Satisfiability Testing – SAT 2017;2017