%0 Journal Article %1 journals/talg/LokshtanovMS18 %A Lokshtanov, Daniel %A Marx, Dániel %A Saurabh, Saket %D 2018 %J ACM Trans. Algorithms %K dblp %N 2 %P 13:1-13:30 %T Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. %U http://dblp.uni-trier.de/db/journals/talg/talg14.html#LokshtanovMS18 %V 14

@article{journals/talg/LokshtanovMS18, added-at = {2018-11-21T00:00:00.000+0100}, author = {Lokshtanov, Daniel and Marx, Dániel and Saurabh, Saket}, biburl = {https://www.bibsonomy.org/bibtex/28ca4dfb29e5768bf884214849b60d2c3/dblp}, ee = {https://doi.org/10.1145/3170442}, interhash = {7136ffc69abea7b2c5a2262e46194d6c}, intrahash = {8ca4dfb29e5768bf884214849b60d2c3}, journal = {ACM Trans. Algorithms}, keywords = {dblp}, number = 2, pages = {13:1-13:30}, timestamp = {2018-11-22T11:38:15.000+0100}, title = {Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal.}, url = {http://dblp.uni-trier.de/db/journals/talg/talg14.html#LokshtanovMS18}, volume = 14, year = 2018 }