The following pages link to Daniel Lokshtanov (Q270004):
Displaying 50 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- Finding the longest isometric cycle in a graph (Q967311) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- Critical node cut parameterized by treewidth and solution size is \(W[1]\)-hard (Q1687900) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Clustering with local restrictions (Q1951587) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS (Q2285114) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Quick but odd growth of cacti (Q2408205) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Imbalance is fixed parameter tractable (Q2445234) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- The chromatic number of squares of random graphs (Q2699860) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion (Q2802923) (← links)
- Parameterized Tractability of Multiway Cut with Parity Constraints (Q2843298) (← links)
- Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles (Q2862553) (← links)
- The Fine Details of Fast Dynamic Programming over Tree Decompositions (Q2867071) (← links)
- Faster Exact Algorithms for Some Terminal Set Problems (Q2867080) (← links)
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges (Q2867087) (← links)
- Hardness of r-dominating set on Graphs of Diameter (r + 1) (Q2867088) (← links)
- Saving space by algebraization (Q2875160) (← links)
