The following pages link to On r-Simple k-Path (Q2922590):
Displaying 7 items.
- Detecting monomials with \(k\) distinct variables (Q477587) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
- Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints (Q3452817) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Almost Optimal Cover-Free Families (Q5283363) (← links)
- On the Kőnig‐Egerváry theorem for ‐paths (Q5379839) (← links)
