Discover open access scientific publications

Search, annotate, share and cite publications

Publications by Daniel Lokshtanov

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

SIAM Journal on Computing
MathematicsComputer Science
2014English

On Cutwidth Parameterized by Vertex Cover

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Cops and Robber Game Without Recharging

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Guard Games on Graphs: Keep the Intruder Out!

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Solving Multicut Faster Than 2 N

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth

2018English

Bidimensionality and Geometric Graphs

2012English

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth

2017English

Approximation Schemes via Width/Weight Trade-Offs on Minor-Free Graphs

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy