Items where Author is "Lokshtanov, D"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | No Grouping
Number of items: 8.

2012

DateAuthor/TitleDocument Type
2012Cygan, M and Dell, H and Lokshtanov, D and Marx, Dániel and Nederlof, J and Okamoto, Y and Paturi, R and Saurabh, S and Wahlström, M
On problems as hard as CNF-SAT
Conference or Workshop Item

2013

DateAuthor/TitleDocument Type
2013Lokshtanov, D and Marx, Dániel
Clustering with local restrictions
ISI Article

2016

DateAuthor/TitleDocument Type
2016Cygan, M and Dell, H and Lokshtanov, D and Marx, Dániel and Nederlof, J
On Problems as Hard as CNF-SAT
Article
2016Fomin, FV and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Pilipczuk, M
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
Book Section

2018

DateAuthor/TitleDocument Type
2018Agrawal, Akanksha and Jain, P and Kanesh, L and Lokshtanov, D and Saurabh, S
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy
Book Section
2018Lokshtanov, D and Marx, Dániel and Saurabh, S
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
Article
2018Lokshtanov, D and Marx, Dániel and Saurabh, S
Slightly Superexponential Parameterized Problems
Article
2018Bacsó, Gábor and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Tuza, Zsolt
Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs
Article
This list was generated on Tue Jun 25 03:04:34 2019 CEST.