The following pages link to Daniel Lokshtanov (Q270004):
Displaying 21 items.
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- Faster Exact Algorithms for Some Terminal Set Problems (Q2867080) (← links)
- Representative Sets of Product Families (Q2921430) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Kernel(s) for problems with no kernel (Q3189081) (← links)
- Distortion Is Fixed Parameter Tractable (Q3638056) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems (Q4629983) (← links)
- Exact Algorithms via Monotone Local Search (Q5244381) (← links)
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems (Q5458528) (← links)
- An Exact Algorithm for Minimum Distortion Embedding (Q5851098) (← links)
- An improved parameterized algorithm for treewidth (Q6499248) (← links)
