Articles with public access mandates - Daniel LokshtanovLearn more
Not available anywhere: 2
Hitting selected (odd) cycles
D Lokshtanov, P Misra, MS Ramanujan, S Saurabh
SIAM Journal on Discrete Mathematics 31 (3), 1581-1615, 2017
Mandates: European Commission
An ETH-Tight Algorithm for Bidirected Steiner Connectivity
D Lokshtanov, P Misra, F Panolan, S Saurabh, M Zehavi
Algorithms and Data Structures Symposium, 588-604, 2023
Mandates: US National Science Foundation
Available somewhere: 112
A 5-Approximation Algorithm for Treewidth
HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ...
SIAM Journal on Computing 45 (2), 317-378, 2016
Mandates: Netherlands Organisation for Scientific Research, European Commission
Efficient computation of representative families with applications in parameterized and exact algorithms
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
Journal of the ACM (JACM) 63 (4), 1-60, 2016
Mandates: European Commission
Known algorithms on graphs of bounded treewidth are probably optimal
D Lokshtanov, D Marx, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-30, 2018
Mandates: Hungarian Scientific Research Fund, European Commission
On problems as hard as CNF-SAT
M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ...
ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016
Mandates: US National Science Foundation, Netherlands Organisation for Scientific …
(Meta) kernelization
HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ...
Journal of the ACM (JACM) 63 (5), 1-69, 2016
Mandates: Netherlands Organisation for Scientific Research, European Commission
Slightly superexponential parameterized problems
D Lokshtanov, D Marx, S Saurabh
SIAM Journal on Computing 47 (3), 675-702, 2018
Mandates: Hungarian Scientific Research Fund, European Commission
Almost optimal lower bounds for problems parameterized by clique-width
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
SIAM Journal on Computing 43 (5), 1541-1563, 2014
Mandates: European Commission, Research Council of Norway
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
FV Fomin, D Lokshtanov, S Saurabh, M Pilipczuk, M Wrochna
ACM Transactions on Algorithms (TALG) 14 (3), 1-45, 2018
Mandates: European Commission
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Mandates: Austrian Science Fund, European Commission
Beating brute force for systems of polynomial equations over finite fields
D Lokshtanov, R Paturi, S Tamaki, R Williams, H Yu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Mandates: US National Science Foundation
Minimum bisection is fixed parameter tractable
M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
Mandates: European Commission
A near-optimal planarization algorithm
BMP Jansen, D Lokshtanov, S Saurabh
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
Mandates: European Commission
Hitting forbidden minors: Approximation and kernelization
FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh
SIAM Journal on Discrete Mathematics 30 (1), 383-410, 2016
Mandates: European Commission
Exact algorithms via monotone local search
FV Fomin, S Gaspers, D Lokshtanov, S Saurabh
Journal of the ACM (JACM) 66 (2), 1-23, 2019
Mandates: Australian Research Council, European Commission, Research Council of Norway
Tight bounds for linkages in planar graphs
I Adler, SG Kolliopoulos, PK Krause, D Lokshtanov, S Saurabh, D Thilikos
Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011
Mandates: German Research Foundation
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth
D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
SIAM Journal on Computing 46 (1), 161-189, 2017
Mandates: European Commission
Representative families of product families
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017
Mandates: European Commission
A new perspective on FO model checking of dense graph classes
J Gajarský, P Hliněný, J Obdržálek, D Lokshtanov, MS Ramanujan
ACM Transactions on Computational Logic (TOCL) 21 (4), 1-23, 2020
Mandates: Austrian Science Fund, European Commission
Publication and funding information is determined automatically by a computer program