Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Ordyniak:2013:SAA, author = "Sebastian Ordyniak and Daniel Paulusma and Stefan Szeider", title = "Satisfiability of acyclic and almost acyclic {CNF} formulas", journal = j-THEOR-COMP-SCI, volume = "481", number = "??", pages = "85--99", day = "15", month = apr, year = "2013", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Tue Apr 16 05:48:59 MDT 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397513000054", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }