Talks and Poster Presentations (with Proceedings-Entry):
S. Ordyniak, D. Paulusma, St. Szeider:
"Satisfiability of Acyclic and Almost Acyclic CNF Formulas";
Talk: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science,
Chennai, India;
2010-12-15
- 2010-12-18; in: "IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)",
K. Lodaya, M. Mahajan (ed.);
Leibniz International Proceedings in Informatics (LIPIcs),
(2010),
ISSN: 1868-8969;
84
- 95.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.84
Related Projects:
Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems
Created from the Publication Database of the Vienna University of Technology.