The following pages link to Divide-and-Color (Q3522942):
Displaying 27 items.
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Finding monotone paths in edge-ordered graphs (Q602679) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- A note on algebraic techniques for subgraph detection (Q2122786) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Q3503572) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- (Q5075790) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Detours in directed graphs (Q6113279) (← links)