Pages that link to "Item:Q976105"
From MaRDI portal
The following pages link to Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105):
Displaying 50 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- A randomized algorithm for long directed cycle (Q264199) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Algebraic data retrieval algorithms for multi-channel wireless data broadcast (Q391229) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
- Detecting monomials with \(k\) distinct variables (Q477587) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- Nouvelle demonstration d'une congruence modulo 16 entre les nombres de classes d'ideaux de \(Q(\sqrt{-2p})\) et \(Q(\sqrt{2p})\) pour p premier = 1 (mod 4) (Q1838516) (← links)
- Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- A note on algebraic techniques for subgraph detection (Q2122786) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← 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)
- Randomized parameterized algorithms for the kidney exchange problem (Q2632525) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms (Q2672945) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints (Q3452817) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- (Q5075762) (← links)
- (Q5075790) (← links)
- (Q5090939) (← links)
