Talks and Poster Presentations (with Proceedings-Entry):
S. Ordyniak, D. Paulusma, St. Szeider:
"Satisfiability of Acyclic and Almost Acyclic CNF Formulas";
Talk: Theory and Application of Satisfiability Testing -- SAT,
Ann Arbor, MI, USA;
2011-06-19
- 2011-06-22; in: "Theory and Applications of Satisfiability Testing - SAT 2011",
Lecture Notes in Computer Science,
6695
(2011),
47
- 60.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-21581-0_6
Electronic version of the publication:
http://publik.tuwien.ac.at/files/PubDat_200956.pdf
Related Projects:
Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems
Created from the Publication Database of the Vienna University of Technology.