Items where Author is "Marx, Dániel"Group by: Item Type | No Grouping Jump to: Article Number of items: 3. ArticleLokshtanov, Daniel ; Marx, Dániel ; Saurabh, Saket (2018) Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal ACM Transactions on Algorithms, 14 (2). pp. 1-30. ISSN 1549-6325 Cygan, Marek ; Dell, Holger ; Lokshtanov, Daniel ; Marx, Dániel ; Nederlof, Jesper ; Okamoto, Yoshio ; Paturi, Ramamohan ; Saurabh, Saket ; Wahlström, Magnus (2016) On Problems as Hard as CNF-SAT ACM Transactions on Algorithms, 12 (3). pp. 1-24. ISSN 1549-6325 Cygan, Marek ; Fomin, Fedor V. ; Kowalik, Łukasz ; Lokshtanov, Daniel ; Marx, Dániel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2011) Lower bounds based on the Exponential Time Hypothesis EATCS Bulletin, 105 . pp. 41-71. |

Up a level