Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001. Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ACM Transactions on Algorithms, 14(2), 2018. [doi]
Abstract is missing.